Logical Analysis and Verification of Cryptographic Protocols - Loria

More documents

Recommendations

Info

206 BIBLIOGRAPHY [60] U. Hustadt Ch. G. Fermüller, A. Leitsch and T. Tammet. Resolution decision procedures. In Handbook of Automated Reasoning, pages 1791–1849. 2001. [61] D. Chaum. Blind signatures for untraceable payments. In CRYPTO, pages 199–203, 1982. [62] D. Chaum. Elections with unconditionally-secret ballots and disruption equivalent to breaking rsa. In EUROCRYPT, pages 177–182, 1988. [63] D. Chaum. Secret-ballot receipts: True voter-verifiable elections. IEEE Security & Privacy, 2(1):38–47, 2004. [64] D. Chaum, C. Crépeau, and I. Damg˚ard. Multiparty unconditionally secure protocols (extended abstract). In STOC, pages 11–19. ACM, 1988. [65] D. Chaum, P. Y. A. Ryan, and S. A. Schneider. A practical voter-verifiable election scheme. In S. De Capitani di Vimercati, P. F. Syverson, and D. Gollmann, editors, ESORICS, volume 3679 of Lecture Notes in Computer Science, pages 118–139. Springer, 2005. [66] Y. Chevalier and M. Kourjieh. Key substitution in the symbolic analysis of cryptographic protocols. In V. Arvind and S. Prasad, editors, FSTTCS, volume 4855 of Lecture Notes in Computer Science, pages 121–132. Springer, 2007. [67] Y. Chevalier and M. Kourjieh. A symbolic intruder model for hashcollision attacks. In M. Okada and I. Satoh editors, ASIAN, volume 4435 of Lecture Notes in Computer Science, pages 13–27, Springer, 2006. [68] Y. Chevalier, R. Küsters, M. Rusinowitch, and M. Turuani. Deciding the security of protocols with diffie-hellman exponentiation and products in exponents. In Pandya and Radhakrishnan [166], pages 124–135. [69] Y. Chevalier, R. Küsters, M. Rusinowitch, and M. Turuani. Deciding the security of protocols with commuting public key encryption. Electr. Notes Theor. Comput. Sci., 125(1):55–66, 2005. [70] Y. Chevalier, R. Küsters, M. Rusinowitch, and M. Turuani. An np decision procedure for protocol insecurity with xor. Theor. Comput. Sci., 338(1- 3):247–274, 2005. [71] Y. Chevalier, R. Küsters, M. Rusinowitch, M. Turuani, and L. Vigneron. Extending the dolev-yao intruder for analyzing an unbounded number of sessions. In M. Baaz and J. A. Makowsky, editors, CSL, volume 2803 of Lecture Notes in Computer Science, pages 128–141. Springer, 2003.
BIBLIOGRAPHY 207 [72] Y. Chevalier, D. Lugiez, and M. Rusinowitch. Towards an automatic analysis of web service security. In B. Konev and F. Wolter, editors, FroCos, volume 4720 of Lecture Notes in Computer Science, pages 133–147. Springer, 2007. [73] Y. Chevalier and M. Rusinowitch. Combining intruder theories. In L. Caires and G. F. Italiano and L. Monteiro and C. Palamidessi and M. Yung editors, ICALP, volume 3580 of Lecture Notes in Computer Science, pages 639– 651, 2005. [74] Y. Chevalier and M. Rusinowitch. Hierarchical combination of intruder theories. In F. Pfenning, editor, RTA, volume 4098 of Lecture Notes in Computer Science, pages 108–122. Springer, 2006. [75] Y. Chevalier and L. Vigneron. A tool for lazy verification of security protocols. In ASE, pages 373–376. IEEE Computer Society, 2001. [76] B. Chevallier-Mames, P.A. Fouque, D. Pointcheval, J. Stern, and J. Traore. On Some Incompatible Properties of Voting Schemes. In WOTE’06: Proceedings of the International Association for Voting Systems Sciences Workshop on Trustworthy Elections, 2006. [77] T. Chothia, S. Orzan, J. Pang, and M. Torabi Dashti. A framework for automatically checking anonymity with mu crl. In U. Montanari, D. Sannella, and R. Bruni, editors, TGC, volume 4661 of Lecture Notes in Computer Science, pages 301–318. Springer, 2006. [78] J. Clark and J. Jacob. A survey of authentication protocol literature. November 1997. [79] E. M. Clarke, S. Jha, and W. R. Marrero. Verifying security protocols with brutus. ACM Trans. Softw. Eng. Methodol., 9(4):443–487, 2000. [80] H. Comon-Lundh. Intruder theories (ongoing work). In I. Walukiewicz, editor, FoSSaCS, volume 2987 of Lecture Notes in Computer Science, pages 1–4. Springer, 2004. [81] H. comon Lundh and V. Cortier. Tree automata with one memory, set constraints and cryptographic protocols. Research Report, LSV-01-13, Laboratoire Spécification et Vérification, ENS de Cachan, France, 2001. [82] H. Comon-Lundh and V. Cortier. Security properties: Two agents are sufficient. In P. Degano, editor, ESOP, volume 2618 of Lecture Notes in Computer Science, pages 99–113. Springer, 2003.
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: 156 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 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?