Logical Analysis and Verification of Cryptographic Protocols - Loria

More documents

Recommendations

Info

212 BIBLIOGRAPHY [132] T. Kohno, A. Stubblefield, A. D. Rubin, and D. S. Wallach. Analysis of an electronic voting system. In IEEE Symposium on Security and Privacy, pages 27–, 2004. [133] R. A. Kowalski. Predicate logic as programming language. In IFIP Congress, pages 569–574, 1974. [134] R. A. Kowalski and D. Kuehner. Linear resolution with selection function. Artif. Intell., 2(3/4):227–260, 1971. [135] S. Kremer and J.F. Raskin. Game analysis of abuse-free contract signing. In CSFW, pages 206–, 2002. [136] S. Kremer and M. Ryan. Analysis of an electronic voting protocol in the applied pi calculus. In S. Sagiv editor, ESOP, volume 3444 of Lecture Notes in Computer Science, pages 186–200, Springer, 2005. [137] D. G. Kuehner. Strategies for improving the efficiency of automatic theoremproving. Phd thesis, University of Edinburgh, United Kingdom, 1971. [138] K. O. Kürtz, R. Küsters, and T. Wilke. Selecting theories and nonce generation for recursive protocols. In P. Ning, V. Atluri, V. D. Gligor, and H. Mantel, editors, FMSE, pages 61–70. ACM, 2007. [139] L. Lamport. Constructing digital signatures from a one-way functions. Technical Report, CSL-98, SRI International, October 1979. [140] D. Lankford. Canonical algebraic simplification in computational logic. Technical Report ATP-25 , Department of Mathematics, University of Texas, Austin, 1975. [141] B. Lee, C. Boyd, K. Kim, J. Yang, and S. Yoo. Providing receipt-freeness in mixnet-based voting protocols. In ICISC’03: Proceedings of the 6th International Conference on Information Security and Cryptology, volume 2791 of LNCS, pages 245–258. Springer, 2004. [142] P. Lincoln, J. C. Mitchell, M. Mitchell, and A. Scedrov. A probabilistic polytime framework for protocol analysis. In ACM Conference on Computer and Communications Security, pages 112–121, 1998. [143] D. W. Loveland. A simplified format for the model elimination theoremproving procedure. J. ACM, 16(3):349–363, 1969. [144] G. Lowe. An attack on the needham-schroeder public key authentication protocol. Information processing letters, 1995. [145] G. Lowe. Breaking and fixing the needham-schroeder public-key protocol using fdr. Software - Concepts and Tools, 17(3):93–102, 1996.
BIBLIOGRAPHY 213 [146] Ch. Lynch. Schematic saturation for decision and unification problems. In F. Baader, editor, CADE, volume 2741 of Lecture Notes in Computer Science, pages 427–441. Springer, 2003. [147] A. Martelli and U. Montanari. An efficient unification algorithm. ACM Trans. Program. Lang. Syst., 4(2):258–282, 1982. [148] A. Martelli and V. Montanari. Unification in linear time and space: A structured presentation. Internal Rep. B76-16, Ist. di Elaborazione delle Informazione, Consiglio Nazionale delle Ricerche, Pisa, Italy, July 1976. [149] S. Mauw, J. Verschuren, and E. P. de Vink. Data anonymity in the foo voting scheme. Electr. Notes Theor. Comput. Sci., 168:5–28, 2007. [150] D. A. McAllester. Automatic recognition of tractability in inference relations. J. ACM, 40(2):284–303, 1993. [151] C. Meadows. The nrl protocol analyzer: An overview. J. Log. Program., 26(2):113–131, 1996. [152] A. Menezes and N. P. Smart. Security of signature schemes in a multi-user setting. Des. Codes Cryptography, 33(3):261–274, 2004. [153] A. J. Menezes, P. C. Van Oorschot, and S. A. Vanstone. Handbook of applied cryptography, CRC press. 1996. [154] R. C. Merkle. Secure communications over insecure channels. Commun. ACM, 21(4):294–299, 1978. [155] D. Micciancio and B. Warinschi. Soundness of formal encryption in the presence of active adversaries. In Moni Naor, editor, TCC, volume 2951 of Lecture Notes in Computer Science, pages 133–151. Springer, 2004. [156] J. K. Millen and V. Shmatikov. Constraint solving for bounded-process cryptographic protocol analysis. In ACM Conference on Computer and Communications Security, pages 166–175, 2001. [157] J. K. Millen and V. Shmatikov. Symbolic protocol analysis with an abelian group operator or diffie-hellman exponentiation. Journal of Computer Security, 13(3):515–564, 2005. [158] R. Milner. Communication and concurrency. International Series in Computer Science, Prentice Hall, 1989. [159] R. Milner. Communicating and mobile systems: the π-calculus. Cambridge University Press, 1999.
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:
Page 172 and 173:
Page 174 and 175: 162 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 220 and 221: 208 BIBLIOGRAPHY [83] H. Comon-Lund
Page 222 and 223: 210 BIBLIOGRAPHY [108] B. Donovan,
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?