Automated unbounded verification of stateful cryptographic protocols with exclusive OR
- Submitting institution
-
Heriot-Watt University
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 27416364
- Type
- E - Conference contribution
- DOI
-
10.1109/CSF.2018.00033
- Title of conference / published proceedings
- 2018 IEEE 31st Computer Security Foundations Symposium (CSF)
- First page
- 359
- Volume
- -
- Issue
- -
- ISSN
- 1940-1434
- Open access status
- Compliant
- Month of publication
- August
- Year of publication
- 2018
- URL
-
-
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
3
- Research group(s)
-
-
- Citation count
- 6
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- Significance: The implementation of a sound theory of XOR in the Tamarin verification tool enabled the faithful modeling and analysis of 5G Authentication resulting in a companion paper published at ACM CCS. It enabled others to, e.g., formally analyse IoT protocols, or build a formal model of an identity-based encryption scheme.
Originality: Provides the first tool that can handle real protocols using XOR in combination with other complex equational theories, mutable state and an unbounded number of protocol sessions.
Contribution: Equational theory for XOR with new normal form condition, proof of soundness, and improved adversary model.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -
