One-way functions are essential for single-server private information retrieval
- 1 May 1999
- proceedings article
- Published by Association for Computing Machinery (ACM)
Abstract
No abstract availableThis publication has 19 references indexed in Scilit:
- Computationally Private Information Retrieval with Polylogarithmic CommunicationPublished by Springer Nature ,1999
- Private information retrievalJournal of the ACM, 1998
- A Random Server Model for Private Information RetrievalPublished by Springer Nature ,1998
- Upper bound on the communication complexity of private information retrievalPublished by Springer Nature ,1997
- A note on computational indistinguishabilityInformation Processing Letters, 1990
- Hiding instances in multioracle queriesPublished by Springer Nature ,1990
- On hiding information from an oracleJournal of Computer and System Sciences, 1989
- Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication ComplexitySIAM Journal on Computing, 1988
- Equivalence Between Two Flavours of Oblivious TransfersPublished by Springer Nature ,1988
- Probabilistic encryptionJournal of Computer and System Sciences, 1984