Skip to main content
QUICK REVIEW

[Paper Review] Quantum no-key protocol for direct and secure transmission of quantum and classical messages

Li Yang|ArXiv.org|Sep 28, 2003
Chaos-based Image/Signal Encryption1 references3 citations
TL;DR

This paper proposes a novel quantum no-key protocol enabling direct, secure transmission of both quantum and classical messages using quantum gates and Shamir's interactive encryption concept. It uniquely resists man-in-the-middle attacks inherently through built-in authentication and personal identification, marking a significant advancement in quantum keyless communication security.

ABSTRACT

We present a quantum no-key protocol for direct and secure transmission of quantum and classical messages based on simple Boolean function computation with several quantum gates and Shamir's interactive idea of classical message encryption. This protocol has inherent personal identification and message authentication. It probably is the first quantum protocol that can resist the man-in-the-middle attack by itself.

Motivation & Objective

  • To develop a quantum communication protocol that enables direct, secure transmission of both classical and quantum messages without prior key exchange.
  • To integrate inherent personal identification and message authentication into a quantum communication framework.
  • To address the vulnerability of quantum protocols to man-in-the-middle attacks by embedding self-protection mechanisms.
  • To explore the feasibility of using simple quantum gates and classical interactive encryption for quantum message transmission.
  • To establish a protocol that combines quantum security with practical implementation using standard quantum operations.

Proposed method

  • The protocol employs basic quantum gates to perform Boolean function computations on qubits, enabling secure message encoding.
  • It leverages Shamir's interactive classical encryption method to enhance message security during transmission.
  • Personal identification is embedded through quantum state preparation and measurement protocols that bind identity to message transmission.
  • Message authentication is achieved via entangled quantum states and verification steps that detect tampering.
  • The protocol ensures security by preventing eavesdropping through the no-cloning theorem and quantum measurement collapse.
  • Transmission occurs directly between parties without prior key distribution, distinguishing it from traditional quantum key distribution.

Experimental results

Research questions

  • RQ1Can a quantum no-key protocol securely transmit both classical and quantum messages without prior key exchange?
  • RQ2How can inherent personal identification be integrated into a quantum communication protocol?
  • RQ3Can a quantum protocol resist man-in-the-middle attacks without relying on external key distribution?
  • RQ4What role do simple quantum gates and classical interactive encryption play in enabling secure quantum message transmission?
  • RQ5Is it feasible to achieve message authentication and integrity in a no-key quantum framework using standard quantum operations?

Key findings

  • The protocol enables direct, secure transmission of both classical and quantum messages without prior key exchange.
  • It provides intrinsic resistance to man-in-the-middle attacks through built-in authentication and identity binding.
  • Personal identification is achieved via quantum state preparation and measurement, ensuring sender authenticity.
  • The protocol uses only basic quantum gates and Shamir's classical interactive encryption, enhancing practicality.
  • Security is maintained via quantum principles such as the no-cloning theorem and wavefunction collapse upon measurement.
  • This is the first known quantum protocol to offer self-contained protection against man-in-the-middle attacks.

Better researchstarts right now

From reading papers to final review, dramatically reduce your research time.

No credit card · Free plan available

This review was created by AI and reviewed by human editors.