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

IEEE International Conference on Advanced Networks and Telecommunications Systems

New protocol for quantum public key cryptography

Abhishek Parakh

Published Dec 1, 2015• 5 citations
Publisher

Abstract

We present a quantum public key cryptographic protocol that allow Bob to send any arbitrary qubit state to Alice, securely. The proposed protocol (quantum pad-lock protocol) uses quantum entanglement and does not discard any qubits during the transfer process. The protocol allow for more number of bits to be transferred securely compared to BB84 and other protocols based on random measurements.

DOI
10.1109/ants.2015.7413667

Related papers

A probabilistic quantum key transfer protocol

Abhishek Parakh

ABSTRACT We propose a protocol to transfer a one‐time pad (in a probabilistic manner) from Alice to Bob, over a public channel. The proposed protocol is unique because Bob merely acts as a receiver of the pad (secret key); that is, Bob does not need to send any message back to Alice unless he detects eavesdropping. Such a secure transfer of one‐time pad, over public channel, is not possible in classical cryptography, and in quantum cryptography, all previous protocols require Bob to send almost as many messages back to Alice as she does to Bob to establish a key. Copyright © 2013 John Wiley & Sons, Ltd.

Security and Communication Networks•Mar 13, 2013•17 citations

An one-time-pad key communication protocol with entanglement

Qing-yu Cai

We present an one-time-pad key communication protocol that allows secure direct communication with entanglement. Alice can send message to Bob in a deterministic manner by using local measurements and public communication. The theoretical efficiency of this protocol is double compared with BB84 protocol. We show this protocol is unconditional secure under arbitrary quantum attack. And we discuss that this protocol can be perfectly implemented with current technologies.

arXiv:quant-ph/0309108•Sep 13, 2003•1 citation

Secure Data Transmission Using Qubits

Iman Marvian, Saied Hosseini-Khayat

A quantum protocol for secure transmission of data using qubits is presented. This protocol sends one qubit in a round-trip to transmit one bit of data. The protocol offers an improvement over the BB84 QKD protocol. BB84, in conjunction with one-time pad encryption, has been shown to be unconditionally secure. However its security relies on the assumption that the qubit source device does not emit multiple replicas of the same qubit for each transmitted bit. If this happens a multi-qubit emission attack can be launched. In addition, BB84 cannot be used to send predetermined bit strings as it generates a random bit string in the process. Our protocol does not have the above drawbacks, but requires an authenticated public channel in order to detect an intruder, in the way as BB84. Our protocol does not require a shared secret key.

arXiv:quant-ph/0503157•IEEE International Conference on Computer and Information Technology (CIT)•Jan 1, 2006•1 citation

Quantum Key Distribution with Qubit Pairs

Mohd Asad Siddiqui, Tabish Qureshi

We propose a new Quantum Key Distribution method in which Alice sends pairs of qubits to Bob; each is in one of four possible states. Bob uses one qubit to generate a secure key and the other to generate an auxiliary key. For each pair he randomly decides which qubit to use for which key. The auxiliary key has to be added to Bob’s secure key in order to match Alice’s secure key. This scheme provides an additional layer of security over the standard BB84 protocol.

arXiv:1301.5014•Journal of Quantum Information Science•Jan 1, 2014•3 citations

Quantum Digital Signatures

Daniel Gottesman, Isaac L. Chuang

We present a quantum digital signature scheme whose security is based on fundamental principles of quantum physics. It allows a sender (Alice) to sign a message in such a way that the signature can be validated by a number of different people, and all will agree either that the message came from Alice or that it has been tampered with. To accomplish this task, each recipient of the message must have a copy of Alice's "public key," which is a set of quantum states whose exact identity is known only to Alice. Quantum public keys are more difficult to deal with than classical public keys: for instance, only a limited number of copies can be in circulation, or the scheme becomes insecure. However, in exchange for this price, we achieve unconditionally secure digital signatures. Sending an m-bit message uses up O(m) quantum bits for each recipient of the public key. We briefly discuss how to securely distribute quantum public keys, and show the signature scheme is absolutely secure using one method of key distribution. The protocol provides a model for importing the ideas of classical public key cryptography into the quantum world.

arXiv:quant-ph/0105032•May 8, 2001•175 citations

An Efficient Key Distribution Protocol Based on BB84

Parag K. Lala

