A new knowledge representation strategy for cryptographic protocol analysis

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

Volumn 2619, Issue , 2003, Pages 284-298

  Cibrario B , Ivan ^a   Durante, Luca ^a   Sisto, Riccardo ^a   Valenzano, Adriano ^a  

^a POLITECNICO DI TORINO   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; COMPUTATIONAL LINGUISTICS; CRYPTOGRAPHY; KNOWLEDGE REPRESENTATION; MODEL CHECKING; NETWORK PROTOCOLS;

CRYPTOGRAPHIC PROTOCOLS; FORMAL VERIFICATION OF SECURITY; LANGUAGE ELEMENTS; PUBLIC NETWORKS; SPI CALCULUS; TERM LANGUAGES; TERM REPRESENTATION;

NETWORK SECURITY;

EID: 35248859741     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36577-x_21     Document Type: Article

References (17)

1. M. Abadi, and A. D. Gordon, "A Calculus for Cryptographic Protocols The Spi Calculus", Digital Research Report, vol. 149, January 1998, pp. 1-110.
2. R. Amadio, and D. Lugiez, "On the Reachability Problem in Cryptographic Protocols", Proc. of CONCUR'2000, LNCS 1877, pp. 380-394, Springer-Verlag, 2000.
3. M. Boreale, R. De Nicola, and R. Pugliese, "Proof Techniques for Cryptographic Processes", Proc. of the 14th IEEE Symposium Logic In Computer Science (LICS'99), IEEE Computer Society Press, pp. 157-166, 1999.
4. M. Boreale, "Symbolic Trace Analysis of Cryptographic Protocols", In Proc. 28th ICALP, Vol. 2076 of Lecture Notes in Computer Science, Springer-Verlag, pp. 667-681, 2001.
5. E. M. Clarke, S. Jha, and W. Marrero, "Using state space exploration and a natural deduction style message derivation engine to verify security protocols", Proc. of IFIP PROCOMET, Chapman & Hall, London, 1998, pp. p.87-106.
6. E. M. Clarke, S. Jha, and W. Marrero, "Verifying security protocols with Brutus", ACM Trans. on Software Engineering and Methodology Vol. 9, No. 4, October 2000, pp. 443-487.
7. D. Dolev, and A. Yao, "On the security of public key protocols", IEEE Transactions on Information Theory, 29(2):198-208, 1983.
8. L. Durante, R. Sisto, and A. Valenzano, "A state-exploration technique for spi-calculus testing equivalence verification", Proc. of FORTE/PSTV 2000, Pisa, October 2000, pp. 155-170.
9. L. Durante, R. Sisto, and A. Valenzano, "Automatic testing equivalence verification of spi-calculs specifications", Politecnico di Torino I.R. DAI/ARC 1-02.
10. M. Fiore, and M. Abadi, "Computing Symbolic Models for Verifying Cryptographic Protocols", Proc. of 14th IEEE Computer Security Foundations Workshop, pp. 160-173, June 2001.
11. A. Huima, "Efficient Infinite-State Analysis of Security Protocols", Proc. of FLOC Workshop on Formal Methods and Security Protocols, 1999.
12. G. Lowe, "Breaking and fixing the Needham-Schroeder public-key protocol using FDR", Proc. of TACAS'97, Springer LNCS 1055, 1996.
13. D. A. McAllester, "Automatic Recognition of Tractability in Inference Relations", Journal of the ACM, Vol. 40, No. 2, April 1993, pp. 284-303.
14. J. Millen, and V. Shmatikov, "Constraint solving for Bounded-Process Cryptographic Protocol Analysis", 8th ACM Conference on Computer and Communication Security, pages 166-175, November 2001.
15. R. Milner, J. Parrow, and D. Walker, "A Calculus of mobile processes, parts I and II", Information and Computation, pages 1-40 and 41-77, September 1992.
16. L. C. Paulson, "The inductive approach to verifying cryptographic protocols", Journal of Computer Security, Vol. 6, pp. 85-128, 1998.
17. D. Prawitz, "Natural Deduction: A Proof-Theoretical Study", Almqvist & Wiskell, 1965.