Reducing protocol analysis with XOR to the XOR-free case in the horn theory based approach

Proceedings of the ACM Conference on Computer and Communications Security

Volumn , Issue , 2008, Pages 129-138

  Kusters, Ralf ^a   Truderung, Tomasz ^a  

^a UNIVERSITY OF TRIER   (Germany)

Author keywords

Algebraic properties; Security protocols

Indexed keywords

ALGEBRAIC PROPERTIES; AUTOMATIC ANALYSIS; CRYPTOGRAPHIC PROTOCOLS; EXCLUSIVE-OR; HORN THEORY; LARGE CLASS; PROTOCOL ANALYSIS; SECURITY ANALYSIS; SECURITY PROTOCOLS; SEVERAL PROTOCOLS;

ALGEBRA; CRYPTOGRAPHY; NETWORK SECURITY;

NETWORK PROTOCOLS;

EID: 70349286236     PISSN: 15437221     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1455770.1455788     Document Type: Conference Paper

References (20)

1. CCA Basic Services Reference and Guide: CCA Basic Services Reference and Guide, 2003. Available at http: //www-306.ibm.com/security/cryptocards/pdfs/CCA- Basic-Services-241-Revised-20030918.pdf.
2. B. Blanchet. An Efficient Cryptographic Protocol Verifier Based on Prolog Rules. In Proc. of CSFW-14, pages 82-96. IEEE Comp. Soc. Press, 2001.
3. Bruno Blanchet. Automatic verification of correspondences for security protocols, 2008. Report arXiv:0802.3444vl. Available at http://arxiv.org/abs/ 0802.3444vl.
4. Bruno Blanchet, Martín Abadi, and Cédric Fournet. Automated verification of selected equivalences for security protocols. Journal of Logic and Algebraic Programming, 75(1):3-51, 2008.
5. Mike Bond. Attacks on cryptoprocessor transaction sets. In Proc of CHES 2001, vol. 2162 of LNCS, pages 220-234. Springer, 2001.
6. J.A. Bull and D.J. Otway. The authentication protocol. Technical Report DRA/CIS3/PROJ/CORBA/SC/1/CSM/436-04/03, Defence Research Agency, Malvern, UK, 1997.
7. Y. Chevalier, R. Ku7die;sters, M. Rusinowitch, and M. Turuani. An NP Decision Procedure for Protocol Insecurity with XOR. In Proc. of LICS 2003, pages 261-270. IEEE, Comp. Soc. Press, 2003.
8. J. Clulow. The design and analysis of cryptographic APIs for security devices, 2003. Master's thesis, University of Natal, Durban.
9. H. Comon-Lundh and V. Cortier. New Decidability Results for Fragments of First-order Logic and Application to Cryptographic Protocols. In Proc. of RTA '2003, vol. 2706 of LNCS, pages 148-164. Springer, 2003.
10. H. Comon-Lundh and V. Shmatikov. Intruder deductions, constraint solving and insecurity decision in presence of exclusive or. In Proc. of LICS 2003, pages 271-280. IEEE Comp. Soc. Press, 2003.
11. Hubert Comon-Lundh and Véronique Cortier. Securitj' properties: two agents are sufficient. Sci. Corn-put. Program., 50(l-3):51-71, 2004.
12. Hubert Comon-Lundh and Stéphanie Delaune. The finite variant property: How to get rid of some algebraic properties. In Proc. of RTA 2005, vol. 3467 of LNCS, pages 294-307. Springer, 2005.
13. V. Cortier, S. Delaune, and G. Steel. A formal theory of key conjuring. In Proc. of CSF 2006, pages 79-93. IEEE Comp. Soc. Press, 2007.
14. V. Cortier, G. Keighren, and G. Steel. Automatic Analysis of the Security of XOR-Based Key Management Schemes. In Proc. of TACAS 2007, vol. 4424 of LNCS, pages 538-552. Springer, 2007.
15. R. Küsters and T. Truderung. On the Automatic Analysis of Recursive Security Protocols with XOR. In Proc. of STAGS 2007, vol. 4393 of LNCS, pages 646-657, Springer, 2007,
16. R. Küsters and T. Truderung. Reducing Protocol Analysis with XOR to the XOR-free Case in the Horn Theory Based Approach. Implementation, 2008. Available at http://infsec.uni-trier.de/software/ KuestersTruderung-XORPROVERIF- 2008.zip.
17. R. Küsters and T. Truderang. Reducing Protocol Analysis with XOR to the XOR-free Case in the Horn Theory Based Approach. Report arXiv:0808.0634vl, 2008. Available at http://arxiv.org/abs/0808.0634vl.
18. V. Shoup and A. Rubin. Session key distribution using smart cards. In Proc. of EUROCRYPT 1996, vol. 1070 of LNCS, pages 321-331. Springer, 1996.
19. Graham Steel. Deduction with XOR constraints in security API modelling. In CADE, vol. 3632 of LNCS, pages 322-336. Springer, 2005.
20. K.N. Verma, H. Seidl, and T. Schwentick. On the complexity of equational Horn clauses. In Proc. of CADE 2005, vol. 3328 of LNCS, pages 337-352. Springer, 2005.