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

International Journal of Information Security

A t-private k-database information retrieval scheme

Carlo Blundo, Paolo D’Arco, Alfredo De Santis

Published Aug 1, 2001• 8 citations
Publisher
DOI
10.1007/s102070100005

Related papers

Fast Single-Database Private Information Retrieval With Lattices

Carlos Aguilar Melchor, Philippe Gaborit

•Jul 4, 2007•0 citations

Single Database Private Information Retrieval Implies Oblivious Transfer

Giovanni Di Crescenzo, Tal Malkin, Rafail Ostrovsky

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

Single Database Private Information Retrieval with Logarithmic Communication

Yan-Cheng Chang

Lecture notes in computer science•Jan 1, 2004•165 citations

Efficient and Generic Methods to Achieve Active Security in Private Information Retrieval and More Advanced Database Search

Reo Eriguchi, Kaoru Kurosawa, Koji Nuida

Lecture notes in computer science•Jan 1, 2024•1 citation

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

Towards Practical Private Information Retrieval

Robert Huijie Deng

•Jan 1, 2006•4 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.