Private key cryptography suffers from a major weakness - it requires sharing of a secret key between two parties. An intruder can copy the secret key as it is being exchanged, thereby severely compromising the security of the system. Thus a private key cryptographic system depends entirely on secrecy of the key. Public key cryptography does not have a key distribution problem but its security relies on the fact that determining the factors of a number that is the product of two very large prime numbers is not computationally feasible. It has been shown that a quantum computer can solve the prime factors of very large numbers in polynomial time which would otherwise take millions of years. Public key cryptography will therefore become insecure if quantum computing becomes a reality. Quantum cryptography, originally presented in BB84 protocol, avoids all these issues by encrypting the shared key using a series of photons. In this paper a key distribution protocol based on the concepts of BB84 is proposed It provides an additional layer of security by sending the key data bits twice; during the second transmission the original key bits or their complements are randomly chosen for transmission. The sender informs the receiver about the orientation of the key bits during the second round of transmission only after the data has been sent out.

American Journal of Computing Research Repository•Jan 23, 2014•0 citations
We present a quantum public key cryptographic protocol that allow Bob to send any arbitrary qubit state to Alice, securely. The proposed protocol (quantum pad-lock protocol) uses quantum entanglement and does not discard any qubits during the transfer process. The protocol allow for more number of bits to be transferred securely compared to BB84 and other protocols based on random measurements.
ABSTRACT We propose a protocol to transfer a one‐time pad (in a probabilistic manner) from Alice to Bob, over a public channel. The proposed protocol is unique because Bob merely acts as a receiver of the pad (secret key); that is, Bob does not need to send any message back to Alice unless he detects eavesdropping. Such a secure transfer of one‐time pad, over public channel, is not possible in classical cryptography, and in quantum cryptography, all previous protocols require Bob to send almost as many messages back to Alice as she does to Bob to establish a key. Copyright © 2013 John Wiley & Sons, Ltd.
A quantum protocol for secure transmission of data using qubits is presented. This protocol sends one qubit in a round-trip to transmit one bit of data. The protocol offers an improvement over the BB84 QKD protocol. BB84, in conjunction with one-time pad encryption, has been shown to be unconditionally secure. However its security relies on the assumption that the qubit source device does not emit multiple replicas of the same qubit for each transmitted bit. If this happens a multi-qubit emission attack can be launched. In addition, BB84 cannot be used to send predetermined bit strings as it generates a random bit string in the process. Our protocol does not have the above drawbacks, but requires an authenticated public channel in order to detect an intruder, in the way as BB84. Our protocol does not require a shared secret key.
We present a quantum digital signature scheme whose security is based on fundamental principles of quantum physics. It allows a sender (Alice) to sign a message in such a way that the signature can be validated by a number of different people, and all will agree either that the message came from Alice or that it has been tampered with. To accomplish this task, each recipient of the message must have a copy of Alice's "public key," which is a set of quantum states whose exact identity is known only to Alice. Quantum public keys are more difficult to deal with than classical public keys: for instance, only a limited number of copies can be in circulation, or the scheme becomes insecure. However, in exchange for this price, we achieve unconditionally secure digital signatures. Sending an m-bit message uses up O(m) quantum bits for each recipient of the public key. We briefly discuss how to securely distribute quantum public keys, and show the signature scheme is absolutely secure using one method of key distribution. The protocol provides a model for importing the ideas of classical public key cryptography into the quantum world.
Private key cryptography suffers from a major weakness - it requires sharing of a secret key between two parties. An intruder can copy the secret key as it is being exchanged, thereby severely compromising the security of the system. Thus a private key cryptographic system depends entirely on secrecy of the key. Public key cryptography does not have a key distribution problem but its security relies on the fact that determining the factors of a number that is the product of two very large prime numbers is not computationally feasible. It has been shown that a quantum computer can solve the prime factors of very large numbers in polynomial time which would otherwise take millions of years. Public key cryptography will therefore become insecure if quantum computing becomes a reality. Quantum cryptography, originally presented in BB84 protocol, avoids all these issues by encrypting the shared key using a series of photons. In this paper a key distribution protocol based on the concepts of BB84 is proposed It provides an additional layer of security by sending the key data bits twice; during the second transmission the original key bits or their complements are randomly chosen for transmission. The sender informs the receiver about the orientation of the key bits during the second round of transmission only after the data has been sent out.