This research aims to review the developments in the field of quantum private query (QPQ), a type of practical quantum cryptographic protocol. The primary protocol, as proposed by Jacobi et al., and the improvements in the protocol are introduced. Then, the advancements made in sability, theoretical security, and practical security are summarized. Additionally, we describe two new results concerning QPQ security. We emphasize that a procedure to detect outside adversaries is necessary for QPQ, as well as for other quantum secure computation protocols, and then briefly propose such a strategy. Furthermore, we show that the shift-and-addition or low-shift-and-addition technique can be used to obtain a secure real-world implementation of QPQ, where a weak coherent source is used instead of an ideal single-photon source.

https://link.springer.com/content/pdf/10.1007/s11433-018-9324-6.pdf

Quantum private query: A new kind of practical quantum cryptographic protocol

The security of classical cryptography based on computational complexity assumptions has been severely challenged with the rapid development of quantum computers and quantum algorithms. Quantum cryptography, which offers unconditional security based on some principles of quantum mechanics, has become a significant branch and hotspot in the field of modern cryptography research. In this paper, we review the research and development of several important and well-studied branches of quantum cryptography in terms of theory and experiment, including quantum key distribution, quantum secret sharing, quantum secure direct communication, quantum signature, and quantum private query. We also briefly review the research and development of some other branches which are currently in the stage of theoretical research but receive widespread concern from academia, including quantum private comparison, quantum anonymous voting, quantum secure multi-party summation, quantum sealed-bid auction, quantum public key cryptosystem, quantum key agreement, quantum dialogue, and quantum identity authentication. In addition, we discuss some open issues and future research directions for the branches referred to above.

Survey on quantum information security

Multiparty quantum communication ensures information-theoretic security for transmitting private information among multiuser networks. In principle, measurement-device-independent (MDI) techniques can close all detection loopholes while usually utilizing large amounts of quantum resources in basis reconciliation. We propose a three-party MDI quantum secret sharing (QSS) protocol that is secure against all detection attacks and does not require any basis reconciliation, avoiding the corresponding waste arising from it. The proposed protocol allows a sender to divide a private message into two parts and send those parts to different receivers in a deterministic way. The message can only be read through cooperation between the two receivers. Finally, we discuss the generalized extension of a multiparty QSS protocol.

Deterministic measurement-device-independent quantum secret sharing

Decoy-state method for quantum-key-distribution-based quantum private query

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.

Device Independent Quantum Private Query

We present a device-independent quantum secret sharing scheme in arbitrary even dimension. We propose a $d$-dimensional $N$-partite linear game, utilizing a generic multipartite higher-dimensional Bell inequality, a generalization of Mermin's inequality in a higher dimension. The probability of winning this linear game defines the device-independence test in the proposed scheme. The security is proved under a causal independence assumption on measurement devices and it is based on the polygamy property of entanglement. By defining ${\ensuremath{\epsilon}}_{\mathrm{cor}}$ correctness and ${\ensuremath{\epsilon}}^{c}$ completeness for a quantum secret sharing scheme, we also show that the proposed scheme is ${\ensuremath{\epsilon}}_{\mathrm{cor}}$ correct and ${\ensuremath{\epsilon}}^{c}$ complete.

Device-independent quantum secret sharing in arbitrary even dimensions

Measurement-Device-Independent Quantum Private Query (MDI QPQ) with qutrits is presented. We compare the database security and client’s privacy in MDI QPQ for qubits with qutrits. For some instance...

Measurement-device-independent quantum private query with qutrits

Measurement Device Independent Quantum Private Query (MDI QPQ) with qutrits is presented. We identified that this variant of QPQ protocol resists the optimization of both database security and client's privacy simultaneously. We compare the database security and client's privacy in MDI QPQ for qubits with qutrits. For some instances, we observe that qutrit will provide better security for database than qubit. However, when it comes to the question of client's privacy qubit will provide better security than qutrit. Hence we conclude that though in case of Quantum Key Distribution (QKD) higher dimension provides better security but in case of QPQ this is not obvious.

A Note on Measurement Device Independent Quantum Private Query with Qutrits

Quantum secret sharing (QSS) is an important branch of secure multiparty quantum computation. Several schemes for (n, n) threshold QSS based on quantum Fourier transformation (QFT) have been proposed. Inspired by the flexibility of (t, n) threshold schemes, Song {\\it et al.} (Scientific Reports, 2017) have proposed a (t, n) threshold QSS utilizing QFT. Later, Kao and Hwang (arXiv:1803.00216) have identified a {loophole} in the scheme but have not suggested any remedy. In this present study, we have proposed a (t, n)threshold QSS scheme to share a d dimensional classical secret. This scheme can be implemented using local operations (such as QFT, generalized Pauli operators and local measurement) and classical communication. Security of the proposed scheme is described against outsider and participants' eavesdropping.

Sarbani Roy

Papers

Device Independent Quantum Private Query

Device-independent quantum secret sharing in arbitrary even dimensions

Measurement-device-independent quantum private query with qutrits

A Note on Measurement Device Independent Quantum Private Query with Qutrits

(t,n) Threshold d-level QSS based on QFT