Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1306.3388

Quantum no-key protocol for secure communication of classical message

Li Yang

Published Jun 14, 2013• 2 citations
arXivHTMLPDF

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.

DOI
10.48550/arxiv.1306.3388

Related papers

Quantum no-key protocol for direct and secure transmission of quantum and classical messages

Li Yang

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.

arXiv:quant-ph/0309200•Sep 28, 2003•6 citations

A quasi quantum secure direct communication protocol with authentication

Chen Zuning, Zheng Qin, Xianhui Wang

The quantum communication is a new-style communication scheme based on quantum mechanics. It arouses much interest recently. In this paper, a novel quantum secure communication protocol is proposed. This is a quasi quantum secure direct communication protocol, since it closely unites the quantum key distribution and the classical communication. In the protocol, a key is distributed between both parties participating in communication using EPR pairs, the secret message is sent through classical public channel and the both are closely combined. The protocol applies a braid-based key agreement protocol to let both parties share a secret random number, whose size and magnitude are undecided in advance. It is used to perform all the authentications of the communication. So the communication is simplified. The security of the proposed protocol is based on the no-cloning theorem and the fact that the p-th root finding problem on braid groups is intractable even on quantum computers, as well as classical computers.

IEEE International Conference on Computer Science and Information Technology•Jul 1, 2010•1 citation

Security Analysis and Designing Advanced Two-Party Lattice-Based Authenticated Key Establishment and Key Transport Protocols for Mobile Communication

Mani Rajendran, Dharminder Chaudhary, S A Lakshmanan +1 more

In this paper, we have proposed a two-party authenticated key establishment (AKE), and authenticated key transport protocols based on lattice-based cryptography, aiming to provide security against quantum attacks for secure communication. This protocol enables two parties, who may share long-term public keys, to securely establish a shared session key, and transportation of the session key from the server while achieving mutual authentication. Our construction leverages the hardness of lattice problems Ring Learning With Errors (Ring-LWE), ensuring robustness against quantum and classical adversaries. Unlike traditional schemes whose security depends upon number-theoretic assumptions being vulnerable to quantum attacks, our protocol ensures security in the post-quantum era. The proposed protocol ensures forward secrecy, and provides security even if the long-term key is compromised. This protocol also provides essential property key freshness and resistance against man-in-the-middle attacks, impersonation attacks, replay attacks, and key mismatch attacks. On the other hand, the proposed key transport protocol provides essential property key freshness, anonymity, and resistance against man-in-the-middle attacks, impersonation attacks, replay attacks, and key mismatch attacks. A two-party key transport protocol is a cryptographic protocol in which one party (typically a trusted key distribution center or sender) securely generates and sends a session key to another party. Unlike key exchange protocols (where both parties contribute to key generation), key transport protocols rely on one party to generate the key and deliver it securely. The protocol possesses a minimum number of exchanged messages and can reduce the number of communication rounds to help minimize the communication overhead.

Future Internet•Oct 16, 2025•1 citation

One-round Protocols for Two-Party Authenticated Key Exchange

Ik-Rae Jeong, Donghoon Lee

Abstract. Cryptographic protocol design in a two-party setting has often ignored the possibility of simultaneous message transmission by each of the two parties (i.e., using a duplex channel). In particular, most protocols for two-party key exchange have been designed assuming that parties alternate sending their messages (i.e., assuming a bidirectional half-duplex channel). However, by taking advantage of the communication characteristics of the network it may be possible to design protocols with improved latency. This is the focus of the present work. We present a number of provably-secure protocols for two-party authenticated key exchange (AKE) which require only a single round. Our first protocol provides key independence only, and is analyzed in the random oracle model. This scheme matches the most efficient AKE protocols among those found in the literature. Our second scheme additionally provides forward secrecy, and is also analyzed in the random oracle model. Our final protocol provides the same strong security guarantees, but is proven secure in the standard model. This scheme is only slightly less efficient (from a computational perspective) than the previous ones. These last two schemes are the first provably-secure one-round protocols for authenticated 2-party key exchange which provide forward secrecy.

Jeongbo gwahaghoe nonmunji. si'seu'tem mich i'lon•Jan 1, 2006•1 citation

Quantum no-key protocol with inherent identification

Li Yang, Lei Hu

Various protocols of quantum cryptography has been presented. Some of them can be used to transmit secret messages directly. In this letter we present a new kind of quantum cryptography protocol for direct transmission of classical and quantum messages based on Shamir's generic protocol on classical message encryption. Though Shamir's original idea has only realization of computational security and falls to middle-man attack, our protocol is theoretically secure based on properties of quantum entanglement and Boolean function, and can resist the middle-man attack.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•Aug 31, 2006•2 citations

Anonymous Classical Message Transmission Through Various Quantum Networks

Runhua Shi, Xia-qin Fang

