arXiv 0709.45022007-09quant-ph

Private Database Queries Using Quantum States with Limited Coherence Times

Tad Hogg, Li Zhang

备注：: extended to generalized (POVM) measurements
发表信息：: Intl J. of Quantum Information 7(2):459-474 (2009)
DOI：: 10.1142/S0219749909005249

英文摘要：

We describe a method for private database queries using exchange of quantum states with bits encoded in mutually incompatible bases. For technology with limited coherence time, the database vendor can announce the encoding after a suitable delay to allow the user to privately learn one of two items in the database without the ability to also definitely infer the second item. This quantum approach also allows the user to choose to learn other functions of the items, such as the exclusive-or of their bits, but not to gain more information than equivalent to learning one item, on average. This method is especially useful for items consisting of a few bits by avoiding the substantial overhead of conventional cryptographic approaches.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Practical private database queries based on a quantum key distribution protocol

Private queries allow a user Alice to learn an element of a database held by a provider Bob without revealing which element she was interested in, while limiting her information about the other elements. We propose to implement private queries based on a quantum key distribution protocol, with changes only in the classical post-processing of the key. This approach makes our scheme both easy to implement and loss-tolerant. While unconditionally secure private queries are known to be impossible, we argue that an interesting degree of security can be achieved, relying on fundamental physical prin…

2010-09-09quant-ph

Quantum Private Queries 的概率版本

Probabilistic versions of Quantum Private Queries

本文正式定义了量子私有查询的两个非确定性版本，证明其最强变体与量子比特承诺等协议形式等价，据此表明实现无条件安全的强概率量子私有查询是不切实际的。

2024-01-11quant-ph

Experimental Quantum Private Queries with linear optics

The Quantum Private Query is a quantum cryptographic protocol to recover information from a database, preserving both user and data privacy: the user can test whether someone has retained information on which query was asked, and the database provider can test the quantity of information released. Here we introduce a new variant Quantum Private Query algorithm which admits a simple linear optical implementation: it employs the photon's momentum (or time slot) as address qubits and its polarization as bus qubit. A proof-of-principle experimental realization is implemented.

2009-07-16quant-ph

Quantum private queries

We propose a cheat sensitive quantum protocol to perform a private search on a classical database which is efficient in terms of communication complexity. It allows a user to retrieve an item from the server in possession of the database without revealing which item she retrieved: if the server tries to obtain information on the query, the person querying the database can find it out. Furthermore our protocol ensures perfect data privacy of the database, i.e. the information that the user can retrieve in a single queries is bounded and does not depend on the size of the database. With respect …

2007-10-11quant-ph

Quantum Private Queries: security analysis

We present a security analysis of the recently introduced Quantum Private Query (QPQ) protocol. It is a cheat sensitive quantum protocol to perform a private search on a classical database. It allows a user to retrieve an item from the database without revealing which item was retrieved, and at the same time it ensures data privacy of the database (the information that the user can retrieve in a query is bounded and does not depend on the size of the database). The security analysis is based on information-disturbance tradeoffs which show that whenever the provider tries to obtain information …

2008-09-11quant-ph

Flexible quantum private queries based on quantum key distribution

We present a flexible quantum-key-distribution-based protocol for quantum private queries. Similar to M. Jakobi et al's protocol [Phys. Rev. A 83, 022301 (2011)], it is loss tolerant, practical and robust against quantum memory attack. Furthermore, our protocol is more flexible and controllable. We show that, by adjusting the value of $θ$, the average number of the key bits Alice obtains can be located on any fixed value the users wanted for any database size. And the parameter $k$ is generally smaller (even $k=1$ can be achieved) when $θ<π/4$, which implies lower complexity of both quantum an…

2011-11-07quant-ph

更多相关论文收起更多论文

Performing private database queries in a real-world environment using a quantum protocol

In the well-studied cryptographic primitive 1-out-of-N oblivious transfer, a user retrieves a single element from a database of size N without the database learning which element was retrieved. While it has previously been shown that a secure implementation of 1-out-of-N oblivious transfer is impossible against arbitrarily powerful adversaries, recent research has revealed an interesting class of private query protocols based on quantum mechanics in a cheat sensitive model. Specifically, a practical protocol does not need to guarantee that database cannot learn what element was retrieved if do…

2013-10-16quant-ph

Maximal Privacy Without Coherence

