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

DOI10.1007/s10817-010-9188-8zbMath1213.94119OpenAlexW2053014980WikidataQ60530316 ScholiaQ60530316MaRDI QIDQ540685

Tomasz Truderung, Ralf Küsters

Publication date: 3 June 2011

Published in: Journal of Automated Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10817-010-9188-8

zbMATH Keywords

automated verificationsecurity protocolsXOR

Mathematics Subject Classification ID

Cryptography (94A60) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (4)

Satisfiability of general intruder constraints with and without a set constructor ⋮ Reducing protocol analysis with XOR to the XOR-free case in the Horn theory based approach ⋮ Flat and One-Variable Clauses for Single Blind Copying Protocols: The XOR Case ⋮ Automatic Verification of Security Protocols in the Symbolic Model: The Verifier ProVerif

Uses Software

• ProVerif

Cites Work

• Unnamed Item
• Unnamed Item
• Reducing protocol analysis with XOR to the XOR-free case in the Horn theory based approach
• An NP decision procedure for protocol insecurity with XOR
• Security properties: two agents are sufficient
• Automated verification of selected equivalences for security protocols
• Session Key Distribution Using Smart Cards
• On the Automatic Analysis of Recursive Security Protocols with XOR
• Flat and One-Variable Clauses for Single Blind Copying Protocols: The XOR Case
• On the Security of PKCS #11
• Automated Deduction – CADE-20
• Automated Deduction – CADE-20
• Term Rewriting and Applications
• Automatic Analysis of the Security of XOR-Based Key Management Schemes

This page was built for publication: Reducing protocol analysis with XOR to the XOR-free case in the Horn theory based approach