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:1907.03242

Device-Independent Quantum Private Query Protocol without the Assumption of Perfect Detectors

Dandan Li, Xiaohong Huang, Wei Huang, Fei Gao

Published Jul 7, 2019• 0 citations
arXivHTMLPDF

Abstract

The first device-independent quantum private query protocol (MRT17) which is proposed by Maitra \emph{et al.} [Phys. Rev. A 95, 042344 (2017)] to enhance the security through the certification of the states and measurements. However, the MRT17 protocol works under an assumption of perfect detectors, which increases difficulty in the implementations. Therefore, it is crucial to investigate what would affect the security of this protocol if the detectors were imperfect. Meanwhile, Maitra \emph{et al.} also pointed out that this problem remains open. In this paper, we analyze the security of MRT17 protocol when the detectors are imperfect and then find that this protocol is under attack in the aforementioned case. Furthermore, we propose device-independent QPQ protocol without the assumption of perfect detectors. Compared with MRT17 protocol, our protocol is more practical without relaxing the security in the device-independent framework.

DOI
10.48550/arxiv.1907.03242

Related papers

Loss-tolerant measurement-device-independent quantum private queries

Liang-Yuan Zhao, Zhen−Qiang Yin, Wei Chen +4 more

Quantum private queries (QPQ) is an important cryptography protocol aiming to protect both the user's and database's privacy when the database is queried privately. Recently, a variety of practical QPQ protocols based on quantum key distribution (QKD) have been proposed. However, for QKD-based QPQ the user's imperfect detectors can be subjected to some detector- side-channel attacks launched by the dishonest owner of the database. Here, we present a simple example that shows how the detector-blinding attack can damage the security of QKD-based QPQ completely. To remove all the known and unknown detector side channels, we propose a solution of measurement-device-independent QPQ (MDI-QPQ) with single- photon sources. The security of the proposed protocol has been analyzed under some typical attacks. Moreover, we prove that its security is completely loss independent. The results show that practical QPQ will remain the same degree of privacy as before even with seriously uncharacterized detectors.

Scientific Reports•Jan 4, 2017•24 citations

Fully device independent quantum private query

Jyotirmoy Basak, Kaushik Chakraborty

Quantum Private Query (QPQ) is an unconditional secure mistrustful cryptographic primitive which is assumed to be a probabilistic version of the Oblivious Transfer (OT) schemes or an imperfect version of Symmetric Private Information Retrieval (SPIR) schemes. Recently, Maitra et al. (Phys. Rev. A, 2017) identified that the B92 QKD-based QPQ scheme proposed by Yang et al. (Quant. Inf. Process., 2014) is vulnerable whenever the devices involved in that scheme are dubious and to improve the overall security, they suggested a semi-Device Independent (DI) proposal for that QPQ scheme by introducing a local test at the server's end. In this work, we overcome the limitation of the Maitra et al. proposal by removing trustworthiness from all the (involved) devices, and suggest a full DI proposal for the Yang et al. scheme, exploiting a proper self-testing mechanism of observables along with the local version of the tilted CHSH game. We compare the performance of our proposal with a recent full DI-QPQ scheme (arxiv 1901.03042) and discuss their relative advantages. Additionally, we present a DI proposal for a modified version of the Yang et al. scheme, enabling the client to retrieve maximum raw key bits during the oblivious key generation phase. We evaluate the security of all our proposals with a formal analysis.

Advances in Mathematics of Communications•Mar 18, 2024•3 citations

Device Independent Quantum Private Query with Finite Number of Entangled Qubits

Jyotirmoy Basak, Bappaditya Ghosh, Arpita Maitra +1 more

In a recent work by Maitra et al. (Phys. Rev. A, 2017), it was shown that the existing Quantum Private Query (QPQ) protocols fail to maintain the database security if the entangled states shared between Alice and Bob are not of a certain form. So it is necessary to certify the states a priori. In this regard, the local CHSH test was proposed. However, the proposed scheme works perfectly for the asymptotic case when we have infinite number of qubits. In this brief report, we upgrade the protocol for finite number of qubits and connect the sample size to the success probability of CHSH test. We also perform a rigorous security analysis of the proposed protocol.

