Deciding knowledge in security protocols under (many more) equational theories

Proceedings of the Computer Security Foundations Workshop

Volumn , Issue , 2005, Pages 62-76

  Abadi, Martín ^a   Cortier, Véronique ^b  

^a University of California Santa Cruz   (United States)

^b LORIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY; ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS; NETWORK PROTOCOLS; THEOREM PROVING;

ASSOCIATIVE-COMMUTATIVE FUNCTION; HOMOMORPHIC PROTOCOLS; SECURITY PROTOCOLS;

SECURITY OF DATA;

EID: 28144451656     PISSN: 10636900     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (20)

1. M. Abadi and V. Cortier. Deciding knowledge in security protocols under equational theories. In Proc. 31st Int. Coll. Automata, Languages, and Programming (ICALP 2004), volume 3142 of LNCS, pages 46-58, Turku, Finland, July 2004. Springer.
2. M. Abadi and C. Fournet. Mobile values, new names, and secure communication. In Proceedings of the 28th ACM Symposium on Principles of Programming Languages (POPL'01), pages 104-115, January 2001.
3. M. Abadi and A. D. Gordon. A calculus for cryptographic protocols: The spi calculus. Information and Computation, 148(1): 1-70, Jan. 1999.
4. M. Abadi and P. Rogaway. Reconciling two views of cryptography (The computational soundness of formal encryption). Journal of Cryptology, 15(2): 103-127, 2002.
5. M. Baudet. Private communication. 2005.
6. Y. Chevalier, R. Kuester, M. Rusinowitch, and M. Turani. An NP decision procedure for protocol insecurity with xor. In Proceedings of the 18th Annual IEEE Symposium on Logic In Computer Science (LICS'03), pages 261-270, 2003.
7. H. Comon-Lundh. Intruder theories (ongoing work). In Foundations of Software Science and Computation Structures (FoSSaCS'04), volume 2987 of LNCS, pages 1-4. Springer, 2004.
8. H. Comon-Lundh and V. Shmatikov. Intruder deductions, constraint solving and insecurity decision in presence of exclusive or. In Proceedings of the 18th Annual IEEE Symposium on Logic In Computer Science (LICS'03), pages 271-280, 2003.
9. H. Comon-Lundh and R. Treinen. Easy intruder deductions. Technical Report LSV-03-8, Laboratoire Spécification et Vérification, ENS de Cachan, France, 2003.
10. S. Delaune and F. Jacquemard. A decision procedure for the verification of security protocols with explicit destructors. In Proceedings of the 11th ACM Conference on Computer and Communications Security (CCS'04), pages 278-287, Washington, D.C., USA, October 2004. ACM Press.
11. S. Goldwasser and S. Micali. Probabilistic encryption. Journal of Computer and System Sciences, 28:270-299, Apr. 1984.
12. R. Kemmerer, C. Meadows, and J. Millen. Three systems for cryptographic protocol analysis. Journal of Cryptology, 7(2):79-130, Spring 1994.
13. S. Kremer and M. D. Ryan. Analysis of an electronic voting protocol in the applied pi-calculus. In M. Sagiv, editor, Programming Languages and Systems -Proceedings of the 14th European Symposium on Programming (ESOP'05), volume 3444 of LNCS, pages 186-200, Edinburgh, U.K., April 2005. Springer.
14. P. Lafourcade, D. Lugiez, and R. Treinen. Intruder deduction for ac-like equational theories with homomorphisms. In Proceedings of the 16th International Conference on Rewriting Techniques and Applications (RTA'05), volume 3467 of LNCS, pages 308-322, Nara, Japan, April 2005. Springer.
15. P. Lincoln, J. Mitchell, M. Mitchell, and A. Scedrov. A probabilistic poly-time framework for protocol analysis. In Proceedings of the Fifth ACM Conference on Computer and Communications Security, pages 112-121, 1998.
16. G. Lowe. Breaking and fixing the Needham-Schroeder public-key protocol using FDR. In Tools and Algorithms for the Construction and Analysis of Systems, volume 1055 of LNCS, pages 147-166. Springer, 1996.
17. L. C. Paulson. The inductive approach to verifying cryptographic protocols. Journal of Computer Security, 6(1-2):85-128, 1998.
18. R. L. Rivest, L. Adleman, and M. L. Dertouzos. On data banks and privacy homomorphisms. In R. DeMillo, D. Dobkin, A. Jones, and R. Lipton, editors, Foundations of Secure Computation, pages 169-180. Academic Press, 1978.
19. P. Samuel. Algebraic Theory of Numbers. Hermann, 1970.
20. S. Schneider. Security properties and CSP. In IEEE Symposium on Security and Privacy, pages 174-187, 1996.