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:quant-ph/0307076 · Information Processing Letters

Quantum symmetrically-private information retrieval

Iordanis Kerenidis, Ronald de Wolf

Published Mar 12, 2004• 61 citations
arXivHTMLPDF
DOI
10.1016/j.ipl.2004.02.003

Related papers

Symmetrically Private Information Retrieval

Sanjeev Kumar Mishra, Palash Sarkar

Lecture notes in computer science•Jan 1, 2000•37 citations

Quantum Oblivious Transfer Based on a Quantum Symmetrically Private Information Retrieval Protocol

Yu‐Guang Yang, Si-Jia Sun, Yan Wang

International Journal of Theoretical Physics•Aug 8, 2014•18 citations

Authenticated sublinear quantum private information retrieval

Fengxia Liu, Zhiyong Zheng, Oleksiy Zhedanov +5 more

arXiv:2504.04041•Quantum Information Processing•Dec 15, 2025•0 citations

Post-Quantum Cheating Detectable Private Information Retrieval

Lin Zhu, Changlu Lin, Fuchun Lin +1 more

IFIP advances in information and communication technology•Jan 1, 2022•5 citations

Quantum private information retrieval with lattice-based access authentication

Hao Jia, Yu‐Guang Yang, Guang‐Bao Xu +4 more

Quantum Information Processing•May 21, 2025•4 citations

Storage Constrained Information Theoretic Symmetric Private Information Retrieval

Deepak Kumar

Private information retrieval (PIR) is an important protocol in cryptographic community to ensure privacy of the user when retrieving information from untrusted databases. In a variation to this problem, symmetric private information retrieval (SPIR) is a protocol which ensures the privacy of user as well as databases. A major drawback for the majority of existing works on information theoretic PIR and SPIR is that they focus on scenarios where all databases store the entire data set (i.e. replicated databases). The goal of this thesis is to present PIR and SPIR schemes for storage constrained databases. For both PIR and SPIR, we present a systematic approach to utilize storage constrained databases. The technical contribution involves two main parts: (a) a careful storage scheme to split and store messages across databases; and (b) construction of information theoretic PIR and SPIR schemes from such databases. We also compare our results to the fully replicated scenario, as well as compare the differences between the communication overhead of PIR and SPIR schemes.

•Jun 25, 2018•0 citations
Private information retrieval (PIR) is an important protocol in cryptographic community to ensure privacy of the user when retrieving information from untrusted databases. In a variation to this problem, symmetric private information retrieval (SPIR) is a protocol which ensures the privacy of user as well as databases. A major drawback for the majority of existing works on information theoretic PIR and SPIR is that they focus on scenarios where all databases store the entire data set (i.e. replicated databases). The goal of this thesis is to present PIR and SPIR schemes for storage constrained databases. For both PIR and SPIR, we present a systematic approach to utilize storage constrained databases. The technical contribution involves two main parts: (a) a careful storage scheme to split and store messages across databases; and (b) construction of information theoretic PIR and SPIR schemes from such databases. We also compare our results to the fully replicated scenario, as well as compare the differences between the communication overhead of PIR and SPIR schemes.