Computing knowledge in security protocols under convergent equational theories

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

Volumn 5663 LNAI, Issue , 2009, Pages 355-370

  Ciobâcǎ, Ştefan ^a   Delaune, Stéphanie ^a   Kremer, Steve ^a  

^a CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

DECISION PROBLEMS; ELECTRONIC VOTING PROTOCOLS; EQUATIONAL THEORY; INDISTINGUISHABILITY; PROTOTYPE IMPLEMENTATIONS; SECURITY PROTOCOLS; SYMBOLIC ANALYSIS;

AUTOMATION; COMPUTABILITY AND DECIDABILITY; NETWORK SECURITY; SOFTWARE PROTOTYPING; VOTING MACHINES;

NETWORK PROTOCOLS;

EID: 69949148046     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-02959-2_27     Document Type: Conference Paper

References (20)

1. Abadi, M., Cortier, V.: Deciding knowledge in security protocols under equational theories. Theoretical Computer Science 387(1-2), 2-32 (2006)
2. Abadi, M., Fournet, C.: Mobile values, new names, and secure communication. In: Proc. 28th ACM Symp. on Principles of Programming Languages (2001)
3. Anantharaman, S., Narendran, P., Rusinowitch, M.: Intruders with caps. In: Baader, F. (ed.) RTA 2007. LNCS, vol. 4533, pp. 20-35. Springer, Heidelberg (2007)
4. Armando, A., et al.: The AVISPA Tool for the automated validation of internet security protocols and applications. In: Etessami, K., Rajamani, S.K. (eds.) CAV 2005. LNCS, vol. 3576, pp. 281-285. Springer, Heidelberg (2005)
5. Backes, M., Hritcu, C., Maffei, M.: Automated verification of remote electronic voting protocols in the applied pi-calculus. In: Proc. 21st IEEE Computer Security Foundations Symposium (CSF 2008) (2008)
6. Backes, M., Maffei, M., Unruh, D.: Zero-knowledge in the applied pi-calculus and automated verification of the direct anonymous attestation protocol. In: IEEE Symposium on Security and Privacy (S&P 2008). IEEE Comp. Soc. Press, Los Alamitos (2008)
7. Baudet, M.: Deciding security of protocols against off-line guessing attacks. In: 12th ACM Conference on Computer and Communications Security (CCS 2005) (2005)
8. Baudet, M.: YAPA (Yet Another Protocol Analyzer) (2008), http://www.lsv.ens-cachan.fr/̃baudet/yapa/index.html
9. Baudet, M., Cortier, V., Delaune, S.: YAPA: A generic tool for computing intruder knowledge. In: Treinen, R. (ed.) Proceedings of the 20th International Conference on Rewriting Techniques and Applications (RTA 2009), Brasiĺia, Brazil, June-July 2009. LNCS. Springer, Heidelberg (to appear, 2009)
10. Chevalier, Y.: Résolution de problèmes d'accessibilité pour la compilation et la validation de protocoles cryptographiques. PhD thesis, Univ. Henri Poincaré (2003)
11. Ciobǎcǎ, Ş.: KiSs (2009), http://www.lsv.ens-cachan. fr/̃ciobaca/kiss
12. Ciobǎcǎ, Ş., Delaune, S., Kremer, S.: Computing knowledge in security protocol under convergent equational theories. Research Report LSV-09-05, Laboratoire Spécification et Vérification, ENS Cachan, France, March 2009, 42 p. (2009)
13. Corin, R., Doumen, J., Etalle, S.: Analysing password protocol security against offline dictionary attacks. In: Proc. 2nd International Workshop on Security Issues with Petri Nets and other Computational Models (WISP 2004). ENTCS (2004)
14. Cortier, V., Delaune, S.: Deciding knowledge in security protocols for monoidal equational theories. In: Dershowitz, N., Voronkov, A. (eds.) LPAR 2007. LNCS (LNAI), vol. 4790, pp. 196-210. Springer, Heidelberg (2007)
15. Cortier, V., Delaune, S., Lafourcade, P.: A survey of algebraic properties used in cryptographic protocols. Journal of Computer Security 14(1), 1-43 (2006)
16. Delaune, S., Kremer, S., Ryan, M.D.: Verifying privacy-type properties of electronic voting protocols. Journal of Computer Security (to appear, 2008)
17. Lafourcade, P., Lugiez, D., Treinen, R.: Intruder deduction for the equational theory of Abelian groups with distributive encryption. Information and Computation 205(4), 581-623 (2007)
18. Millen, J., Shmatikov, V.: Constraint solving for bounded-process cryptographic protocol analysis. In: Proc. 8th ACM Conference on Computer and Communications Security (CCS 2001) (2001)
19. Okamoto, T.: Receipt-free electronic voting schemes for large scale elections. In: Christianson, B., Lomas, M. (eds.) Security Protocols 1997. LNCS, vol. 1361. Springer, Heidelberg (1998)
20. Rusinowitch, M., Turuani, M.: Protocol insecurity with finite number of sessions and composed keys is NP-complete. Theoretical Computer Science 299, 451-475 (2003)