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

Journal of the Graduate School of the Chinese Academy of Sciences

Quantum identification based on one-time pad

Pan Jiang

Published Jan 1, 2012• 0 citations
OpenAlex

Abstract

We propose a quantum identification scheme.The scheme uses one-time random strings to hide the key shared by both sides,and the verification algorithm is independent of the random strings.So it protects the key.The scheme is secure even if the adversary has unlimited resource of computation.

Related papers

Quantum Authentication Based on the Lengthened String Scheme

Fen-Zhuo Guo, Fen-zhuo, Wen  +3 more

Assuming there is a shared string between the users, we present a novel scheme, the lengthened string scheme (LSS), where the shared string is lengthened firstly by a specially designed algorithm, then some special treatments are applied on the lengthened one before it is used to authenticate. Based on the lengthened string scheme (LSS) we propose a quantum authentication protocol using entanglements. And the robustness of our protocol is discussed. In fact all the quantum key distribution protocols can do identification simultaneously based on the LSS.

中国邮电高校学报:英文版•Jan 1, 2004•0 citations

Quantum identification schemes with entanglements

Takashi Mihara

We need secure identification schemes because many situations exist in which a person must be identified. In this paper, we propose three quantum identification schemes with entanglements. First, we propose a quantum one-time pad password scheme. In this scheme, entanglements play the role of a one-time pad password. Next, we propose a quantum identification scheme that requires a trusted authority. Finally, we propose a quantum message authentication scheme that is constructed by combining a different quantum cryptosystem with an ordinary authentication tag.

Physical Review A•May 8, 2002•83 citations

An Efficient Algorithm on Quantum Computing With Quantum Key Distribution for Secure Communication

Ganapathy Senthil Murugan

Currently many symmetric key cryptographic tools which are known to be quantum-safe. They all share Secret symmetric keys through an untrusted medium which is usually done with public key methods which are prone to quantum attacks. One among the recommended solutions to the key distribution problem is Quantum Key Distribution (QKD). QKD utilizes an authenticated Communication channel along with a quantum communication channel so that a secret key is generated. Whatever may be the protocol to implement proposed QKD, they all need both a quantum channel, and an authenticated classical. OTP (One Time Pad) is used when two parties wish to communications have to share a key called pad. This pad is a randomly generated key and the length of the key should be equal to the message so it can be sent. The proposed QKD parameters that result in almost 35.67% smaller keys for quantum security and an implementation of QKD in network which is publicly available and usable in practice.

International journal of communication•May 14, 2020•2 citations

Untappable Key Distribution System: a One-Time-Pad Booster

Geraldo A. Barbosa, Jeroen van de Graaf

The One-Time-Pad (OTP) protocol gives unconditional security for the information being encrypted. Correctly implemented, not even an adversary with a quantum computer can crack it. However, the need of sharing in a secure way supplies of symmetric random keys turned the method almost obsolete as a stand-alone method for fast and large volume telecommunication. Basically, this secure sharing of keys and their renewal, once exhausted, had to be done through couriers, in a slow and costly process. This paper presents a solution for this problem providing a fast and unlimited renewal of secure keys: An untappable key distribution system is presented and detailed. This fast key distribution system utilizes two layers of confidentially protection: 1) Physical noise intrinsic to the optical channel that turn the coded signals into stealth signals and 2) Privacy amplification using a bit pool of refreshed entropy run after run, to eliminate any residual information. The resulting level of security is rigorously calculated and demonstrates that the level of information an eavesdropper could obtain is negligible. The random bit sequences, fast and securely distributed, can be used to encrypt text, data or voice.

arXiv:1406.1543•Journal of Information Security and Cryptography (Enigma)•May 4, 2016•6 citations

Quantum identification system

Miloslav Dušek, Ondřej Haderka, Martin Hendrych +1 more

A secure quantum identification system combining a classical identification procedure and quantum key distribution is proposed. Each identification sequence is always used just once and sequences are ``refueled'' from a shared provably secret key transferred through the quantum channel. Two identification protocols are devised. The first protocol can be applied when legitimate users have an unjammable public channel at their disposal. The deception probability is derived for the case of a noisy quantum channel. The second protocol employs unconditionally secure authentication of information sent over the public channel, and thus can be applied even in the case when an adversary is allowed to modify public communications. An experimental realization of a quantum identification system is described.

arXiv:quant-ph/9809024•Physical Review A•Jul 1, 1999•179 citations

A Practical Perfect Secrecy Approach for IoBT Systems

Mohammad Moltafet, Hamid R. Sadjadpour, Zouheir Rezki

