Symbolic semantics and analysis for crypto-CCS with (Almost) generic inference systems

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

Volumn 2420, Issue , 2002, Pages 519-531

  Martinelli, Fabio ^a  

^a Istituto di informatica e telematica del Consiglio nazionale delle ricerche   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; SEMANTICS;

CRYPTOGRAPHIC FUNCTIONS; CRYPTOGRAPHIC PROTOCOLS; DISTRIBUTED PROTOCOLS; FORMAL DESCRIPTION LANGUAGE; OPERATIONAL SEMANTICS; SECURITY PROPERTIES; SYMBOLIC SEMANTICS; SYMBOLIC VERIFICATION;

CRYPTOGRAPHY;

EID: 84956982499     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45687-2_43     Document Type: Conference Paper

References (17)

1. [1] M. Abadi and A. D. Gordon. A calculus for cryptographic protocols: The spi calculus. Information and Computation, 148(1):1–70, 1999.
2. [2] R. M. Amadio and D. Lugiez. On the reachability problem in cryptographic protocols. In Proc. of CONCUR, volume 1877 of LNCS, pages 380–394, 2000.
3. [3] B. Blanchet. An efficient cryptographic protocol verifier based on prolog rules. In Proc. of CSFW, IEEE Press, pages 82–96, 2001.
4. [4] M. Boreale. Symbolic trace analysis of cryptographic protocols. In Proc. of ICALP, LNCS, pages 667–681, 2001.
5. [5] M. Fiore and M. Abadi. Computing symbolic models for verifying cryptographic protocols. In Proc. of CSFW, IEEE Press, pages 160–173, 2001.
6. [6] R. Focardi and F. Martinelli. A uniform approach for the definition of security properties. In Proc. of FM’99, volume 1708 of LNCS, pages 794–813, 1999.
7. [7] A. Ingólfsdttir, and H. Lin. A symbolic approach to value-passing processes. In J. Bergstra, A. Ponse, and S. Smolka, editors, Handbook of Process Algebra, pages 427–478. North-Holland, 2001.
8. [8] D. Kindred and J. M. Wing. Fast, automatic checking of security protocols. In Proc. of Second USENIX Workshop on Electronic Commerce, pages 41–52, Oakland, California, 1996.
9. [9] G. Leduc and F. Germeau. Verification of security protocols using LOTOS - method and application. Computer Communications, 23(12):1089–1103, 2000.
10. [10] G. Lowe. Breaking and fixing the Needham Schroeder public-key protocol using FDR. In Proc. of TACAS, volume 1055 of LNCS, pages 147–166, 1996.
11. [11] F. Martinelli. Analysis of security protocols as open systems. Tech. Rep. IATB4- 2001-06. To appear on TCS.
12. [12] F. Martinelli. Encoding several authentication properties as properties of the intruder’s knowledge. Tech. Rep. IAT-B4-2001-20. Submitted for publication.
13. [13] F. Martinelli. Formal Methods for the Analysis of Open Systems with Applications to Security Properties. PhD thesis, University of Siena, Dec. 1998.
14. [14] F. Martinelli. Languages for description and analysis of authentication protocols. In Proc. of ICTCS, pages 304–315. World Scientific, 1998.
15. [15] J. Millen and V. Shmatikov. Constraint solving for bounded-process cryptographic protocol analysis. In Proc. of CCS, ACM Press, 2001.
16. [16] R. Milner. Communication and Concurrency. International Series in Computer Science. Prentice Hall, 1989.
17. [17] Thayer, Herzog, and Guttman D. Honest ideals on strand spaces. In Proc. of CSFW. IEEE Computer Society Press, 1998.