On the Automatic Analysis of Recursive Security Protocols with XOR

DOI10.1007/978-3-540-70918-3_55MaRDI QIDQ3590969zbMATH OpenOpenAlexFDO

Authors Ralf Küsters, Tomasz Truderung

Publication date 3 September 2007

Published in STACS 2007 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-70918-3_55

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• STACS 2004
• Deciding security for protocols with recursive tests
• An NP decision procedure for protocol insecurity with XOR
• Transducer-based analysis of cryptographic protocols
• Reducing protocol analysis with XOR to the XOR-free case in the Horn theory based approach

Cited in

(13)

• Analysis of the Xedni calculus attack
• Transducer-based analysis of cryptographic protocols
• Authentication Revisited: Flaw or Not, the Recursive Authentication Protocol
• Proving Group Protocols Secure Against Eavesdroppers
• Deciding security for protocols with recursive tests
• STACS 2004
• Automated Deduction – CADE-20
• Reducing protocol analysis with XOR to the XOR-free case in the Horn theory based approach
• Improved Security Analysis of XEX and LRW Modes
• An NP decision procedure for protocol insecurity with XOR
• Automatic Analysis of the Security of XOR-Based Key Management Schemes
• CryptoSolve: towards a tool for the symbolic analysis of cryptographic algorithms
• Algorithmic problems in the symbolic approach to the verification of automatically synthesized cryptosystems

This page was built for publication: On the Automatic Analysis of Recursive Security Protocols with XOR

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3590969)