entropy-logo

Journal Browser

Journal Browser

Private Information Retrieval and Its Applications

A Special Issue of Entropy (ISSN 1099-4300) belonging to the section "Information Theory, Probability and Statistics".

Deadline for manuscript submissions: 31 December 2026 | Viewed by 961

Editors


E-Mail Website
Guest Editor
School of Engineering and Applied Sciences, Harvard University, Cambridge, MA, USA
Interests: information theory; coding theory; differential privacy; trustworthy AI

grade E-Mail Website
Guest Editor
Electrical Engineering and Computer Science, University of California Irvine, Irvine, CA 92697-2625, USA
Interests: capacity of wireless networks; private/secure/coded/distributed storage/retrieval/computation; network coding; network information theory; quantum information theory
Special Issues, Collections and Topics in MDPI journals

Special Issue Information

Dear Colleagues,

In many domains that involve sensitive information—such as medicine, finance, and defense—users often need to access information without revealing their requirements or interests. Private Information Retrieval (PIR) provides a rigorous framework for this setting: it allows a user to download one item of interest from a collection of items that are replicated in a set of non-colluding databases, while ensuring that the identity of the requested item remains hidden. Classic examples include an investor retrieving specific stock records without signaling possible investment moves, or an inventor querying patent databases without disclosing the direction of their own work prior to publication. By protecting the user’s intent, PIR serves as a cornerstone primitive for privacy-preserving data access. 

PIR has been extensively studied from an information-theoretic perspective, with a central focus on characterizing its capacity and developing capacity-achieving schemes. These results play a role analogous to Shannon’s channel capacity in communication theory: they establish the fundamental performance limits of PIR protocols. The classical PIR model has been extended in multiple directions: (i) stronger adversary settings, including colluding, adversarial, or eavesdropping servers; (ii) alternative storage models such as coded PIR and single-database PIR; (iii) variants with additional privacy or communication requirements, including symmetric PIR and PIR with side information; and (iv) quantum PIR, which explores new trade-offs with quantum communication. More recently, PIR concepts have also been applied in machine learning, for tasks like private federated learning, private nearest-neighbor search, and privacy-preserving inference. 

Building on these advances, this Special Issue aims to showcase the latest developments in PIR. We invite contributions that explore novel constructions under diverse threat and storage models, new capacity results, and emerging applications that connect PIR to modern data-driven systems. The goal is to provide a platform for exchanging ideas that will shape the future directions of PIR research and its role in enabling privacy-preserving technologies.

Dr. Sajani Vithana
Prof. Dr. Syed A. Jafar
Guest Editors

Manuscript Submission Information

Manuscripts should be submitted online at www.mdpi.com by registering and logging in to this website. Once you are registered, click here to go to the submission form. Manuscripts can be submitted until the deadline. All submissions that pass pre-check are peer-reviewed. Accepted papers will be published continuously in the journal (as soon as accepted) and will be listed together on the special issue website. Research articles, review articles as well as short communications are invited. For planned papers, a title and short abstract (about 250 words) can be sent to the Editorial Office for assessment.

Submitted manuscripts should not have been published previously, nor be under consideration for publication elsewhere (except conference proceedings papers). All manuscripts are thoroughly refereed through a single-anonymized peer-review process. A guide for authors and other relevant information for submission of manuscripts is available on the Instructions for Authors page. Entropy is an international peer-reviewed open access monthly journal published by MDPI.

Please visit the Instructions for Authors page before submitting a manuscript. The Article Processing Charge (APC) for publication in this open access journal is 2600 CHF (Swiss Francs). Submitted papers should be well formatted and use good English. Authors may use MDPI's English editing service prior to publication or during author revisions.

Keywords

  • private information retrieval
  • capacity-achieving schemes
  • threat models
  • quantum pir
  • privacy-preserving machine learning
  • private distributed computations

Benefits of Publishing in a Special Issue

  • Ease of navigation: Grouping papers by topic helps scholars navigate broad scope journals more efficiently.
  • Greater discoverability: Special Issues support the reach and impact of scientific research. Articles in Special Issues are more discoverable and cited more frequently.
  • Expansion of research network: Special Issues facilitate connections among authors, fostering scientific collaborations.
  • External promotion: Articles in Special Issues are often promoted through the journal's social media, increasing their visibility.
  • Reprint: MDPI Books provides the opportunity to republish successful Special Issues in book format, both online and in print.

Further information on MDPI's Special Issue policies can be found here.

Published Papers (1 paper)

Order results
Result details
Select all
Export citation of selected articles as:

Research

29 pages, 2602 KB  
Article
Fault-Tolerant Private Information Retrieval via Threshold Distributed Point Functions
by Dazeng Yuan, Xiheng Liu and Bin Liu
Entropy 2026, 28(9), 945; https://doi.org/10.3390/e28090945 - 23 Aug 2026
Viewed by 190
Abstract
Multi-server private information retrieval (PIR) based on function secret sharing (FSS) has emerged as a prominent paradigm for achieving sublinear communication. However, standard FSS constructions require full server participation, making them highly vulnerable to single-node fail-stop faults. Existing fault-tolerant schemes mitigate this but [...] Read more.
Multi-server private information retrieval (PIR) based on function secret sharing (FSS) has emerged as a prominent paradigm for achieving sublinear communication. However, standard FSS constructions require full server participation, making them highly vulnerable to single-node fail-stop faults. Existing fault-tolerant schemes mitigate this but inevitably inflate the response overhead to scale with the database size N (e.g., O(N)). To overcome this limitation, we propose a fault-tolerant PIR (FT-PIR) protocol based on a newly designed (t,p)-threshold distributed point function (FT-DPF). By introducing a hierarchical recursive patching mechanism, our scheme transforms rigid all-party evaluations into flexible t-out-of-p reconstructions. This architecture completely decouples the response communication from N and ensures efficient client-side reconstruction via lightweight XOR aggregations. Formal analysis proves that our stateless protocol guarantees (t1)-computational privacy under the semi-honest model. Theoretical analysis demonstrates that the proposed FT-PIR achieves a response complexity bounded by O(Fmaxlevel(t,p)). Comprehensive experimental evaluations confirm that our implementation significantly reduces practical communication and computation overheads, outperforming the state-of-the-art scheme. Full article
(This article belongs to the Special Issue Private Information Retrieval and Its Applications)
Show Figures

Figure 1

Back to TopTop