Logical Analysis and Verification of Cryptographic Protocols - Loria

More documents

Recommendations

Info

66 CHAPTER 3. PROTOCOLS WITH VULNERABLE HASH FUNCTIONS 3.3.5 Symbolic derivation Given a intruder system I = 〈F, LI, H〉, and a protocol P. At step i, a role in P receives a (possibly ∅) message, checks its well-formedness by verifying that it is as expected, and applies rules in LI to construct the response. We give in Definition 30 (Chapter 2) a specification of role, this specification is adequate when the intruder deduction rules are of the form x1, . . . , xn → f(x1, . . . , xn) with f a public function symbol in F. Since, in this chapter, we consider a different form of the intruder deduction rules (Definition 35), we represent a role by a symbolic derivation [72]. Definition 40 (Symbolic Derivations) Let I = 〈F, LI, H〉 be an intruder deduction system. A I-symbolic derivation is a tuple (V, S, K, In, Out) where V is a finite sequence of variables (xi)i∈Ind, indexed by a linearly ordered set (Ind,
3.3. THE MODEL 67 • InA = � x A 1 , x A 2 • OutA = � y A 1 , y A 2 • SA = � x A 1 � , � , ? = ∅, x A 2 ? = enc p (x, P kA), y A 1 ? = enc p (〈A, NA〉, P kB), y A 2 The role B is represented by the following symbolic derivation: (VB, SB, KB, InB, OutB) with: • VB = � xB 01, xB 02, xB 03, xB 04, xB 05, xB 06, xB 1 , yB 1 xB 04 < xB 05 < xB 06 < xB 1 < yB 1 • KB = � A, B, NB, KB, K −1 B • InB = � xB � 1 , • OutA = � yB � 1 , • SB = � x B 1 ? = enc p (y, P kB), y A 1 � , KA , Composition of symbolic derivations � ? = ∅ � , ordered as follows: x B 01 < x B 02 < x B 03 < ? = encp (NB, P kπ1(decp (xB 1 ,P k−1 B ))) � Given two I-symbolic derivations, we show next how to compose them [72]. Definition 41 Let I = 〈F, LI, H〉 be an intruder deduction system, and let C1 = (V1, S1, K1, In1, Out1) and C2 = (V2, S2, K2, In2, Out2) be two I-symbolic derivations with two disjoint sets of variables and index sets (Ind1,
Page 1:
Logical Analysis and Verification o
Page 5:
Abstract This thesis is developed i
Page 8 and 9:
viii
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 70 and 71: 58 CHAPTER 3. PROTOCOLS WITH VULNER
Page 112 and 113: 100 CHAPTER 4. PROTOCOLS WITH VULNE
Page 124 and 125: 112 CHAPTER 5. SATURATED DEDUCTION
Page 126 and 127: 114 CHAPTER 5. SATURATED DEDUCTION
Page 128 and 129:
116 CHAPTER 5. SATURATED DEDUCTION
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

Create successful ePaper yourself

Delete template?

Save as template?