Corpus ID: 15050533

Defeating Man-inthe-Middle Attack in Quantum Key Distribution

@inproceedings{Faraj2006DefeatingMA,
  title={Defeating Man-inthe-Middle Attack in Quantum Key Distribution},
  author={S. T. Faraj},
  year={2006}
}
Quantum cryptosystems use some properties of quantum mechanics to create secret shared cryptographic keys that remain secret even against an eavesdropper with an access to unlimited computational power. All quantum key distribution (QKD) protocols require that the parties have access to an authentic channel. Otherwise, QKD is vulnerable to man-in-the-middle attacks. This paper studies QKD from this point of view, emphasizing the necessity and sufficiency of using unconditionally secure… Expand

Figures from this paper

References

SHOWING 1-10 OF 21 REFERENCES
Quantum Cryptography
TLDR
A remarkable surge of interest in the international scientific and industrial community has propelled quantum cryptography into mainstream computer science and physics and it is becoming increasingly practical at a fast pace. Expand
Proof of security of quantum key distribution with two-way classical communications
TLDR
This investigation suggests that two-way entanglement purification is a useful tool in the study of advantage distillation, error correction, and privacy amplification protocols. Expand
Experimental Quantum Cryptography
TLDR
Initial results from an apparatus and protocol designed to implement quantum public key distribution are described, by which two users exchange a random quantum transmission, consisting of very faint flashes of polarized light, which remains secure against an adversary with unlimited computing power. Expand
A NOVEL PROTOCOL-AUTHENTICATION ALGORITHM RULING OUT A MAN-IN-THE MIDDLE ATTACK IN QUANTUM CRYPTOGRAPHY
TLDR
A modified authentication algorithm is proposed which features higher efficiency with respect to consumption of mutual secret bits in relation to "man-in-the-middle attacks" and the standard authentication methods applied to counteract these attacks. Expand
Estimates for practical quantum cryptography
In this article I present a protocol for quantum cryptography which is secure against attacks on individual signals. It is based on the Bennett-Brassard protocol of 1984 (BB84). The security proof isExpand
Unconditional security in quantum cryptography
  • D. Mayers
  • Computer Science, Mathematics
  • JACM
  • 2001
TLDR
Basic techniques to prove the unconditional security of quantum crypto graphy are described and a practical variation on the protocol in which the channel is noisy and photos may be lost during the transmission is considered. Expand
Fast, efficient error reconciliation for quantum cryptography
We describe an error-reconciliation protocol, which we call Winnow, based on the exchange of parity and Hamming's 'syndrome' for N-bit subunits of a large dataset. The Winnow protocol was developedExpand
Quantum cryptographic key distribution in multiple-access networks
  • S. T. Faraj, F. Al-Naima, S. Y. Ameen
  • Computer Science
  • WCC 2000 - ICCT 2000. 2000 International Conference on Communication Technology Proceedings (Cat. No.00EX420)
  • 2000
TLDR
A general procedure for modeling and simulation of quantum key distribution protocols in multiple-access networks for guaranteed security services in optical communication networks is outlined. Expand
New Hash Functions and Their Use in Authentication and Set Equality
TLDR
Several new classes of hash functions with certain desirable properties are exhibited, and two novel applications for hashing which make use of these functions are introduced, including a provably secure authentication technique for sending messages over insecure lines and the application of testing sets for equality. Expand
Secret-Key Reconciliation by Public Discussion
TLDR
A more efficient protocol is presented, which leaks an amount of information acceptably close to the minimum possible for sufficiently reliable secret channels (those with probability of any symbol being transmitted incorrectly as large as 15%). Expand
...
1
2
3
...