2-server PIR with sub-polynomial communication

DOI10.1145/2746539.2746546MaRDI QIDQ6829053zbMATH OpenFDO

Authors Zeev Dvir, Sivakanth Gopi

Publication date 21 August 2015

Published in Proceedings of the forty-seventh annual ACM symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2746539.2746546

zbMATH Keywords

locally decodable codesprivate information retrieval

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Decoding (94B35)

Cited in

(7)

• Single server private information retrieval protocols with codes over rings
• Plinko: single-server PIR with efficient updates via invertible PRFs
• Efficient information-theoretic distributed point functions with general output groups
• Simplified PIR and CDS protocols and improved linear secret-sharing schemes
• Cryptography with weak privacy
• Violating constant degree hypothesis requires breaking symmetry
• Information-theoretic random-index PIR

This page was built for publication: 2-server PIR with sub-polynomial communication

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6829053)