Attack Trees in Isabelle extended with probabilities for Quantum Cryptography
- Submitting institution
-
Middlesex University
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 1711
- Type
- D - Journal article
- DOI
-
10.1016/j.cose.2019.101572
- Title of journal
- Computers and Security
- Article number
- 101572
- First page
- -
- Volume
- 87
- Issue
- -
- ISSN
- 0167-4048
- Open access status
- Compliant
- Month of publication
- July
- Year of publication
- 2019
- URL
-
http://eprints.mdx.ac.uk/27289/
- 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
-
0
- Research group(s)
-
-
- Citation count
- 1
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- This paper presents a proof calculus for Attack Trees and adds probabilistic reasoning on attacks. A central correctness and completeness result, proved in Isabelle, establishes a connection between the notion of attack tree validity and computational tree logic (CTL). Adding probabilities creates PCTL. The paper uses the proof calculus to develop a generic theory of attack trees with a state-based semantics based on Kripke structures and CTL. This paper is significant because it enables proof of quantitative security properties in Quantum Cryptography; it shows how attackers can intercept a quantum key from a standard quantum communication algorithm.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -