Symbolic protocol analysis in presence of a homomorphism operator and exclusive or

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

Volumn 4052 LNCS, Issue , 2006, Pages 132-143

  Delaune, Stéphanie ^a,b   Lafourcade, Pascal ^b,c   Lugiez, Denis ^c   Treinen, Ralf ^b  

^a France Télécom Division R and D   (France)

^b CNRS   (France)

^c AIX MARSEILLE UNIV   (France)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT THEORY; CRYPTOGRAPHY; POLYNOMIALS; PROBLEM SOLVING; SECURITY OF DATA;

HOMOMORPHISM OPERATOR; SYMBOLIC DEDUCIBILITY CONSTRAINTS; SYMBOLIC PROTOCOL ANALYSIS;

NETWORK PROTOCOLS;

EID: 33746409663     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11787006_12     Document Type: Conference Paper

References (17)

1. Y. Chevalier, R. Küsters, M. Rusinowitch, and M. Turuani. An NP decision procedure for protocol insecurity with XOR. In Proc. of 18th Annual IEEE Symposium on Logic in Computer Science (LICS'03), pages 261-270. IEEE Comp. Soc. Press, 2003.
2. Y. Chevalier and M. Rusinowitch. Combining intruder theories. In Proc. 32nd International Colloquium on Automata, Languages and Programming (ICALP '05), volume 3580 of LNCS, pages 639-651. Springer, 2005.
3. H. Comon-Lundh and V. Shmatikov. Intruder deductions, constraint solving and insecurity decision in presence of exclusive or. In Proc. of 18th Annual IEEE Symposium on Logic in Computer Science (LICS'03), pages 271-280. IEEE Comp. Soc. Press, 2003.
4. V. Cortier, S. Delaune, and P. Lafourcade. A survey of algebraic properties used in cryptographic protocols. Journal of Computer Security, 14(1):1-43, 2006.
5. R. Cramer, R. Gennaro, and B. Schoenmakers. A secure and optimally efficient multiauthority election scheme. In Proc. International Conference on the Theory and Application of Cryptographic Techniques, volume 1233 of LNCS, pages 103-118, 1997.
6. S. Delaune. Easy intruder deduction problems with homomorphisms. Information Processing Letters, 97(6):213-218, 2006.
7. S. Delaune. An undecidability result for AGh. Research Report LSV-06-02, LSV, ENS Cachan, France, 2006.
8. S. Delaune and F. Jacquemard. A decision procedure for the verification of security protocols with explicit destructors. In Proc. of 11th ACM Conference on Computer and Communications Security (CCS'04), pages 278-287. ACM Press, 2004.
9. S. Delaune, P. Lafourcade, D. Lugiez, and R. Treinen. Symbolic protocol analysis in presence of a homomorphism operator and exclusive or. Research Report LSV-05-20, Cachan, 2005.
10. D. Dolev and A, Yao. On the security of public key protocols. In Proc. of the 22nd Symp. on Foundations of Computer Science, pages 350-357, IEEE Comp. Soc. Press, 1981.
11. N. Durgin, P. Lincoln, J. Mitchell, and A. Scedrov. Undecidability of bounded security protocols. In Proc. Workshop on formal methods in security protocols, 1999.
12. Q. Guo, P. Narendran, and D. A. Wolfram. Complexity of nilpotent unification and matching problems. Information and Computation, 162(1-2):3-23, 2000,
13. P. Lafourcade, D. Lugiez, and R. Treinen. Intruder deduction for AC-like equational theories with homomorphisms. In Proc. of 16th Int. Conference on Rewriting Techniques and Applications (RTA '05), volume 3467 of LNCS, pages 308-322, Springer, 2005.
14. P. Lafourcade, D, Lugiez, and R. Treinen. Intruder deduction for the equational theory of exclusive-or with distributive encryption. Research Report LSV-05-19, ENS Cachan, 2005.
15. J. Millen and V. Shmatikov. Constraint solving for bounded-process cryptographic protocol analysis. In Proc. of 8th ACM Conference on Computer and Communications Security (CCS'01). ACM Press, 2001.
16. J. Millen and V. Shmatikov. Symbolic protocol analysis with an Abelian group operator or Diffie-Hellman exponentiation. Journal of Computer Security, 13(3):515-564, 2005.
17. M. Rusinowitch and M. Turuani. Protocol insecurity with a finite number of sessions, composed keys is NP-complete. Theoretical Computer Science, 1-3(299):451-475, 2003.