Practical private database queries based on a quantum-key-distribution protocol

Jakobi, Markus; Simon, Christoph; Gisin, Nicolas; Bancal, Jean-Daniel; Branciard, Cyril; Walenta, Nino; Zbinden, Hugo

doi:10.1103/physreva.83.022301

Cited by 200 publications

(176 citation statements)

References 21 publications

Supporting

Mentioning

176

Contrasting

Order By: Relevance

“…[11], there is a measurement called minimal error probability measurement [17], which distinguishes two equally likely qubits. If Alice measures the k qubits forming an element of the final key K with the efficient measurement, she obtains the bits of K directly.…”

Section: Database Securitymentioning

confidence: 99%

Quantum Private Query Protocol Based on Two Non-Orthogonal States

Chang

Zhang

Han

et al. 2016

Entropy

View full text Add to dashboard Cite

Abstract:We propose a loss tolerant quantum private query (QPQ) protocol based on two non-orthogonal states and unambiguous state discrimination (USD) measurement. By analyzing a two-point attack by a third party, we find that our protocol has a stronger ability to resist external attacks than G-protocol and Y-protocol. Our protocol requires a smaller number of compressions than that in G-protocol (Gao et al., Opt. Exp. 2012, 20, 17411-17420) and Y-protocol (Yan et al. Quant. Inf. Process. 2014, 13, 805-813), which means less post-processing. Our protocol shows better database security and user privacy compared with G-protocol.

show abstract

Section: Database Securitymentioning

confidence: 99%

Quantum Private Query Protocol Based on Two Non-Orthogonal States

Chang

Zhang

Han

et al. 2016

Entropy

View full text Add to dashboard Cite

show abstract

“…Furthermore, with the rapid development of the technologies of quantum communication and quantum computation, researchers began to consider quantum methods to solve privacy-preserving problems, such as blind quantum computing [1][2][3][4][5], quantum homornorphic encryption [6], quantum private query [7][8][9][10], quantum bit commitment [11][12][13][14], quantum oblivious transfer [15][16][17] and so on.…”

Section: Introductionmentioning

confidence: 99%

Quantum oblivious set-member decision protocol

Shi

Zhong

et al. 2015

Phys. Rev. A

View full text Add to dashboard Cite

We present and define a privacy-preserving problem called the oblivious set-member decision problem, which allows a server to decide whether a private secret of a user is a member of his private set in an oblivious manner. Namely, if the secret belongs to his private set, he does not know which member it is. We propose a quantum solution to the oblivious set-member decision problem. Compared to classical solutions, the proposed quantum protocol achieves an exponential reduction in communication complexity, since it only needs O (1) We present and define a new privacy-preserving problem, called Oblivious Set-member Decision problem, which allows a server to decide whether a private secret of a user is a member of his private set in an oblivious manner. Namely, if the secret belongs to his private set, he doesn't know which member it is. We propose a quantum solution to the Oblivious Set-member Decision problem. Compared to classical solutions, the proposed quantum protocol achieves an exponential reduction in communication complexity, since it only needs (1) communication cost.

show abstract

“…Hence, a cheating Alice has non-zero probability to be detected. These protocols are called cheat sensitive [4,57,118,119,132,137]. In this context, it is argued that one could set up a game-theoretic environment: a player caught cheating has to pay a huge fine (or undergo another punishment) and is therefore deterred from actually doing it.…”

Section: Quantum Protocols For Coin Flipping and Cheat-sensitive Primmentioning

confidence: 99%

Quantum cryptography beyond quantum key distribution

Broadbent

Schaffner

2015

Des. Codes Cryptogr.

187

112

View full text Add to dashboard Cite

Quantum cryptography is the art and science of exploiting quantum mechanical effects in order to perform cryptographic tasks. While the most well-known example of this discipline is quantum key distribution (QKD), there exist many other applications such as quantum money, randomness generation, secure two-and multi-party computation and delegated quantum computation. Quantum cryptography also studies the limitations and challenges resulting from quantum adversaries-including the impossibility of quantum bit commitment, the difficulty of quantum rewinding and the definition of quantum security models for classical primitives. In this review article, aimed primarily at cryptographers unfamiliar with the quantum world, we survey the area of theoretical quantum cryptography, with an emphasis on the constructions and limitations beyond the realm of QKD.

show abstract

Practical private database queries based on a quantum-key-distribution protocol

Cited by 200 publications

References 21 publications

Quantum Private Query Protocol Based on Two Non-Orthogonal States

Quantum Private Query Protocol Based on Two Non-Orthogonal States

Quantum oblivious set-member decision protocol

Quantum cryptography beyond quantum key distribution

Contact Info

Product

Resources

About