2-server PIR with subpolynomial communication

DOI10.1145/2968443MaRDI QIDQ6829054zbMATH OpenFDO

Authors Zeev Dvir, Sivakanth Gopi

Publication date 2 August 2018

Published in Journal of the ACM (Search for Journal in Brave)

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

zbMATH Keywords

locally decodable codesprivate information retrieval

Mathematics Subject Classification ID

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

Cited in

(9)

• Malicious security for PIR (almost) for free
• Information-theoretic multi-server private information retrieval with client preprocessing
• Towards practical doubly-efficient private information retrieval
• Matrix hypercontractivity, streaming algorithms and LDCs: the large alphabet case
• List-decodable Byzantine robust PIR: lower communication complexity, higher Byzantine tolerance, smaller list size
• Simplified PIR and CDS protocols and improved linear secret-sharing schemes
• Scalable multi-server private information retrieval
• On the definition of malicious private information retrieval
• Two-server private information retrieval in sublinear time and quasilinear space

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

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