Logical Analysis and Verification of Cryptographic Protocols - Loria

More documents

Recommendations

Info

208 BIBLIOGRAPHY [83] H. Comon-Lundh and V. Cortier. Computational soundness of observational equivalence. In CCS’08: Proceedings of the 15th ACM Conference on Computer and Communications Security, pages 109–118. ACM Press, 2008. [84] H. Comon-Lundh and V. Cortier. New decidability results for fragments of first-order logic and application to cryptographic protocols. In R. Nieuwenhuis editor, RTA, volume 2709 of Lecture Notes in Computer Science, pages 148–164, Springer, 2003. [85] H. Comon-Lundh, V. Cortier, and J. Mitchell. Tree automata with one memory, set constraints, and ping-pong protocols. In F. Orejas and P. G. Spirakis and J. van Leeuwen editors, ICALP, volume 2076 of Lecture Notes in Computer Science, pages 682–693, Springer, 2001. [86] H. Comon-Lundh and S. Delaune. The finite variant property: How to get rid of some algebraic properties. In J. Giesl, editor, RTA, volume 3467 of Lecture Notes in Computer Science, pages 294–307. Springer, 2005. [87] H. Comon-Lundh and V. Shmatikov. Intruder deductions, constraint solving and insecurity decision in presence of exclusive or. In LICS, pages 271–, 2003. [88] R. Corin. Analysis model for security protocols. Phd thesis, University of Twente, Twente, The Netherlands, 2006. [89] V. Cortier. Vérification automatiques des protocoles cryptographiques. Thèse de doctorat, Laboratoire Spécification et Vérification, ENS Cachan, France, 2003. [90] V. Cortier, S. Delaune, and P. Lafourcade. A survey of algebraic properties used in cryptographic protocols. Journal of Computer Security, 14(1):1–43, 2006. [91] V. Cortier, M. Rusinowitch, and E. Zalinescu. A resolution strategy for verifying cryptographic protocols with cbc encryption and blind signatures. In P. Barahona and A. P. Felty, editors, PPDP, pages 12–22. ACM, 2005. [92] R. Cramer, M. K. Franklin, B. Schoenmakers, and M. Yung. Multi-autority secret-ballot elections with linear work. In EUROCRYPT, pages 72–83, 1996. [93] R. Cramer and V. Shoup. A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack. In H. Krawczyk, editor, CRYPTO, volume 1462 of Lecture Notes in Computer Science, pages 13–25. Springer, 1998.
BIBLIOGRAPHY 209 [94] M. Daum and S. Lucks. Attacking hash functions by poisoned messages. rump session, Eurocrypt, 2005. [95] S. Delaune and F. Jacquemard. Narrowing−based constraint solving for the verification of security protocols. In Proceedings of the 18th International Workshop of Unification (UNIF’04), Cork, Ireland, 2004. [96] S. Delaune and F. Jacquemard. A theory of dictionary attacks and its complexity. In CSFW, pages 2–15. IEEE Computer Society, 2004. [97] S. Delaune, S. Kremer, and M. Ryan. Verifying privacy-type properties of electronic voting protocols. Journal of Computer Security, 17(4):435–487, 2009. [98] B. den Boer and A. Bosselaers. Collisions for the compressin function of md5. In EUROCRYPT, pages 293–304, 1993. [99] D. E. Denning and G. M. Sacco. Timestamps in key distribution protocols. Commun. ACM, 24(8):533–536, 1981. [100] N. Dershowitz and J.P Jouannaud. Rewrite systems. In Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics (B), pages 243–320. 1990. [101] W. Diffie and M.E. Hellman. Nex directions in cryptography. IEEE Trans. Info. Theory IT-22, pages 644–654, November 1976. [102] W. Diffie, P.l C. van Oorschot, and M.l J. Wiener. Authentication and authenticated key exchanges. Des. Codes Cryptography, 2(2):107–125, 1992. [103] H. Dobbertin. Cryptanalysis of md5 compress. rumps session, Eurocrypt, 1996. [104] H. Dobbertin. Cryptanalysis of md4. In D. Gollmann editor, FSE, volume 1039 of Lecture Notes in Computer Science, pages 53–69, Springer, 1996. [105] H. Dobbertin, A. Bosselaers, and B. Preneel. Ripemd-160: A strengthened version of ripemd. In D. Gollmann editor, FSE, volume 1039 of Lecture Notes in Computer Science, pages 71–82, Springer, 1996. [106] D. Dolev, S. Even, and R. M. Karp. On the security of ping-pong protocols. Information and Control, 55(1-3):57–68, 1982. [107] D. Dolev and A. Chi-Chih Yao. On the security of public key protocols. IEEE Transactions on Information Theory, 29(2):198–207, 1983.
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 34 and 35:
Page 36 and 37:
Page 38 and 39:
Page 40 and 41:
Page 42 and 43:
Page 44 and 45:
Page 46 and 47:
Page 48 and 49:
Page 50 and 51:
Page 52 and 53:
Page 54 and 55:
Page 56 and 57:
Page 58 and 59:
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: 158 CHAPTER 6. ON THE GROUND ENTAIL
Page 190 and 191: 178 CHAPTER 7. VOTER VERIFIABILITY
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 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?