首页/论文/quant-ph/0307076

arXiv quant-ph/03070762003-07-10quant-phcs.CR

Quantum Symmetrically-Private Information Retrieval

Iordanis Kerenidis, Ronald de Wolf

备注：: 8 pages LaTeX

英文摘要：

Private information retrieval systems (PIRs) allow a user to extract an item from a database that is replicated over k>=1 servers, while satisfying various privacy constraints. We exhibit quantum k-server symmetrically-private information retrieval systems (QSPIRs) that use sublinear communication, do not use shared randomness among the servers, and preserve privacy against honest users and dishonest servers. Classically, SPIRs without shared randomness do not exist at all.

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

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

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

继续探索

相关论文

Experimental symmetric private information retrieval with measurement-device-independent quantum network

Secure information retrieval is an essential task in today's highly digitised society. In some applications, it may be necessary that user query's privacy and database content's security are enforced. For these settings, symmetric private information retrieval (SPIR) could be employed, but its implementation is known to be demanding, requiring a private key-exchange network as the base layer. Here, we report for the first time a realisation of provably-secure SPIR supported by a quantum-secure key-exchange network. The SPIR scheme looks at biometric security, offering secure retrieval of 582-b…

2021-10-06cs.CRquant-ph

Quantum Private Information Retrieval with Sublinear Communication Complexity

This note presents a quantum protocol for private information retrieval, in the single-server case and with information-theoretical privacy, that has O(\sqrt{n})-qubit communication complexity, where n denotes the size of the database. In comparison, it is known that any classical protocol must use Ω(n) bits of communication in this setting.

2011-07-29cs.CCcs.CRquant-ph

Entanglement-Resistant Two-Prover Interactive Proof Systems and Non-Adaptive Private Information Retrieval Systems

We show that, for any language in NP, there is an entanglement-resistant constant-bit two-prover interactive proof system with a constant completeness vs. soundness gap. The previously proposed classical two-prover constant-bit interactive proof systems are known not to be entanglement-resistant. This is currently the strongest expressive power of any known constant-bit answer multi-prover interactive proof system that achieves a constant gap. Our result is based on an "oracularizing" property of certain private information retrieval systems, which may be of independent interest.

2007-07-12quant-ph

可认证的次线性量子隐私信息检索

Authenticated Sublinear Quantum Private Information Retrieval

本文研究可认证的次线性 QPIR，借助量子相对熵等给出更紧通信下界，并提出单服务器、多服务器等后量子安全协议。

2025-07-26cs.CRquant-ph

Quantum Private Information Retrieval for Quantum Messages

Quantum private information retrieval (QPIR) for quantum messages is the protocol in which a user retrieves one of the multiple quantum states from one or multiple servers without revealing which state is retrieved. We consider QPIR in two different settings: the blind setting, in which the servers contain one copy of the message states, and the visible setting, in which the servers contain the description of the message states. One trivial solution in both settings is downloading all states from the servers and the main goal of this paper is to find more efficient QPIR protocols. First, we pr…

2021-01-22cs.CRquant-ph

Quantum Private Information Retrieval has linear communication complexity

In Private Information Retrieval (PIR), a client queries an n-bit database in order to retrieve an entry of her choice, while maintaining privacy of her query value. Chor, Goldreich, Kushilevitz, and Sudan showed that, in the information-theoretical setting, a linear amount of communication is required for classical PIR protocols (and thus that the trivial protocol is optimal). This linear lower bound was shown by Nayak to hold also in the quantum setting. Here, we extend Nayak's result by considering approximate privacy, and requiring security only against "specious" adversaries, which are, i…

2014-01-29quant-ph

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

Provably-secure symmetric private information retrieval with quantum cryptography

Private information retrieval (PIR) is a database query protocol that provides user privacy, in that the user can learn a particular entry of the database of his interest but his query would be hidden from the data centre. Symmetric private information retrieval (SPIR) takes PIR further by additionally offering database privacy, where the user cannot learn any additional entries of the database. Unconditionally secure SPIR solutions with multiple databases are known classically, but are unrealistic because they require long shared secret keys between the parties for secure communication and sh…

2021-01-18cs.CRcs.IRquant-ph

实用量子私有查询中用户隐私实时保护的重新审视

Reexamination of the realtime protection for user privacy in practical quantum private query

本文重新审视了量子私有查询中实时保护用户隐私的两种现有技术，发现其均存在漏洞，并给出了具体作弊策略，指出需更谨慎地处理内部参与者的诚实性检查。

2024-07-27cs.CRquant-ph

Quantum Private Information Retrieval from Coded and Colluding Servers