arXiv:1705.04570•May 12, 2017•0 citations

Device-independent quantum private query

Arpita Maitra, Goutam Paul, Sarbani Roy

In quantum private query (QPQ), a client obtains values corresponding to his or her query only, and nothing else from the server, and the server does not get any information about the queries. V. Giovannetti et al. [Phys. Rev. Lett. 100, 230502 (2008)] gave the first QPQ protocol and since then quite a few variants and extensions have been proposed. However, none of the existing protocols are device independent; i.e., all of them assume implicitly that the entangled states supplied to the client and the server are of a certain form. In this work, we exploit the idea of a local CHSH game and connect it with the scheme of Y. G. Yang et al. [Quantum Info. Process. 13, 805 (2014)] to present the concept of a device-independent QPQ protocol.

arXiv:1701.01087•Physical Review A•Apr 28, 2017•40 citations

Device Independent Quantum Private Queries Based on Quantum Key Distribution

Li Liu, Qingshan Du, Xu Kuo Gao

Symmetric private information retrieval (SPIR) protocol is proposed for users to retrieve items from a database holder without revealing the retrieval address, and meanwhile the users cannot learn any additional entries of the database. Quantum key distribution (QKD)-based quantum private queries (QPQs) are the most practical protocols for the SPIR problem. However, most existing protocols assume ideal devices. To overcome this drawback, we propose a device independent QPQ protocol based on QKD with imperfect sources and detectors. By constructing the semi-definite programming optimization problem, we give the CHSH test threshold and prove the correctness of our protocol. We use the shift and permutation post-processing technique to further improve the security. We compare the performance of our protocol with a recent full device-independent QPQ. and discuss their relative advantages. The simulation results show that our protocol improves database security, user privacy and efficiency. The number of final key bits that Alice knows is close to 1, and Bob’s guessing probability is below 0.15 in our protocol. Moreover, the proposed scheme can be used for any entanglement-based QPQ protocol to remove trust on the devices.

Mathematics•Mar 13, 2025•1 citation

Quantum Private Query Protocol Based on EPR Pairs

Yan Zuo Chang, Jinxin Xiong, Xiang Gao +2 more

We propose a Quantum private query (QPQ) protocol based on device-independent Quantum key distribution (QKD) by using Einstein-Podolsky-Rosen (EPR) pairs. We analyze coherent attacks by a third party in a weaker constraints (non-signaling condition) compared with the formalism of quantum physics. We deduce the relationship between the raw key bits of Alice and the third party's attack factor. Compared with existing QPQ protocols, our protocol is secure even when the source and measuring equipment used to distribute oblivious secret key can not be trusted. Quantum register is not needed in our protocol.