Quantum network is a trending internet technology that exploits quantum mechanics principles to allow the communication between distant users. When a message is transmitted through a quantum network, guaranteeing the anonymity of a sender and a receiver is a fundamental property and formidable challenge. In this paper, we investigate anonymous classical message transmission through different quantum networks. Firstly, we establish various quantum network architectures, which can perfectly achieve anonymous communications without authenticated private channels, pre-shared keys or pre-distributed entanglements between any two users, and do not require complex routing through other users. Secondly, we present three practical and feasible quantum anonymous communication protocols for a ring quantum network, a linear quantum network, and a tree or graph mixed quantum network, respectively, which can ensure the information-theoretical security in semi-honest model and resist all side-channel attacks for measurement devices. Theoretical analysis and simulation experiments verify the feasibility of our proposed quantum protocols.

IEEE Transactions on Network Science and Engineering•Jan 16, 2024•11 citations
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.
The quantum communication is a new-style communication scheme based on quantum mechanics. It arouses much interest recently. In this paper, a novel quantum secure communication protocol is proposed. This is a quasi quantum secure direct communication protocol, since it closely unites the quantum key distribution and the classical communication. In the protocol, a key is distributed between both parties participating in communication using EPR pairs, the secret message is sent through classical public channel and the both are closely combined. The protocol applies a braid-based key agreement protocol to let both parties share a secret random number, whose size and magnitude are undecided in advance. It is used to perform all the authentications of the communication. So the communication is simplified. The security of the proposed protocol is based on the no-cloning theorem and the fact that the p-th root finding problem on braid groups is intractable even on quantum computers, as well as classical computers.
In this paper, we have proposed a two-party authenticated key establishment (AKE), and authenticated key transport protocols based on lattice-based cryptography, aiming to provide security against quantum attacks for secure communication. This protocol enables two parties, who may share long-term public keys, to securely establish a shared session key, and transportation of the session key from the server while achieving mutual authentication. Our construction leverages the hardness of lattice problems Ring Learning With Errors (Ring-LWE), ensuring robustness against quantum and classical adversaries. Unlike traditional schemes whose security depends upon number-theoretic assumptions being vulnerable to quantum attacks, our protocol ensures security in the post-quantum era. The proposed protocol ensures forward secrecy, and provides security even if the long-term key is compromised. This protocol also provides essential property key freshness and resistance against man-in-the-middle attacks, impersonation attacks, replay attacks, and key mismatch attacks. On the other hand, the proposed key transport protocol provides essential property key freshness, anonymity, and resistance against man-in-the-middle attacks, impersonation attacks, replay attacks, and key mismatch attacks. A two-party key transport protocol is a cryptographic protocol in which one party (typically a trusted key distribution center or sender) securely generates and sends a session key to another party. Unlike key exchange protocols (where both parties contribute to key generation), key transport protocols rely on one party to generate the key and deliver it securely. The protocol possesses a minimum number of exchanged messages and can reduce the number of communication rounds to help minimize the communication overhead.
Abstract. Cryptographic protocol design in a two-party setting has often ignored the possibility of simultaneous message transmission by each of the two parties (i.e., using a duplex channel). In particular, most protocols for two-party key exchange have been designed assuming that parties alternate sending their messages (i.e., assuming a bidirectional half-duplex channel). However, by taking advantage of the communication characteristics of the network it may be possible to design protocols with improved latency. This is the focus of the present work. We present a number of provably-secure protocols for two-party authenticated key exchange (AKE) which require only a single round. Our first protocol provides key independence only, and is analyzed in the random oracle model. This scheme matches the most efficient AKE protocols among those found in the literature. Our second scheme additionally provides forward secrecy, and is also analyzed in the random oracle model. Our final protocol provides the same strong security guarantees, but is proven secure in the standard model. This scheme is only slightly less efficient (from a computational perspective) than the previous ones. These last two schemes are the first provably-secure one-round protocols for authenticated 2-party key exchange which provide forward secrecy.
Various protocols of quantum cryptography has been presented. Some of them can be used to transmit secret messages directly. In this letter we present a new kind of quantum cryptography protocol for direct transmission of classical and quantum messages based on Shamir's generic protocol on classical message encryption. Though Shamir's original idea has only realization of computational security and falls to middle-man attack, our protocol is theoretically secure based on properties of quantum entanglement and Boolean function, and can resist the middle-man attack.
Quantum network is a trending internet technology that exploits quantum mechanics principles to allow the communication between distant users. When a message is transmitted through a quantum network, guaranteeing the anonymity of a sender and a receiver is a fundamental property and formidable challenge. In this paper, we investigate anonymous classical message transmission through different quantum networks. Firstly, we establish various quantum network architectures, which can perfectly achieve anonymous communications without authenticated private channels, pre-shared keys or pre-distributed entanglements between any two users, and do not require complex routing through other users. Secondly, we present three practical and feasible quantum anonymous communication protocols for a ring quantum network, a linear quantum network, and a tree or graph mixed quantum network, respectively, which can ensure the information-theoretical security in semi-honest model and resist all side-channel attacks for measurement devices. Theoretical analysis and simulation experiments verify the feasibility of our proposed quantum protocols.