On Basing Private Information Retrieval on NP-Hardness
Name
2015-1061.pdf
Description
Accepted version
Size
118.69 KB
Format
Unknown
Checksum (MD5)
e41f57a71a5f23dafb895a9eb0abfa47
Author(s)
Liu, Tianren
Vaikuntanathan, Vinod
Date Issued
December 2015
Publisher
Springer Nature
Citation
Liu, Tianren and Vaikuntanathan, Vinod. 2015. "On Basing Private Information Retrieval on NP-Hardness."
Version
Author's final manuscript
Abstract
© International Association for Cryptologic Research 2016. The possibility of basing the security of cryptographic objects on the (minimal) assumption that NP BPP is at the very heart of complexity-theoretic cryptography. Most known results along these lines are negative, showing that assuming widely believed complexity-theoretic conjectures, there are no reductions from an NPhard problem to the task of breaking certain cryptographic schemes. We make progress along this line of inquiry by showing that the security of single-server single-round private information retrieval schemes cannot be based on NP-hardness, unless the polynomial hierarchy collapses. Our main technical contribution is in showing how to break the security of a PIR protocol given an SZK oracle. Our result is tight in terms of both the correctness and the privacy parameter of the PIR scheme.
MIT Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1007/978-3-662-49096-9_16