Chinese Journal of Electronics•Mar 1, 2018•12 citations
The first device-independent quantum private query protocol (MRT17) which is proposed by Maitra \emph{et al.} [Phys. Rev. A 95, 042344 (2017)] to enhance the security through the certification of the states and measurements. However, the MRT17 protocol works under an assumption of perfect detectors, which increases difficulty in the implementations. Therefore, it is crucial to investigate what would affect the security of this protocol if the detectors were imperfect. Meanwhile, Maitra \emph{et al.} also pointed out that this problem remains open. In this paper, we analyze the security of MRT17 protocol when the detectors are imperfect and then find that this protocol is under attack in the aforementioned case. Furthermore, we propose device-independent QPQ protocol without the assumption of perfect detectors. Compared with MRT17 protocol, our protocol is more practical without relaxing the security in the device-independent framework.
Quantum private queries (QPQ) is an important cryptography protocol aiming to protect both the user's and database's privacy when the database is queried privately. Recently, a variety of practical QPQ protocols based on quantum key distribution (QKD) have been proposed. However, for QKD-based QPQ the user's imperfect detectors can be subjected to some detector- side-channel attacks launched by the dishonest owner of the database. Here, we present a simple example that shows how the detector-blinding attack can damage the security of QKD-based QPQ completely. To remove all the known and unknown detector side channels, we propose a solution of measurement-device-independent QPQ (MDI-QPQ) with single- photon sources. The security of the proposed protocol has been analyzed under some typical attacks. Moreover, we prove that its security is completely loss independent. The results show that practical QPQ will remain the same degree of privacy as before even with seriously uncharacterized detectors.
Quantum Private Query (QPQ) is an unconditional secure mistrustful cryptographic primitive which is assumed to be a probabilistic version of the Oblivious Transfer (OT) schemes or an imperfect version of Symmetric Private Information Retrieval (SPIR) schemes. Recently, Maitra et al. (Phys. Rev. A, 2017) identified that the B92 QKD-based QPQ scheme proposed by Yang et al. (Quant. Inf. Process., 2014) is vulnerable whenever the devices involved in that scheme are dubious and to improve the overall security, they suggested a semi-Device Independent (DI) proposal for that QPQ scheme by introducing a local test at the server's end. In this work, we overcome the limitation of the Maitra et al. proposal by removing trustworthiness from all the (involved) devices, and suggest a full DI proposal for the Yang et al. scheme, exploiting a proper self-testing mechanism of observables along with the local version of the tilted CHSH game. We compare the performance of our proposal with a recent full DI-QPQ scheme (arxiv 1901.03042) and discuss their relative advantages. Additionally, we present a DI proposal for a modified version of the Yang et al. scheme, enabling the client to retrieve maximum raw key bits during the oblivious key generation phase. We evaluate the security of all our proposals with a formal analysis.
In a recent work by Maitra et al. (Phys. Rev. A, 2017), it was shown that the existing Quantum Private Query (QPQ) protocols fail to maintain the database security if the entangled states shared between Alice and Bob are not of a certain form. So it is necessary to certify the states a priori. In this regard, the local CHSH test was proposed. However, the proposed scheme works perfectly for the asymptotic case when we have infinite number of qubits. In this brief report, we upgrade the protocol for finite number of qubits and connect the sample size to the success probability of CHSH test. We also perform a rigorous security analysis of the proposed protocol.
In quantum private query (QPQ), a client obtains values corresponding to his or her query only, and nothing else from the server, and the server does not get any information about the queries. V. Giovannetti et al. [Phys. Rev. Lett. 100, 230502 (2008)] gave the first QPQ protocol and since then quite a few variants and extensions have been proposed. However, none of the existing protocols are device independent; i.e., all of them assume implicitly that the entangled states supplied to the client and the server are of a certain form. In this work, we exploit the idea of a local CHSH game and connect it with the scheme of Y. G. Yang et al. [Quantum Info. Process. 13, 805 (2014)] to present the concept of a device-independent QPQ protocol.
Symmetric private information retrieval (SPIR) protocol is proposed for users to retrieve items from a database holder without revealing the retrieval address, and meanwhile the users cannot learn any additional entries of the database. Quantum key distribution (QKD)-based quantum private queries (QPQs) are the most practical protocols for the SPIR problem. However, most existing protocols assume ideal devices. To overcome this drawback, we propose a device independent QPQ protocol based on QKD with imperfect sources and detectors. By constructing the semi-definite programming optimization problem, we give the CHSH test threshold and prove the correctness of our protocol. We use the shift and permutation post-processing technique to further improve the security. We compare the performance of our protocol with a recent full device-independent QPQ. and discuss their relative advantages. The simulation results show that our protocol improves database security, user privacy and efficiency. The number of final key bits that Alice knows is close to 1, and Bob’s guessing probability is below 0.15 in our protocol. Moreover, the proposed scheme can be used for any entanglement-based QPQ protocol to remove trust on the devices.
We propose a Quantum private query (QPQ) protocol based on device-independent Quantum key distribution (QKD) by using Einstein-Podolsky-Rosen (EPR) pairs. We analyze coherent attacks by a third party in a weaker constraints (non-signaling condition) compared with the formalism of quantum physics. We deduce the relationship between the raw key bits of Alice and the third party's attack factor. Compared with existing QPQ protocols, our protocol is secure even when the source and measuring equipment used to distribute oblivious secret key can not be trusted. Quantum register is not needed in our protocol.