Trace equivalence decision: Negative tests and non-determinism

Proceedings of the ACM Conference on Computer and Communications Security

Volumn , Issue , 2011, Pages 321-330

  Cheval, Vincent ^a   Hubert, Comon Lundh ^a   Delaune, Stéphanie ^a  

^a CNRS   (France)

Author keywords

Security; Verification

Indexed keywords

APPLIED PI CALCULUS; CONSTRAINT SYSTEMS; CRYPTOGRAPHIC PRIMITIVES; CRYPTOGRAPHIC PROTOCOLS; GENERAL CLASS; NON-DETERMINISM; PRIVATE CHANNELS; SECURITY; SECURITY PROPERTIES; SYMBOLIC EQUIVALENCES; SYMBOLIC SEMANTICS; TRACE EQUIVALENCE; UNLINKABILITY;

CALCULATIONS; COMPUTABILITY AND DECIDABILITY; CRYPTOGRAPHY; SECURITY OF DATA; SEMANTICS;

EQUIVALENCE CLASSES;

EID: 80755168342     PISSN: 15437221     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2046707.2046744     Document Type: Conference Paper

References (25)

1. M. Abadi and V. Cortier. Deciding knowledge in security protocols under equational theories. Theoretical Computer Science, 387(1-2):2-32, 2006. (Pubitemid 44649345)
2. M. Abadi and C. Fournet. Mobile values, new names, and secure communication. In Proc. 28th Symposium on Principles of Programming Languages (POPL'01), pages 104-115. ACM Press, 2001.
3. M. Abadi and C. Fournet. Private authentication. Theoretical Computer Science, 322(3):427-476, 2004.
4. M. Abadi and A. Gordon. A calculus for cryptographic protocols: The spi calculus. In Proc. 4th Conference on Computer and Communications Security (CCS'97), pages 36-47. ACM Press, 1997.
5. M. Arapinis, T. Chothia, E. Ritter, and M. Ryan. Analysing unlinkability and anonymity using the applied pi calculus. In Proc. of 23rd IEEE Computer Security Foundations Symposium (CSF'10), pages 107-121. IEEE Computer Society Press, 2010.
6. A. Armando et al. The AVISPA Tool for the automated validation of internet security protocols and applications. In Proc. 17th Int. Conference on Computer Aided Verification (CAV'05), volume 3576 of LNCS, pages 281-285. Springer, 2005. (Pubitemid 41431740)
7. M. Baudet. Deciding security of protocols against off-line guessing attacks. In Proc. 12th Conference on Computer and Communications Security (CCS'05), pages 16-25. ACM Press, 2005. (Pubitemid 44021986)
8. M. Baudet. Sécurité des protocoles cryptographiques: aspects logiques et calculatoires. Phd thesis, École Normale Supérieure de Cachan, France, 2007.
9. B. Blanchet. An Efficient Cryptographic Protocol Verifier Based on Prolog Rules. In Proc. 14th Computer Security Foundations Workshop (CSFW'01), pages 82-96. IEEE Comp. Soc. Press, 2001. (Pubitemid 32877779)
10. B. Blanchet, M. Abadi, and C. Fournet. Automated verification of selected equivalences for security protocols. Journal of Logic and Algebraic Programming, 75(1):3-51, 2008. (Pubitemid 351172997)
11. V. Cheval, H. Comon-Lundh, and S. Delaune. Automating security analysis: symbolic equivalence of constraint systems. In Proc. 5th International Joint Conference on Automated Reasoning (IJCAR'10), volume 6173 of LNAI, pages 412-426. Springer-Verlag, 2010.
12. Y. Chevalier and M. Rusinowitch. Decidability of symbolic equivalence of derivations. Journal of Automated Reasoning, 2011. To appear.
13. H. Comon-Lundh and S. Delaune. The finite variant property: How to get rid of some algebraic properties. In Proc. 16th International Conference on Rewriting Techniques and Applications (RTA'05), LNCS, pages 294-307. Springer, 2005. (Pubitemid 41313364)
14. V. Cortier and S. Delaune. A method for proving observational equivalence. In Proc. 22nd Computer Security Foundations Symposium (CSF'09), pages 266-276. IEEE Comp. Soc. Press, 2009.
15. 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), pages 133-145, 2007.
16. S. Delaune, S. Kremer, and M. D. Ryan. Verifying privacy-type properties of electronic voting protocols. Journal of Computer Security, 17(4):435-487, July 2009.
17. D. Dolev and A. C. Yao. On the security of public key protocols. In Proc. 22nd Symposium on Foundations of Computer Science (FCS'81), pages 350-357. IEEE Computer Society Press, 1981.
18. L. Durante, R. Sisto, and A. Valenzano. Automatic testing equivalence verification of spi calculus specifications. ACM Transactions on Software Engineering and Methodology, 12(2):222-284, 2003. (Pubitemid 44159309)
19. N. Durgin, P. Lincoln, J. Mitchell, and A. Scedrov. Undecidability of bounded security protocols. In Workshop on Formal Methods and Security Protocols, 1999.
20. H. Hüttel. Deciding framed bisimulation. In Proc. 4th Int. Workshop on Verification of Infinite State Systems (INFINITY'02), pages 1-20, 2002.
21. J. Millen and V. Shmatikov. Constraint solving for bounded-process cryptographic protocol analysis. In Proc. 8th ACM Conference on Computer and Communications Security (CCS'01). ACM Press, 2001.
22. S. Mödersheim, L. Viganò, and D. A. Basin. Constraint differentiation: Search-space reduction for the constraint-based analysis of security protocols. Journal of Computer Security, 18(4):575-618, 2010.
23. R. Ramanujam and S. Suresh. Tagging makes secrecy decidable for unbounded nonces as well. In Proc. 23rd Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'03), 2003.
24. M. Rusinowitch and M. Turuani. Protocol insecurity with finite number of sessions is NP-complete. In Proc. 14th Computer Security Foundations Workshop (CSFW'01), pages 174-190. IEEE Comp. Soc. Press, 2001.
25. A. Tiu and J. E. Dawson. Automating open bisimulation checking for the spi calculus. In Proc. 23rd IEEE Computer Security Foundations Symposium (CSF'10), pages 307-321. IEEE Computer Society Press, 2010.