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

Device Independent Quantum Private Query with Finite Number of Entangled Qubits

Jyotirmoy Basak, Bappaditya Ghosh, Arpita Maitra, Paul, and Goutam

Published May 12, 2017• 0 citations
arXivHTMLPDF

Abstract

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.

DOI
10.48550/arxiv.1705.04570

Related papers

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

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 Query Protocol without the Assumption of Perfect Detectors

Dandan Li, Xiaohong Huang, Wei Huang +1 more

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.

arXiv:1907.03242•Jul 7, 2019•0 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

Proposal for dimensionality testing in QPQ

Arpita Maitra, Bibhas Adhikari, Satyabrata Adhikari

Recently, dimensionality testing of a quantum state has received extensive attention (Ac{\'i}n et al. Phys. Rev. Letts. 2006, Scarani et al. Phys. Rev. Letts. 2006). Security proofs of existing quantum information processing protocols rely on the assumption about the dimension of quantum states in which logical bits are encoded. However, removing such assumption may cause security loophole. In the present paper, we show that this is indeed the case. We choose two players' quantum private query protocol by Yang et al. (Quant. Inf. Process. 2014) as an example and show how one player can gain an unfair advantage by changing the dimension of subsystem of a shared quantum system. To resist such attack we propose dimensionality testing in a different way. Our proposal is based on CHSH like game. As we exploit CHSH like game, it can be used to test if the states are product states for which the protocol becomes completely vulnerable.

arXiv:1805.08172•Quantum Information and Computation•Nov 1, 2018•1 citation

Practical quantum private query based on Bell state

Tao Zheng, Shibin Zhang, Xiang Gao +1 more

Quantum private query (QPQ) is a cryptographic application that protects the privacy of both users and databases while querying the database secretly. In most existing QPQ protocols, the protection of user privacy can only be cheat-sensitive. Cheat-sensitive means that Bob will be found later with a certain probability if he tries to get the address queried by Alice. On the premise of cheat-sensitivity, although Alice can discover Bob’s malicious behavior after a query (transaction), the secret information of Alice was leaked in the completed query, which is likely to be a fatal blow to Alice. Or, to prevent Bob’s malicious behavior, Alice executes one or more additional queries to test Bob’s honesty. However, to bypass Alice’s honesty test, Bob can also provide several honest queries before performing dishonest queries. Therefore, cheat-sensitive should not be the ultimate goal of user privacy protection in QPQ. In this paper, we propose a practical QKD-based QPQ protocol with better user privacy protection than cheat-sensitivity based on order rearrangement of qubits. The proposed QPQ protocol can resist the Trojan horse attack even without wavelength filter and photon number splitter (PNS) equipped with auxiliary monitoring detectors.

Modern Physics Letters A•Jun 14, 2019•15 citations
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.
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 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.
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.
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.
Recently, dimensionality testing of a quantum state has received extensive attention (Ac{\'i}n et al. Phys. Rev. Letts. 2006, Scarani et al. Phys. Rev. Letts. 2006). Security proofs of existing quantum information processing protocols rely on the assumption about the dimension of quantum states in which logical bits are encoded. However, removing such assumption may cause security loophole. In the present paper, we show that this is indeed the case. We choose two players' quantum private query protocol by Yang et al. (Quant. Inf. Process. 2014) as an example and show how one player can gain an unfair advantage by changing the dimension of subsystem of a shared quantum system. To resist such attack we propose dimensionality testing in a different way. Our proposal is based on CHSH like game. As we exploit CHSH like game, it can be used to test if the states are product states for which the protocol becomes completely vulnerable.
Quantum private query (QPQ) is a cryptographic application that protects the privacy of both users and databases while querying the database secretly. In most existing QPQ protocols, the protection of user privacy can only be cheat-sensitive. Cheat-sensitive means that Bob will be found later with a certain probability if he tries to get the address queried by Alice. On the premise of cheat-sensitivity, although Alice can discover Bob’s malicious behavior after a query (transaction), the secret information of Alice was leaked in the completed query, which is likely to be a fatal blow to Alice. Or, to prevent Bob’s malicious behavior, Alice executes one or more additional queries to test Bob’s honesty. However, to bypass Alice’s honesty test, Bob can also provide several honest queries before performing dishonest queries. Therefore, cheat-sensitive should not be the ultimate goal of user privacy protection in QPQ. In this paper, we propose a practical QKD-based QPQ protocol with better user privacy protection than cheat-sensitivity based on order rearrangement of qubits. The proposed QPQ protocol can resist the Trojan horse attack even without wavelength filter and photon number splitter (PNS) equipped with auxiliary monitoring detectors.