9,840 research outputs found
Analysis of the Security of BB84 by Model Checking
Quantum Cryptography or Quantum key distribution (QKD) is a technique that
allows the secure distribution of a bit string, used as key in cryptographic
protocols. When it was noted that quantum computers could break public key
cryptosystems based on number theory extensive studies have been undertaken on
QKD. Based on quantum mechanics, QKD offers unconditionally secure
communication. Now, the progress of research in this field allows the
anticipation of QKD to be available outside of laboratories within the next few
years. Efforts are made to improve the performance and reliability of the
implemented technologies. But several challenges remain despite this big
progress. The task of how to test the apparatuses of QKD For example did not
yet receive enough attention. These devises become complex and demand a big
verification effort. In this paper we are interested in an approach based on
the technique of probabilistic model checking for studying quantum information.
Precisely, we use the PRISM tool to analyze the security of BB84 protocol and
we are focused on the specific security property of eavesdropping detection. We
show that this property is affected by the parameters of quantum channel and
the power of eavesdropper.Comment: 12 Pages, IJNS
Two-step orthogonal-state-based protocol of quantum secure direct communication with the help of order-rearrangement technique
The Goldenberg-Vaidman (GV) protocol for quantum key distribution (QKD) uses
orthogonal encoding states of a particle. Its security arises because
operations accessible to Eve are insufficient to distinguish the two states
encoding the secret bit. We propose a two-particle cryptographic protocol for
quantum secure direct communication, wherein orthogonal states encode the
secret, and security arises from restricting Eve from accessing any
two-particle operations. However, there is a non-trivial difference between the
two cases. While the encoding states are perfectly indistinguishable in GV,
they are partially distinguishable in the bi-partite case, leading to a
qualitatively different kind of information-vs-disturbance trade-off and also
options for Eve in the two cases.Comment: 9 pages, 4 figures, LaTex, Accepted for publication in Quantum
Information Processing (2014
Model checking quantum Markov chains
Although the security of quantum cryptography is provable based on the
principles of quantum mechanics, it can be compromised by the flaws in the
design of quantum protocols and the noise in their physical implementations.
So, it is indispensable to develop techniques of verifying and debugging
quantum cryptographic systems. Model-checking has proved to be effective in the
verification of classical cryptographic protocols, but an essential difficulty
arises when it is applied to quantum systems: the state space of a quantum
system is always a continuum even when its dimension is finite. To overcome
this difficulty, we introduce a novel notion of quantum Markov chain, specially
suited to model quantum cryptographic protocols, in which quantum effects are
entirely encoded into super-operators labelling transitions, leaving the
location information (nodes) being classical. Then we define a quantum
extension of probabilistic computation tree logic (PCTL) and develop a
model-checking algorithm for quantum Markov chains.Comment: Journal versio
- …