Symbolic analysis of crypto-protocols based on modular exponentiation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2747, Issue , 2003, Pages 269-278

  Boreale, Michele ^a   Buscemi, Maria Grazia ^b  

^a UNIVERSITY OF FLORENCE   (Italy)

^b UNIVERSITY OF PISA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; NETWORK SECURITY; SEMANTICS;

ANALYSIS OF PROTOCOLS; CRYPTOGRAPHIC ALGORITHMS; CRYPTOGRAPHIC PRIMITIVES; DIFFIE-HELLMAN KEY EXCHANGE; MODULAR EXPONENTIATION; PROTOCOL DESCRIPTION; SYMBOLIC TECHNIQUES; VERIFICATION METHOD;

CRYPTOGRAPHY;

EID: 35248897641     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45138-9_21     Document Type: Article

References (16)

1. M. Abadi, C. Fournet. Mobile Values, New Names, and Secure Communication. In Conf. Rec. of POPL'01, 2001.
2. R.M. Amadio, S. Lugiez. On the reachability problem in cryptographic protocols. In Proc. of Concur'00, LNCS 1877, Springer-Verlag, 2000. Full version: RR 3915, INRIA Sophia Antipolis.
3. M. Boreale. Symbolic Trace Analysis of Cryptographic Protocols. In Proc. of ICALP'01, LNCS 2076, Springer-Verlag, 2001.
4. M. Boreale, M. Buscemi. Experimenting with STA, a Tool for Automatic Analysis of Security Protocols. In Proc. of SAC'02, ACM Press, 2002.
5. M. Boreale and M. Buscemi. A Framework for the Analysis of Security Protocol. In Proc. of CONCUR '02, LNCS 2421. Springer-Verlag, 2002.
6. M. Boreale and M. Buscemi. On the Symbolic Analysis of Low-Level Cryptographic Primitives: Modular Exponentiation and the Diffie-Hellman Protocol. To appear in Proc. of FCS'03, ENTS Series. Elsevier Science, 2003.
7. Y. Chevalier, R. Kuesters, M. Rusinowitch, and M. Turuani. An NP Decision Procedure for Protocol Insecurity with Xor. In Proc. of LICS '03, IEEE Computer Society Press, 2003.
8. H. Comon, V. Cortier, J. Mitchell. Tree automata with one memory, set constraints and ping-pong protocols. In Proc. of ICALP'01, LNCS 2076, Springer-Verlag, 2001.
9. H. Comon-Lundh and V. Shmatikov. Intruder Deductions, Constraint Solving and Insecurity Decision in Presence of Exclusive or. In Proc. LICS '03, IEEE Computer Society Press, 2003.
10. W. Diffie, M. Hellman. New Directions in Cryptography. IEEE Transactions on Information Theory, 22(6):644-654, 1976.
11. D. Dolev, A. Yao. On the security of public-key protocols. IEEE Transactions on Information Theory, 29(2):198-208, 1983.
12. D. Kapur, P. Narendran, and L. Wang. An E-unification Algorithm for Analyzing Protocols that Use Modular Exponentiation. In Proc. of RTA '03, LNCS 2706, Springer-Verlag, 2003.
13. G. Lowe. Breaking and Fixing the Needham-Schroeder Public-Key Protocol Using FDR. In Proc. of TACAS'96, LNCS 1055, Springer-Verlag, 1996.
14. J. Millen, V. Shmatikov. Constraint solving for bounded-process cryptographic protocol analysis. In Proc. of 8th ACM Conference on Computer and Communication Security, ACM Press, 2001.
15. J. Millen and V. Shmatikov. Symbolic Protocol Analysis with Products and Diffie-Hellman Exponentiation. In Proc. of 16th IEEE Computer Security Foundations Workshop, IEEE Computer Society Press, 2003.
16. V. Vanackère. The TRUST Protocol Analyser, Automatic and Efficient Verification of Cryptographic Protocols. In Proc. of Verify '02, 2002.