Fault-Tolerant Key Distribution (Preliminary Version)

1993 ◽  
Author(s):  
Michael Reiter ◽  
Kenneth Birman ◽  
Robert van Renesse
Keyword(s):  
Fault Tolerant ◽  
Key Distribution ◽  
Preliminary Version

Fault-Tolerant Key Distribution (Preliminary Version)

1993 ◽  
Author(s):  
Michael Reiter ◽  
Kenneth Birman ◽  
Robert Van Renesse
Keyword(s):  
Fault Tolerant ◽  
Key Distribution ◽  
Preliminary Version

scholarly journals Experimental verification of fault tolerant quantum key distribution protocol

2005 ◽  
Vol 13 (23) ◽  
pp. 9415 ◽  
Author(s):  
Yun-kun Jiang ◽  
Xiang-Bin Wang ◽  
Bao-Sen Shi ◽  
Akihisa Tomita
Keyword(s):  
Experimental Verification ◽  
Quantum Key Distribution ◽  
Fault Tolerant ◽  
Key Distribution ◽  
Quantum Key Distribution Protocol

scholarly journals FAULT TOLERANT QUANTUM KEY DISTRIBUTION BASED ON QUANTUM DENSE CODING WITH COLLECTIVE NOISE

2009 ◽  
Vol 07 (08) ◽  
pp. 1479-1489 ◽  
Author(s):  
XI-HAN LI ◽  
BAO-KUI ZHAO ◽  
YU-BO SHENG ◽  
FU-GUO DENG ◽  
HONG-YU ZHOU
Keyword(s):  
Quantum Key Distribution ◽  
Fault Tolerant ◽  
Single Photon ◽  
Bell State ◽  
Key Distribution ◽  
Secret Message ◽  
Noisy Channel ◽  
Collective Noise ◽  
Dense Coding ◽  
Quantum Dense Coding

We present two robust quantum key distribution protocols against two kinds of collective noise, following some ideas in quantum dense coding. Three-qubit entangled states are used as quantum information carriers, two of which form the logical qubit, which is invariant with a special type of collective noise. The information is encoded on logical qubits with four unitary operations, which can be read out faithfully with Bell-state analysis on two physical qubits and a single-photon measurement on the other physical qubit, not three-photon joint measurements. Two bits of information are exchanged faithfully and securely by transmitting two physical qubits through a noisy channel. When the losses in the noisy channel is low, these protocols can be used to transmit a secret message directly in principle.

Flexible quantum protocol for nearest private query

2021 ◽  
pp. 2150023
Author(s):  
Aihan Yin ◽  
Ziliang Tan ◽  
Tong Chen ◽  
Weibin Lin ◽  
Qiutong Wu
Keyword(s):  
Quantum State ◽  
Private Information ◽  
Fault Tolerant ◽  
Key Distribution ◽  
Private Data ◽  
Database Size ◽  
Quantum Protocol

Nearest private query (NPQ) allows user to query which element in the database is the nearest to his private data without revealing any private information and this query is typically used for location query services. However, the previous NPQ protocol only involved the implementation of its functions and ignored the user’s private experience. In addition, the average number of key bits obtained by the user is only determined by the size of the database. In order to improve the flexibility and practicality of the protocol, we proposed a flexible protocol for nearest private query based on quantum oblivious key distribution (QOKD). The parameter [Formula: see text] was added to the prepared quantum state. The average number of the key bits Alice obtained can locate on any fixed value by adjusting the parameter [Formula: see text] whatever the database size was. In addition, our protocol is flexible and fault-tolerant.

Sign in / Sign up

Export Citation Format

Share Document