Title Page
Abstract
Contents
1. Introduction 15
2. Overview and Background 19
2.1. Overview 19
2.2. Privacy-preserving roaming protocols 22
2.2.1. Related works 22
2.3. Privacy-Preserving message authentication protocols 26
2.3.1. Related works 26
2.4. key management 28
2.4.1. Related works 28
3. Privacy-Preserving Roaming Protocol 31
3.1. Contributions 33
3.2. Preliminaries 35
3.2.1. Bilinear maps and hard problems 35
3.2.2. Signcryption 35
3.2.3. Canetti-Krawczyk (CK) model 36
3.3. System model and requirements 39
3.3.1. System model and assumptions 39
3.3.2. System requirements 40
3.4. Proposed protocol 43
3.4.1. Overview 43
3.4.2. Initial process 45
3.4.3. Anonymous roaming system 47
3.5. Analysis and Evaluation 53
3.5.1. Requirements Analysis 53
3.5.2. Performance evaluation 59
3.6. Discussion 66
4. Privacy-Preserving Message Authentication Protocol 67
4.1. Contributions 68
4.2. System model and requirements 69
4.2.1. System model and assumptions 69
4.2.2. System requirements 71
4.3. Proposed protocol 73
4.3.1. Setup 75
4.3.2. Registration 76
4.3.3. Management of Revocation Lists 77
4.3.4. Message Authentication for V2V 78
4.4. Analysis and Evaluation 82
4.4.1. Requirement Analysis 82
4.4.2. Performance evaluation 86
4.5. Discussion 96
5. Key Management For Revocation 97
5.1. Contributions 98
5.2. System model and requirements 99
5.2.1. System model and assumptions 99
5.2.2. System requirements 99
5.3. Proposed key management 100
5.3.1. Initialization of group key & update keys 100
5.3.2. Group key distribution 104
5.3.3. Update of group key 105
5.3.4. Renewal of update keys 110
5.4. Analysis and Evaluation 111
5.4.1. Requirement Analysis 111
5.4.2. Performance Evaluation 111
5.4.3. Discussion. 115
6. Conclusion 116
Bibliography 118
3.1. Notation used for the proposed roaming protocol 44
3.2. Format of pseudo-identity 46
3.3. Comparison of functionalities and performances 58
3.4. Computation times 59
3.5. Comparison of the time required for authentication at the FS 64
4.1. Notation 74
4.2. Simulation Parameters 88
5.1. Notation 100
2.1. Overview of the proposed protocols 20
3.1. System model of the roaming protocol 40
3.2. Roaming agreement 47
3.3. Roaming authentication 49
3.4. Comparison of authentication costs at a roaming node 61
3.5. Computation overhead at FS 63
3.6. Extra computation overhead at FS 65
4.1. System model of message authentication protocol 69
4.2. Generation of pseudo identities 78
4.3. An example of road condition 85
4.4. Road map for simulation 89
4.5. The probability of unverified messages versus the verification probability... 91
4.6. The probability of un-verified messages versus the vehicle density... 93
4.7. Message loss ratio versus the vehicle density 95
5.1. Example of update keys 101
5.2. Examples of group key update messages 110
5.3. Average transmission delay of GK 113
1. Update Revocation List 51
2. Revocation Check 51
3. Generate param & keys for b-tree 102
4. Generate keys for n-ary tree 103
5. Generate BU K* 108
6. Generate NU K* 109