Replication is not needed: single database, computationally-private information retrieval
Top Cited Papers
- 22 November 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 364-373
- https://doi.org/10.1109/sfcs.1997.646125
Abstract
No abstract availableThis publication has 15 references indexed in Scilit:
- Upper bound on the communication complexity of private information retrievalPublished by Springer Nature ,1997
- Software protection and simulation on oblivious RAMsJournal of the ACM, 1996
- Noninteractive Zero-KnowledgeSIAM Journal on Computing, 1991
- Odds and ends from cryptology and computational number theoryProceedings of Symposia in Applied Mathematics, 1991
- The Knowledge Complexity of Interactive Proof SystemsSIAM Journal on Computing, 1989
- Towards a theory of software protection and simulation by oblivious RAMsPublished by Association for Computing Machinery (ACM) ,1987
- How to play ANY mental gamePublished by Association for Computing Machinery (ACM) ,1987
- A Simple Unpredictable Pseudo-Random Number GeneratorSIAM Journal on Computing, 1986
- A randomized protocol for signing contractsCommunications of the ACM, 1985
- Probabilistic encryptionJournal of Computer and System Sciences, 1984