Anonymous Routing in Mobile Ad Hoc Networks Neer - Technion

114 Pages·2011·0.58 MB·English

Anonymous Routing in Mobile Ad Hoc Networks
Neer Roggel
Technion - Computer Science Department - M.Sc. Thesis MSC-2011-06 - 2011
Technion - Computer Science Department - M.Sc. Thesis MSC-2011-06 - 2011
Anonymous Routing in Mobile Ad Hoc Networks
Research Thesis
Submitted in Partial Fulfillment of the Requirements
for the Degree of Master of Science
in Computer Science
Neer Roggel
Submitted to the Senate of the Technion — Israel Institute of Technology
NISAN, 5771 Haifa April, 2011
Technion - Computer Science Department - M.Sc. Thesis MSC-2011-06 - 2011
Technion - Computer Science Department - M.Sc. Thesis MSC-2011-06 - 2011
This Research Thesis was completed under the supervision of Roy Friedman in the
Department of Computer Science
I thank everyone for everything. My beloved family for their loving support,my courageous
friends for their encouragements, my patient advisor for his insightful perspectives and the
many more who have taught me along the way and who shall, fittingly, remain anonymous.
Amir, Rachelly and Bar, for inspiring me to work hard through personal example, for ever
providing me with unconditional security and for wishing me naught but happiness.
Daniel, for his heartening fortitude, for his hospitality and for good times aplenty. Karine,
for her tenacity, candor and special audacity. Gal, for sharing his unique clarity of thought
and good cheer. Orr, for his quiet chivalry and for introducing me to the Technion.
Roy, for getting me going, for vivid archery analogies, for a wonderful trip to Finland, for
listening to endless internal debate, for helping me to structure my arguments, for ensuring
all is kept in balance, for reading endless drafts, for offering his invaluable advice and for
maintaining calm with a smile and gentle kindness (and for added financial assistance).
The generous financial help of the Technion is gratefully acknowledged
Technion - Computer Science Department - M.Sc. Thesis MSC-2011-06 - 2011
Technion - Computer Science Department - M.Sc. Thesis MSC-2011-06 - 2011
Contents
Abstract 1
List of Symbols 3
1 Introduction 5
2 Models 9
2.1 Items of interest . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9
2.2 System model . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9
2.3 Network model . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 10
2.4 Threat model . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11
2.4.1 Attacker capabilities . . . . . . . . . . . . . . . . . . . . . . . . . . . 11
2.4.2 Modi operandi . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 15
2.5 Adversary model . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 18
2.6 Trust model . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 19
2.7 Motion model . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 19
3 Goals 21
3.1 Anonymity (and friends) . . . . . . . . . . . . . . . . . . . . . . . . . . . . 21
3.1.1 Unobservability . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 22
3.1.2 Immeasurability . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 22
3.1.3 Anonymity . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 23
3.1.4 Comparison . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 24
3.2 Communication (and routing) . . . . . . . . . . . . . . . . . . . . . . . . . 24
3.2.1 Procedures . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 25
3.2.2 Invocations . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 25
3.2.3 Identities . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 26
3.3 Performance . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 28
i
Technion - Computer Science Department - M.Sc. Thesis MSC-2011-06 - 2011
ii Contents (continued)
3.3.1 Complexity . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 28
3.3.2 Cryptography . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 28
3.3.3 Heterogeneity . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 28
3.3.4 Implementability . . . . . . . . . . . . . . . . . . . . . . . . . . . . 28
3.3.5 Robustness . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 28
3.3.6 Scalability . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 28
3.4 Problem statement . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 29
4 Anonymity-blas´e systems 31
4.1 Flood Routing Algorithms . . . . . . . . . . . . . . . . . . . . . . . . . . . 31
4.1.1 Assumptions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 32
4.1.2 Specification . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 32
4.2 Dynamic Source Routing (DSR) . . . . . . . . . . . . . . . . . . . . . . . . 35
4.2.1 Assumptions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 35
4.2.2 Specification . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 35
5 Analysis 37
5.1 Observations . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 37
5.2 Limitations . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 38
5.3 Preliminaries . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 39
6 Mononymous routing 41
6.1 Agreements . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 42
6.2 Mononymous FRAs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 42
6.3 Mononymous DSR . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 45
7 Polyonymous routing 47
7.1 Agreements . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 48
7.2 Polyonymous FRAs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 48
7.3 Polyonymous DSR . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 50
8 Anonymity-aware systems 51
8.1 Mix Route Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 52
8.1.1 Assumptions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 52
8.1.2 Specification . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 53
8.2 Secure Distributed Anonymous Routing (SDAR) . . . . . . . . . . . . . . . 54
Technion - Computer Science Department - M.Sc. Thesis MSC-2011-06 - 2011
Contents (continued) iii
8.2.1 Assumptions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 54
8.2.2 Specification . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 55
8.3 Anonymous Routing Protocol for MANETs (ARM) . . . . . . . . . . . . . 56
8.3.1 Assumptions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 56
8.3.2 Specification . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 57
9 Comparison 59
10 Related work 63
10.1 Anonymity in wired networks . . . . . . . . . . . . . . . . . . . . . . . . . . 63
10.2 Anonymity in MANETs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 64
11 Conclusion 65
11.1 Summary . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 65
11.2 Discussion . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 66
11.3 Contributions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 67
11.4 Insights . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 68
11.5 Open issues . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 68
A Optional features 71
B Procedures of DSR 75
C Wormhole routing 81
C.1 Assumptions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 81
C.2 Specification . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 82
References 82
Hebrew Abstract i
Technion - Computer Science Department - M.Sc. Thesis MSC-2011-06 - 2011
iv Contents (continued)
Technion - Computer Science Department - M.Sc. Thesis MSC-2011-06 - 2011