RESPONSE TO "VULNERABILITY OF 'A NOVEL PROTOCOL-AUTHENTICATION ALGORITHM RULING OUT A MAN-IN-THE-MIDDLE ATTACK IN QUANTUM CRYPTOGRAPHY' "

@article{Peev2004RESPONSET,
  title={RESPONSE TO "VULNERABILITY OF 'A NOVEL PROTOCOL-AUTHENTICATION ALGORITHM RULING OUT A MAN-IN-THE-MIDDLE ATTACK IN QUANTUM CRYPTOGRAPHY' "},
  author={Momtchil Peev and Christoph Pacher and Thomas Lor{\"u}nser and Michael Nolle and Andreas Poppe and Oliver Maurhart and Martin Suda and Alessandro Fedrizzi and Rupert Ursin and Anton Zeilinger},
  journal={International Journal of Quantum Information},
  year={2004},
  volume={7},
  pages={1401-1407}
}
In this work, we respond to a comment by A. Abidin and J.-A. Larsson on our previous paper, Int. J. Quant. Inf.3 (2005) 225. 

Vulnerability of "A Novel Protocol-Authentication Algorithm Ruling out a Man-in-the-Middle Attack in Quantum Cryptography"

A novel protocol-authentication algorithm ruling out a man-in-the-middle attack in quantum cryptography and its implications are commented on.

FEASIBILITY OF THE INTERLOCK PROTOCOL AGAINST MAN-IN-THE-MIDDLE ATTACKS ON QUANTUM CRYPTOGRAPHY

If an eavesdropper succeeds in compromising the quantum as well as the classical channels and mimics the receiver "Bob" for the sender "Alice" and vice versa, one defence strategy is the successive,

Defeating Man-inthe-Middle Attack in Quantum Key Distribution

In this work, a new technique of using unconditionally secure authentication is proposed for quantum cryptosystems, based on a hybrid of normal application of authentication codes and the so-called “counterbased” authentication method to achieve a better trade off between security and efficiency.

Authentication in Quantum Key Distribution : Security Proof and Universal Hash Functions

Quantum Key Distribution (QKD) is a secret key agreement technique that consists of two parts: quantum transmission and measurement on a quantum channel, and classical post-processing on a public c

Cryptanalysis of a practical quantum key distribution with polarization-entangled photons

It is shown that the authentication scheme used to secure an actual bank transaction by means of quantum cryptography is insecure in the sense that an attacker can provoke a situation where initiator and responder of a key exchange end up with different keys.

Secure Message Relay over Networks with QKD-Links

This article demonstrates how to ensure correct routing and secure authentication between adjacent QKD-capable nodes, and it is demonstrated how a person-in-the-middle attack can be countered using universal hash functions.

Cryptanalysis of quantum secure direct communication protocol with mutual authentication based on single photons and Bell states

This work shows that the above QSDC protocol is secure neither against intercept-and-resend attack, nor against impersonation attack, and proposes a suitable modification of this protocol, which not only defeats the above attacks, but also resists all other common attacks.

Classical Authenticated Key Exchange and Quantum Cryptography

This thesis introduces multi-factor password-authenticated key exchange which allows secure authentication and key agreement based on multiple short secrets, such as a long-term password and a one-time response, and considers the integration of denial of service countermeasures with key exchange protocols.

Attacks on quantum key distribution protocols that employ non-ITS authentication

It is proved that the set of messages that collide with any given message under this authentication code contains with high probability a message that has small Hamming distance to any other given message.

Attacks on quantum key distribution protocols that employ non-ITS authentication

It is proved that the set of messages that collide with any given message under this authentication code contains with high probability a message that has small Hamming distance to any other given message.

References

SHOWING 1-10 OF 17 REFERENCES

Cryptanalysis of a practical quantum key distribution with polarization-entangled photons

It is shown that the authentication scheme used to secure an actual bank transaction by means of quantum cryptography is insecure in the sense that an attacker can provoke a situation where initiator and responder of a key exchange end up with different keys.

Why Quantum Cryptography

This paper presents a systematic comparison of QKE with traditional key exchange protocols in realistic secure communication systems and shows that QKE is vulnerable to man-in-the-middle attacks.

LFSR-based Hashing and Authentication

The characterization of the properties required from a family of hash functions in order to be secure for authentication when combined with a (secure) stream cipher is characterization.

Eavesdropping without quantum memory

It is shown that in this case the eavesdropper obtains a better information/disturbance trade-off by adopting the simple intercept/resend strategy.

New Hash Functions and Their Use in Authentication and Set Equality

Practical quantum key distribution with polarization entangled photons

The full key generation protocol was performed in real-time over a fiber bundle of 1.45 km length and the generated quantum key was immediately handed over and used by a secure communication application of order for remittance.

Practical Quantum Cryptography: A Comprehensive Analysis (Part One)

An extended family of generalizations of the Bennett-Brassard (BB84) QC protocol is introduced that equally provide unconditional secrecy but allow for the possibility of optimizing throughput rates against specific cryptanalytic attacks.

The physics of quantum information: quantum cryptography, quantum teleportation, quantum computation

Leading experts from "The Physics of Quantum Information" network, initiated by the European Commission, bring together the most recent results from this emerging area of quantum technology, considering both theory and newest experiments.

Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories

The present paper provides a comprehensive study of algorithms which are designed for shared memory models of parallel computation (PRAMs) in which processors are allowed to have fairly unrestricted access patterns to the shared memory.