One-way functions are essential for single-server private information retrieval
From MaRDI portal
Publication:2819537
DOI10.1145/301250.301277zbMath1346.68081OpenAlexW2088530676MaRDI QIDQ2819537
Eyal Kushilevitz, Amos Beimel, Tal Malkin, Yuval Ishai
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.301277
Information storage and retrieval of data (68P20) Network protocols (68M12) Authentication, digital signatures and secret sharing (94A62)
Related Items (5)
Lower bounds for (batch) PIR with private preprocessing ⋮ A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval ⋮ On Basing Private Information Retrieval on NP-Hardness ⋮ Protecting data privacy in private information retrieval schemes ⋮ Finding Collisions in Interactive Protocols---Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments
This page was built for publication: One-way functions are essential for single-server private information retrieval
