Logical Analysis and Verification of Cryptographic Protocols - Loria

More documents

Recommendations

Info

viii
Contents 1 Introduction 1 1.1 Cryptographic protocols . . . . . . . . . . . . . . . . . . . . . . . . 1 1.1.1 Communication via exchanges of messages . . . . . . . . . 1 1.1.2 Participants . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 1.1.3 Security properties . . . . . . . . . . . . . . . . . . . . . . . 3 1.2 Cryptographic primitives . . . . . . . . . . . . . . . . . . . . . . . 4 1.2.1 Concatenation . . . . . . . . . . . . . . . . . . . . . . . . . . 5 1.2.2 Exclusive or . . . . . . . . . . . . . . . . . . . . . . . . . . . 5 1.2.3 Pairing . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5 1.2.4 Encryption schemes . . . . . . . . . . . . . . . . . . . . . . 5 1.2.5 Signature . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 1.2.6 Blind signature . . . . . . . . . . . . . . . . . . . . . . . . . 8 1.2.7 Hash function . . . . . . . . . . . . . . . . . . . . . . . . . . 8 1.3 Example: Needham-Schroeder protocol . . . . . . . . . . . . . . . 9 1.4 Analysis of cryptographic protocols . . . . . . . . . . . . . . . . . 10 1.4.1 Overview . . . . . . . . . . . . . . . . . . . . . . . . . . . . 10 1.4.2 Symbolic analysis of cryptographic protocols . . . . . . . . 12 1.5 Contributions and plan of this thesis . . . . . . . . . . . . . . . . . 15 1.5.1 Decidability results in presence of algebraic operators . . . 15 1.5.2 Chapter 6: Decidability result for the ground entailment problem in the first order logic . . . . . . . . . . . . . . . . 17 1.5.3 Chapter 7: Analysis of electronic voting protocols: “voter verifiability” property . . . . . . . . . . . . . . . . . . . . . 18 2 Protocol analysis using constraint solving 19 2.1 Preliminaries . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 20 2.1.1 Multisets . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 20 2.1.2 Terms over a signature . . . . . . . . . . . . . . . . . . . . . 20 2.1.3 Positions and subterms . . . . . . . . . . . . . . . . . . . . 21 2.1.4 Substitutions . . . . . . . . . . . . . . . . . . . . . . . . . . 22 2.1.5 Equational theories and rewriting systems . . . . . . . . . 22 2.1.6 The completion procedures . . . . . . . . . . . . . . . . . . 24 ix
Page 1: Logical Analysis and Verification o
Page 5: Abstract This thesis is developed i
Page 10 and 11: x CONTENTS 2.1.7 Unification . . .
Page 12 and 13: xii CONTENTS 5.8 Decidability of re
Page 14 and 15: 2 CHAPTER 1. INTRODUCTION Figure 1.
Page 16 and 17: 4 CHAPTER 1. INTRODUCTION Secrecy T
Page 18 and 19: 6 CHAPTER 1. INTRODUCTION “G”.
Page 20 and 21: 8 CHAPTER 1. INTRODUCTION And, a pe
Page 22 and 23: 10 CHAPTER 1. INTRODUCTION intercep
Page 24 and 25: 12 CHAPTER 1. INTRODUCTION Figure 1
Page 26 and 27: 14 CHAPTER 1. INTRODUCTION have bee
Page 28 and 29: 16 CHAPTER 1. INTRODUCTION the orde
Page 30 and 31: 18 CHAPTER 1. INTRODUCTION 1.5.3 Ch
Page 32 and 33: 20 CHAPTER 2. PROTOCOL ANALYSIS USI
Page 58 and 59:
46 CHAPTER 2. PROTOCOL ANALYSIS USI
Page 60 and 61:
Page 62 and 63:
Page 64 and 65:
Page 66 and 67:
Page 68 and 69:
Page 70 and 71:
58 CHAPTER 3. PROTOCOLS WITH VULNER
Page 72 and 73:
Page 74 and 75:
Page 76 and 77:
Page 78 and 79:
Page 80 and 81:
Page 82 and 83:
Page 84 and 85:
Page 86 and 87:
Page 88 and 89:
Page 90 and 91:
Page 92 and 93:
Page 94 and 95:
Page 96 and 97:
Page 98 and 99:
Page 100 and 101:
Page 102 and 103:
Page 104 and 105:
Page 106 and 107:
Page 108 and 109:
Page 110 and 111:
Page 112 and 113:
100 CHAPTER 4. PROTOCOLS WITH VULNE
Page 114 and 115:
Page 116 and 117:
Page 118 and 119:
Page 120 and 121:
Page 122 and 123:
Page 124 and 125:
112 CHAPTER 5. SATURATED DEDUCTION
Page 126 and 127:
Page 128 and 129:
Page 130 and 131:
Page 132 and 133:
Page 134 and 135:
Page 136 and 137:
Page 138 and 139:
Page 140 and 141:
Page 142 and 143:
Page 144 and 145:
Page 146 and 147:
Page 148 and 149:
Page 150 and 151:
Page 152 and 153:
Page 154 and 155:
Page 156 and 157:
Page 158 and 159:
Page 160 and 161:
148 CHAPTER 6. ON THE GROUND ENTAIL
Page 162 and 163:
Page 164 and 165:
Page 166 and 167:
Page 168 and 169:
Page 170 and 171:
Page 172 and 173:
Page 174 and 175:
Page 176 and 177:
Page 178 and 179:
Page 180 and 181:
Page 182 and 183:
Page 184 and 185:
Page 186 and 187:
Page 188 and 189:
Page 190 and 191:
178 CHAPTER 7. VOTER VERIFIABILITY
Page 192 and 193:
Page 194 and 195:
Page 196 and 197:
Page 198 and 199:
Page 200 and 201:
Page 202 and 203:
Page 204 and 205:
Page 206 and 207:
Page 208 and 209:
Page 210 and 211:
198 CHAPTER 8. CONCLUSION AND PERSP
Page 212 and 213:
200 CHAPTER 8. CONCLUSION AND PERSP
Page 214 and 215:
202 BIBLIOGRAPHY [12] M. Abadi and
Page 216 and 217:
204 BIBLIOGRAPHY [36] M. Bellare, A
Page 218 and 219:
206 BIBLIOGRAPHY [60] U. Hustadt Ch
Page 220 and 221:
208 BIBLIOGRAPHY [83] H. Comon-Lund
Page 222 and 223:
210 BIBLIOGRAPHY [108] B. Donovan,
Page 224 and 225:
212 BIBLIOGRAPHY [132] T. Kohno, A.
Page 226 and 227:
214 BIBLIOGRAPHY [160] J. C. Mitche
Page 228 and 229:
216 BIBLIOGRAPHY [187] H. Seidl and
show all

Logical Analysis and Verification of Cryptographic Protocols - Loria

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?