Privacy lies at the fundament of quantum mechanics. A coherently transmitted quantum state is inherently private. Remarkably, coherent quantum communication is not a prerequisite for privacy: there are quantum channels that are too noisy to transmit any quantum information reliably that can nevertheless send private classical information. Here, we ask how much private classical information a channel can transmit if it has little quantum capacity. We present a class of channels N_d with input dimension d^2, quantum capacity Q(N_d) <= 1, and private capacity P(N_d) = log d. These channels asympt…

2014-02-05quant-ph

Maximum privacy without coherence, zero-error

We study the possible difference between the quantum and the private capacities of a quantum channel in the zero-error setting. For a family of channels introduced by arXiv:1312.4989, we demonstrate an extreme difference: the zero-error quantum capacity is zero, whereas the zero-error private capacity is maximum given the quantum output dimension.

2015-09-03quant-ph

量子私有查询的不可能性

Impossibility of Quantum Private Queries

Lucerne School of Computer Science and Information Technology, Lucerne University of Applied Sciences and Arts（卢塞纳应用科学与艺术大学计算机科学与信息技术学院）；Ergon Informatik AG（Ergon信息科技股份公司）

研究量子私有查询问题时，针对对作弊敏感的对称私有信息检索协议给出明确攻击方法，证明对用户安全的协议无法为数据库所有者提供非平凡安全保证。

2026-07-21cs.CRquant-ph

Post-processing of the oblivious key in quantum private queries

Quantum private query (QPQ) is a kind of quantum protocols to protect both users' privacy in their communication. There is an interesting example, that is, Alice wants to buy one item from Bob's database, which is composed of a quantity of valuable messages. QPQ protocol is the communication procedure ensuring that Alice can get only one item from Bob, and at the same time, Bob cannot know which one was taken by Alice. Owing to its practicability, quantum-key-distribution-based QPQ has draw much attention in recent years. However, the post-processing of the key in such protocols, called oblivi…

2014-06-03cs.CRquant-ph

隐蔽量子学习：从量子数据中私密且可验证地学习

Covert Quantum Learning: Privately and Verifiably Learning from Quantum Data

California Institute of Technology（加州理工学院）；University of Warwick（沃里克大学）；Morgan Stanley Machine Learning Research（摩根士丹利机器学习研究）；Columbia University（哥伦比亚大学）

本文提出量子学习中的隐蔽可验证模型，在无计算假设下实现策略与目标隐私，证明Forrelation和Simon问题的量子优势在隐蔽约束下依然成立。

2025-10-08cs.CRcs.LGquant-ph

The private classical capacity with a symmetric side channel and its application to quantum cryptography

We study the symmetric-side-channel-assisted private capacity of a quantum channel, for which we provide a single-letter formula. This capacity is additive, convex, and, for degradable channels, equal to the unassisted private capacity. While a channel's (unassisted) capacity for for private classical communication may be strictly larger than its quantum capacity, we will show that these capacities are equal for degradable channels, thus demonstrating the equivalence of privacy and quantum coherence in this context. We use these ideas to find new bounds on the key rate of quantum key distribut…

2007-05-25quant-ph

在量子计算机上使用差分隐私回答计数查询

Answering Counting Queries with Differential Privacy on a Quantum Computer

研究在量子编码数据集上使用差分隐私回答计数查询的方法，分析两种算法的隐私属性，并提出差分隐私的量子幅值估计算法。

2026-04-13cs.CRquant-ph

隐私量子数据库

Private Quantum Database

该研究提出一种利用量子力学保护数据隐私和用户隐私的量子数据库，通过量子随机访问码和互不偏倚基实现高效隐私保障。

2025-11-22cs.DBquant-ph

Improved Lower Bounds for Locally Decodable Codes and Private Information Retrieval

We prove new lower bounds for locally decodable codes and private information retrieval. We show that a 2-query LDC encoding n-bit strings over an l-bit alphabet, where the decoder only uses b bits of each queried position of the codeword, needs code length m = exp(Omega(n/(2^b Sum_{i=0}^b {l choose i}))) Similarly, a 2-server PIR scheme with an n-bit database and t-bit queries, where the user only needs b bits from each of the two l-bit answers, unknown to the servers, satisfies t = Omega(n/(2^b Sum_{i=0}^b {l choose i})). This implies that several known PIR schemes are close to optimal. Our …

2005-05-19cs.CCcs.CRquant-ph