Author:
Satya Kuppam
Affiliation:
University of Massachusetts, Amherst and U.S.A.
Keyword(s):
PRISM, Modelling, Analysis, Verification, Quantum Cryptography, Communicating Quantum Processes, π-calculus.
Related
Ontology
Subjects/Areas/Topics:
Agent Based Modeling and Simulation
;
Complex Systems Modeling and Simulation
;
Computer Simulation Techniques
;
Computer-Supported Education
;
Domain-Specific Tools
;
Enterprise Information Systems
;
Formal Methods
;
Information Systems Analysis and Specification
;
Information Technologies Supporting Learning
;
Security
;
Security and Privacy
;
Sensor Networks
;
Simulation and Modeling
;
Simulation Tools and Platforms
;
Software and Architectures
Abstract:
Proof of security of cryptography protocols theoretically establishes the strength of a protocol and the constraints under which it can perform, it does not take into account the overall design of the protocol. In the past model checking has been successfully applied to classical cryptography protocols to weed out design flaws which would have otherwise gone unnoticed. Quantum key distribution protocols differ from their classical counterparts, in their ability to detect the presence of an eavesdropper while exchanging the key. Although unconditional security has been proven for both BB84(Mayers, 2002) and B92(Quan and Chaojing, 2002) key distribution protocols, in this paper we show that identifying an eavesdropper’s presence is constrained on the number of qubits exchanged. We first model the protocols in Communicating Quantum Processes (CQP)(Gay and Nagarajan, 2005)(Davidson, 2012) and then explain the mechanism by which we have translated this into a PRISM model and how we analys
ed the protocols’ capabilities. We mainly focus on the protocols’ ability to detect an active eavesdropper and the extent to which an eavesdropper can retrieve the shared key without being detected by either party. We then conclude by comparing the performance of the protocols.
(More)