In the classical private information retrieval (PIR) setup, a user wants to retrieve a file from a database or a distributed storage system (DSS) without revealing the file identity to the servers holding the data. In the quantum PIR (QPIR) setting, a user privately retrieves a classical file by receiving quantum information from the servers. The QPIR problem has been treated by Song \emph{et al.} in the case of replicated servers, both without collusion and with all but one servers colluding. In this paper, the QPIR setting is extended to account for maximum distance separable (MDS) coded ser…

2020-08-07cs.CRcs.IRcs.IT

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

Capacity of Quantum Private Information Retrieval with Multiple Servers

We study the capacity of quantum private information retrieval (QPIR) with multiple servers. In the QPIR problem with multiple servers, a user retrieves a classical file by downloading quantum systems from multiple servers each of which contains the copy of a classical file set while the identity of the downloaded file is not leaked to each server. The QPIR capacity is defined as the maximum rate of the file size over the whole dimension of the downloaded quantum systems. When the servers are assumed to share prior entanglement, we prove that the QPIR capacity with multiple servers is 1 regard…

2021-01-20cs.CRcs.ITmath.IT

Capacity of Quantum Private Information Retrieval with Colluding Servers

Quantum private information retrieval (QPIR) is a protocol in which a user retrieves one of multiple files from $\mathsf{n}$ non-communicating servers by downloading quantum systems without revealing which file is retrieved. As variants of QPIR with stronger security requirements, symmetric QPIR is a protocol in which no other files than the target file are leaked to the user, and $\mathsf{t}$-private QPIR is a protocol in which the identity of the target file is kept secret even if at most $\mathsf{t}$ servers may collude to reveal the identity. The QPIR capacity is the maximum ratio of the f…

2021-04-22cs.ITmath.ITquant-ph

量子 $X$-安全 $B$-拜占庭 $T$-共谋私有信息检索

Quantum $X$-Secure $B$-Byzantine $T$-Colluding Private Information Retrieval

本文首次在量子私有信息检索中形式化定义拜占庭服务器的能力，证明其因量子编码而强于经典情形，并提出基于跨子空间对齐的方案，在某些情况下实现超密编码增益。

2024-05-07cs.CRcs.ITcs.NI

先验纠缠指数级提升用于量子消息的单服务器量子隐私信息检索

Prior Entanglement Exponentially Improves One-Server Quantum Private Information Retrieval for Quantum Messages

针对单服务器量子消息 QPIR，论文证明无先验纠缠时下载全部消息最优，并通过经典消息 QPIR 协议归约构造带先验纠缠的单轮协议，揭示通信复杂度的指数级优势。

2023-04-11quant-ph

Capacity of Quantum Private Information Retrieval with Collusion of All But One of Servers

Quantum private information retrieval (QPIR) is a protocol in which a user retrieves one of multiple classical files by downloading quantum systems from non-communicating $\mathsf{n}$ servers each of which contains a copy of all files, while the identity of the retrieved file is unknown to each server. Symmetric QPIR (QSPIR) is QPIR in which the user only obtains the queried file but no other information of the other files. In this paper, we consider the $(\mathsf{n} - 1)$-private QSPIR in which the identity of the retrieved file is secret even if any $\mathsf{n} - 1$ servers collude, and deri…

2021-02-01cs.ITmath.ITquant-ph

High-Rate Quantum Private Information Retrieval with Weakly Self-Dual Star Product Codes

In the classical private information retrieval (PIR) setup, a user wants to retrieve a file from a database or a distributed storage system (DSS) without revealing the file identity to the servers holding the data. In the quantum PIR (QPIR) setting, a user privately retrieves a classical file by receiving quantum information from the servers. The QPIR problem has been treated by Song et al. in the case of replicated servers, both with and without collusion. QPIR over $[n,k]$ maximum distance separable (MDS) coded servers was recently considered by Allaix et al., but the collusion was essential…

2021-05-10cs.IRcs.ITmath.IT

编码存储系统中的量子私有信息检索

Quantum Private Information Retrieval from Coded Storage Systems

本文针对查询与存储为经典、服务器响应为量子的QPIR场景，结合经典PIR协议与量子通信算法，提出适用于编码存储的QPIR协议，证明其通信开销低于经典方案。

2023-12-10cs.IRquant-ph

On the Capacity of Quantum Private Information Retrieval from MDS-Coded and Colluding Servers

In quantum private information retrieval (QPIR), a user retrieves a classical file from multiple servers by downloading quantum systems without revealing the identity of the file. The QPIR capacity is the maximal achievable ratio of the retrieved file size to the total download size. In this paper, the capacity of QPIR from MDS-coded and colluding servers is studied for the first time. Two general classes of QPIR, called stabilizer QPIR and dimension-squared QPIR induced from classical strongly linear PIR are defined, and the related QPIR capacities are derived. For the non-colluding case, the…

2021-11-08cs.IRcs.ITmath.IT