Efficient DPF-based Error-Detecting Information-Theoretic Private Information Retrieval Over Rings
Pengzhen Ke, Liang Feng Zhang, Huaxiong Wang, Li-Ping Wang

TL;DR
This paper introduces a ring-based ED-PIR scheme using prime-power-order DPFs, significantly reducing key sizes and communication overhead, thus enhancing efficiency and practicality for large-scale, high-security applications.
Contribution
It proposes a novel ring-based ED-PIR scheme utilizing prime-power DPFs, overcoming finite field limitations and reducing communication overhead without sacrificing privacy.
Findings
Reduces key size growth compared to prime-field schemes.
Halves query communication overhead with single DPF key.
Enables efficient, high-security private data retrieval in distributed systems.
Abstract
Authenticated private information retrieval (APIR) is the state-of-the-art error-detecting private information retrieval (ED-PIR), using Distributed Point Functions (DPFs) for subpolynomial complexity and privacy. However, its finite field structure restricts it to prime-order DPFs, leading to prohibitively large key sizes under information-theoretic settings, while its dual-DPF-key design introduces unnecessary communication overhead, limiting its practicality for large-scale deployments. This paper proposes a novel ring-based information-theoretic ED-PIR (itED-PIR) scheme that overcomes these limitations by leveraging prime-power-order information-theoretic DPFs (itDPFs). Built over a prime-power ring, the proposed scheme breaks APIR's field-induced constraint to enable more efficient DPF utilization, significantly reducing key size growth and rendering the scheme feasible for…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