We consider an Internet of battlefield things (IoBT) system in which multiple devices want to communicate securely with each other in the presence of an adversary with unbounded storage and unbounded computational power. We provide an information-theoretically secure protocol to exchange highly confidential messages among the devices in the system. The main idea behind the protocol is to provide one-time pad secret keys to exchange messages via using a random string that is securely shared among all the devices and pair-wise random secret keys established between each pair of devices. We show that the protocol provides ever-lasting security against the adversary with unbounded storage and unbounded computational power. More specifically, the protocol guarantees that the adversary gains no information about a message, except for an exponentially small probability in a security parameter. Moreover, we prove that revealing all the pair-wise secret keys does not provide any information to the adversary. In addition, we show that the pair-wise secret keys are established once to securely exchange multiple messages between devices in the system. Besides that, we prove that even if the random string is revealed to the adversary, the provided protocol is computationally secure.

IEEE Military Communications Conference (MILCOM)•Oct 30, 2023•1 citation
Assuming there is a shared string between the users, we present a novel scheme, the lengthened string scheme (LSS), where the shared string is lengthened firstly by a specially designed algorithm, then some special treatments are applied on the lengthened one before it is used to authenticate. Based on the lengthened string scheme (LSS) we propose a quantum authentication protocol using entanglements. And the robustness of our protocol is discussed. In fact all the quantum key distribution protocols can do identification simultaneously based on the LSS.
We need secure identification schemes because many situations exist in which a person must be identified. In this paper, we propose three quantum identification schemes with entanglements. First, we propose a quantum one-time pad password scheme. In this scheme, entanglements play the role of a one-time pad password. Next, we propose a quantum identification scheme that requires a trusted authority. Finally, we propose a quantum message authentication scheme that is constructed by combining a different quantum cryptosystem with an ordinary authentication tag.
Currently many symmetric key cryptographic tools which are known to be quantum-safe. They all share Secret symmetric keys through an untrusted medium which is usually done with public key methods which are prone to quantum attacks. One among the recommended solutions to the key distribution problem is Quantum Key Distribution (QKD). QKD utilizes an authenticated Communication channel along with a quantum communication channel so that a secret key is generated. Whatever may be the protocol to implement proposed QKD, they all need both a quantum channel, and an authenticated classical. OTP (One Time Pad) is used when two parties wish to communications have to share a key called pad. This pad is a randomly generated key and the length of the key should be equal to the message so it can be sent. The proposed QKD parameters that result in almost 35.67% smaller keys for quantum security and an implementation of QKD in network which is publicly available and usable in practice.
The One-Time-Pad (OTP) protocol gives unconditional security for the information being encrypted. Correctly implemented, not even an adversary with a quantum computer can crack it. However, the need of sharing in a secure way supplies of symmetric random keys turned the method almost obsolete as a stand-alone method for fast and large volume telecommunication. Basically, this secure sharing of keys and their renewal, once exhausted, had to be done through couriers, in a slow and costly process. This paper presents a solution for this problem providing a fast and unlimited renewal of secure keys: An untappable key distribution system is presented and detailed. This fast key distribution system utilizes two layers of confidentially protection: 1) Physical noise intrinsic to the optical channel that turn the coded signals into stealth signals and 2) Privacy amplification using a bit pool of refreshed entropy run after run, to eliminate any residual information. The resulting level of security is rigorously calculated and demonstrates that the level of information an eavesdropper could obtain is negligible. The random bit sequences, fast and securely distributed, can be used to encrypt text, data or voice.
A secure quantum identification system combining a classical identification procedure and quantum key distribution is proposed. Each identification sequence is always used just once and sequences are ``refueled'' from a shared provably secret key transferred through the quantum channel. Two identification protocols are devised. The first protocol can be applied when legitimate users have an unjammable public channel at their disposal. The deception probability is derived for the case of a noisy quantum channel. The second protocol employs unconditionally secure authentication of information sent over the public channel, and thus can be applied even in the case when an adversary is allowed to modify public communications. An experimental realization of a quantum identification system is described.
We consider an Internet of battlefield things (IoBT) system in which multiple devices want to communicate securely with each other in the presence of an adversary with unbounded storage and unbounded computational power. We provide an information-theoretically secure protocol to exchange highly confidential messages among the devices in the system. The main idea behind the protocol is to provide one-time pad secret keys to exchange messages via using a random string that is securely shared among all the devices and pair-wise random secret keys established between each pair of devices. We show that the protocol provides ever-lasting security against the adversary with unbounded storage and unbounded computational power. More specifically, the protocol guarantees that the adversary gains no information about a message, except for an exponentially small probability in a security parameter. Moreover, we prove that revealing all the pair-wise secret keys does not provide any information to the adversary. In addition, we show that the pair-wise secret keys are established once to securely exchange multiple messages between devices in the system. Besides that, we prove that even if the random string is revealed to the adversary, the provided protocol is computationally secure.