Improved upper bounds on information-theoretic private information retrieval (extended abstract)
- 1 May 1999
- proceedings article
- Published by Association for Computing Machinery (ACM)
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- One-way functions are essential for single-server private information retrievalPublished by Association for Computing Machinery (ACM) ,1999
- Protecting data privacy in private information retrieval schemesPublished by Association for Computing Machinery (ACM) ,1998
- Universal service-providers for database private information retrieval (extended abstract)Published by Association for Computing Machinery (ACM) ,1998
- Span Programs and General Secure Multi-Party ComputationBRICS Report Series, 1997
- Computationally private information retrieval (extended abstract)Published by Association for Computing Machinery (ACM) ,1997
- Private information storage (extended abstract)Published by Association for Computing Machinery (ACM) ,1997
- Upper bound on the communication complexity of private information retrievalPublished by Springer Nature ,1997
- Hiding instances in multioracle queriesPublished by Springer Nature ,1990
- On hiding information from an oracleJournal of Computer and System Sciences, 1989
- How to share a secretCommunications of the ACM, 1979