Improved upper bounds on information-theoretic private information retrieval (extended abstract)

DOI10.1145/301250.301275zbMath1346.68083OpenAlexW2102085840MaRDI QIDQ2819536

Yuval Ishai, Eyal Kushilevitz

Publication date: 29 September 2016

Published in: Proceedings of the thirty-first annual ACM symposium on Theory of Computing (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Information storage and retrieval of data (68P20) Authentication, digital signatures and secret sharing (94A62)

Related Items (5)

On locally decodable codes, self-correctable codes, and \(t\)-private PIR ⋮ General constructions for information-theoretic private information retrieval ⋮ Multi-value private information retrieval with colluding databases via trace functions ⋮ A geometric approach to homomorphic secret sharing ⋮ Protecting data privacy in private information retrieval schemes

This page was built for publication: Improved upper bounds on information-theoretic private information retrieval (extended abstract)