Symbolic bisimulation for the applied pi calculus

Journal of Computer Security

Volumn 18, Issue 2, 2010, Pages 317-377

  Delaune, Stéphanie ^a   Kremer, Steve ^a   Ryan, Mark D ^b  

^a CNRS   (France)

^b UNIVERSITY OF BIRMINGHAM   (United Kingdom)

Author keywords

Applied pi calculus; Observational equivalence; Security protocols

Indexed keywords

APPLIED PI CALCULUS; BISIMULATION RELATIONS; BISIMULATIONS; CRYPTOGRAPHIC PROTOCOLS; OBSERVATIONAL EQUIVALENCES; PI CALCULUS; SECRECY PROPERTIES; SECURITY PROTOCOLS; SYMBOLIC BISIMULATION; SYMBOLIC SEMANTICS;

CALCULATIONS; CRYPTOGRAPHY; NETWORK PROTOCOLS; SEMANTICS;

NETWORK SECURITY;

EID: 77950191447     PISSN: 0926227X     EISSN: None     Source Type: Journal    
DOI: 10.3233/JCS-2010-0363     Document Type: Article

References (21)

1. M. Abadi and V. Cortier, Deciding knowledge in security protocols under equational theories, Theoretical Computer Science 387(1,2) (2006), 2-32.
2. M. Abadi and C. Fournet, Mobile values, new names, and secure communication, in: Proc. 28th Symposium on Principles of Programming Languages, ACM Press, 2001, pp. 104-115.
3. M. Abadi and A.D. Gordon, A calculus for cryptographic protocols: The spi calculus, in: Proc. 4th Conference on Computer and Communications Security, ACM Press, 1997, pp. 36-47.
4. R. Amadio, D. Lugiez and V. Vanackère, On the symbolic reduction of processes with cryptographic functions, Theoretical Computer Science 290 (2002), 695-740.
5. M. Baudet, Deciding security of protocols against off-line guessing attacks, in: Proc. 12th Conference on Computer and Communications Security, ACM Press, 2005, pp. 16-25.
6. M. Baudet, Sécurité des protocoles cryptographiques: Aspects logiques et calculatoires, Thèse de doctorat, LSV, ENS Cachan, France, January 2007.
7. B. Blanchet, An efficient cryptographic protocol verifier based on prolog rules, in: Proc. 14th Computer Security Foundations Workshop, IEEE Comp. Soc. Press, 2001, pp. 82-96.
8. B. Blanchet, M. Abadi and C. Fournet, Automated verification of selected equivalences for security protocols, in: Proc. 20th Symposium on Logic in Computer Science, IEEE Comp. Soc. Press, 2005, pp. 331-340.
9. M. Boreale and R.D. Nicola, A symbolic semantics for the pi-calculus, Information and Computation 126 (1996), 34-52.
10. J. Borgström, S. Briais and U. Nestmann, Symbolic bisimulation in the spi calculus, in: Proc. 15th Int. Conference on Concurrency Theory, Lecture Notes in Computer Science, Vol.3170, Springer, 2004, pp. 161-176.
11. S. Delaune and F. Jacquemard, A decision procedure for the verification of security protocols with explicit destructors, in: Proc. 11th ACM Conference on Computer and Communications Security (CCS'04), ACM Press, 2004, pp. 278-287.
12. S. Delaune, S. Kremer and M.D. Ryan, Coercion-resistance and receipt-freeness in electronic voting, in: Proc. 19th Computer Security Foundations Workshop, IEEE Comp. Soc. Press, 2006, pp. 28-39.
13. S. Delaune, S. Kremer and M.D. Ryan, Symbolic bisimulation for the applied pi calculus, in: Preliminary Proc. 5th International Workshop on Security Issues in Concurrency (SecCo'07), 2007.
14. S. Delaune, S. Kremer and M.D. Ryan, Symbolic bisimulation for the applied pi-calculus, in: Proc. 27th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'07), Lecture Notes in Computer Science, Vol.4855, Springer, 2007, pp. 133-145.
15. S. Delaune, S. Kremer and M.D. Ryan, Symbolic bisimulation for the applied pi calculus, Research Report LSV-08-32, Laboratoire Spécification et Vérification, ENS Cachan, France, 2008, 73 pp.
16. D. Dolev and A.C. Yao, On the security of public key protocols, IEEE Transactions on Information Theory 29(12) (1983), 198-208.
17. A. Fujioka, T. Okamoto and K. Ohta, A practical secret voting scheme for large scale elections, in: Advances in Cryptology - AUSCRYPT '92, Lecture Notes in Computer Science, Vol.718, Springer, 1992, pp. 244-251.
18. M. Hennessy and H. Lin, Symbolic bisimulations, Theoretical Computer Science 138(2) (1995), 353-389.
19. S. Kremer and M.D. Ryan, Analysis of an electronic voting protocol in the applied pi-calculus, in: Proc. 14th European Symposium on Programming, Lecture Notes in Computer Science, Vol.3444, Springer, 2005, pp. 186-200.
20. J.K. Millen and V. Shmatikov, Constraint solving for bounded-process cryptographic protocol analysis, in: Proc. 8th Conference on Computer and Communications Security, 2001, pp. 166-175.
21. R. Milner, J. Parrow and D. Walker, A calculus of mobile processes, part I, Information and Computation 100(1) (1992), 1-40.