Logical Analysis and Verification of Cryptographic Protocols - Loria

More documents

Recommendations

Info

204 BIBLIOGRAPHY [36] M. Bellare, A. Boldyreva, and S. Micali. Public-key encryption in a multiuser setting: Security proofs and improvements. In EUROCRYPT, pages 259–274, 2000. [37] M. Bellare and Ph. Rogaway. Entity authentication and key distribution. In D. R. Stinson, editor, CRYPTO, volume 773 of Lecture Notes in Computer Science, pages 232–249. Springer, 1993. [38] M. Bellare and Ph. Rogaway. The security of triple encryption and a framework for code-based game-playing proofs. In S. Vaudenay, editor, EUROCRYPT, volume 4004 of Lecture Notes in Computer Science, pages 409–426. Springer, 2006. [39] J. Cohen Benaloh and D. Tuinstra. Receipt-free secret-ballot elections (extended abstract). In STOC, pages 544–553, 1994. [40] V. Bernat and H. Comon-Lundh. Normal proofs in intruder theories. In M. Okada and I. Satoh editors, ASIAN, volume 4435 of Lecture Notes in Computer Science, pages 151–166, Springer, 2006. [41] K. Bhargavan, C. Fournet, and A. D. Gordon. A semantics for web services authentication. In N. D. Jones and X. Leroy, editors, POPL, pages 198–209. ACM, 2004. [42] E. Biham and R. Chen. Near-collisions of sha-0. In M. K. Franklin, editor, CRYPTO, volume 3152 of Lecture Notes in Computer Science, pages 290–305. Springer, 2004. [43] S. Blake-Wilson, D. Johnson, and A. Menezes. Key agreement protocols and their security analysis. In M. Darnell, editor, IMA Int. Conf., volume 1355 of Lecture Notes in Computer Science, pages 30–45. Springer, 1997. [44] S. Blake-Wilson and A. Menezes. Authenticated diffie-hellman key agreement protocols. In Selected Areas in Cryptography, pages 339–361, 1998. [45] S. Blake-Wilson and A. Menezes. Unknown key-share attacks on the station-to-station (sts) protocol. In H. Imai and Y. Zheng, editors, Public Key Cryptography, volume 1560 of Lecture Notes in Computer Science, pages 154–170. Springer, 1999. [46] B. Blanchet. An efficient cryptographic protocol verifier based on prolog rules. In CSFW’01: Proceedings of the 14th IEEE Computer Security Foundations Workshop, pages 82–96. IEEE Computer Society Press, 2001. [47] B. Blanchet. From secrecy to authenticity in security protocols. In M. V. Hermenegildo and G. Puebla, editors, SAS, volume 2477 of Lecture Notes in Computer Science, pages 342–359. Springer, 2002.
BIBLIOGRAPHY 205 [48] B. Blanchet. Computationally sound mechanized proofs of correspondence assertions. In CSF, pages 97–111. IEEE Computer Society, 2007. [49] B. Blanchet. Vérification automatique de protocoles cryptographiques : modèle formel et modèle calculatoire. Mémoire d’habilitation à diriger des recherches, Université Paris-Dauphine, November 2008. [50] B. Blanchet, M. Abadi, and C. Fournet. Automated verification of selected equivalences for security protocols. In LICS, pages 331–340. IEEE Computer Society, 2005. [51] Bruno Blanchet. Automatic proof of strong secrecy for security protocols. In IEEE Symposium on Security and Privacy, pages 86–, 2004. [52] D. Bolignano. Towards the formal verification of electronic commerce protocols. In CSFW, pages 133–147. IEEE Computer Society, 1997. [53] M. Boreale. Symbolic trace analysis of cryptographic protocols. In F. Orejas and P. G. Spirakis and J. van Leeuwen editors, ICALP, volume 2076 of Lecture Notes in Computer Science, pages 667–681, Springer, 2001. [54] M. Boreale and M. G. Buscemi. A method for symbolic analysis of security protocols. Theor. Comput. Sci., 338(1-3):393–425, 2005. [55] R.S. Boyer and J.S. Moore. The sharing of structure in theorem-proving programs. In Machine Intelligence, vol. 7, B. Meltzer and D. Michie (Eds.). Edinburgh University Press, Edinburgh, Scotland, pages 101–116, 1972. [56] E. Bresson, Y. Lakhnech, L. Mazaré, and B. Warinschi. A generalization of ddh with applications to protocol analysis and computational soundness. In Alfred Menezes, editor, CRYPTO, volume 4622 of Lecture Notes in Computer Science, pages 482–499. Springer, 2007. [57] M. Burrows, M. Abadi, and R. M. Needham. A logic of authentication. ACM Trans. Comput. Syst., 8(1):18–36, 1990. [58] S. Bursuc, H. Comon-Lundh, and S. Delaune. Associative-commutative deducibility constraints. In W. Thomas and P. Weil, editors, STACS, volume 4393 of Lecture Notes in Computer Science, pages 634–645. Springer, 2007. [59] R. Canetti and H. Krawczyk. Analysis of key-exchange protocols and their use for building secure channels. In B. Pfitzmann, editor, EURO- CRYPT, volume 2045 of Lecture Notes in Computer Science, pages 453–474. Springer, 2001.
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: 154 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 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?