Quantum no-key protocol for secure communication of classical message
Li Yang

TL;DR
This paper introduces a quantum no-key protocol for secure classical message transmission, leveraging quantum Boolean permutations, achieving information-theoretic security, mutual authentication, and resistance to middleman attacks.
Contribution
It presents a novel quantum no-key protocol that ensures perfect security and authentication with minimal rounds, advancing quantum secure communication methods.
Findings
Protocol is information-theoretically secure
Achieves mutual data origin authentication
4-round protocol is optimal for security
Abstract
We propose a class of quantum no-key protocols for private communication of classical message based on quantum computing of random Boolean permutations, and demonstrate that they are information-theoretic secure. These protocols are designed to resist middleman attack for two parties preshared authentication key, and achieve perfect mutual data origin authentication which ensures the permanent reusing of authentication key. Finally, we simplify the protocol to a 4-round one, and show that any protocol with 3 or less rounds cannot achieve perfect security without consuming preshared key.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Information and Cryptography · Quantum Mechanics and Applications · Quantum Computing Algorithms and Architecture
