|M.Sc Student||Roggel Neer|
|Subject||Anonymous Routing for Mobile Ad Hoc Networks|
|Department||Department of Computer Science||Supervisor||Professor Roy Friedman|
|Full Thesis text|
A wireless, mobile, ad hoc network (MANET) is a network in which mobile nodes do not rely on the existence of fixed infrastructure mediation devices, but rather communicate with one another directly. Under certain scenarios, parties in a MANET may wish to remain unidentified, in order to forestall retaliation by an attacker. In the course of this work, we study mechanisms for anonymous routing in MANETs. As our first main contribution, we construct a simple framework for formal reasoning about anonymous routing in MANETs, within which we prove our results. We describe routing and identities, explore threats to anonymity in MANETs, derive a suitable adversary model and use it to define several notions of anonymity in a formal yet intuitive manner. As our second main contribution, we prove that use of unbiased identity agreements, in which addresses are equally likely to be assigned to different nodes, lets existing routing algorithms achieve anonymity. As our third main contribution, we prove that use of multiple identities per node can increase information hiding. Throughout, we avoid cryptography and defend against a weakened adversary. Finally, we survey existing anonymization schemes and compare approaches.