Reducing the Servers Computation in Private Information Retrieval: PIR with Preprocessing
- 11 August 2000
- conference paper
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
Abstract
No abstract availableThis publication has 23 references indexed in Scilit:
- Elements of Information TheoryPublished by Wiley ,2001
- Single Database Private Information Retrieval Implies Oblivious TransferLecture Notes in Computer Science, 2000
- Improved Upper Bounds on the Simultaneous Messages Complexity of the Generalized Addressing FunctionLecture Notes in Computer Science, 2000
- One-way functions are essential for single-server private information retrievalPublished by Association for Computing Machinery (ACM) ,1999
- Computationally Private Information Retrieval with Polylogarithmic CommunicationLecture Notes in Computer Science, 1999
- Locally random reductions: Improvements and applicationsJournal of Cryptology, 1997
- Upper bound on the communication complexity of private information retrievalLecture Notes in Computer Science, 1997
- Simultaneous messages vs. communicationLecture Notes in Computer Science, 1995
- Matrix multiplication via arithmetic progressionsJournal of Symbolic Computation, 1990
- Hiding instances in multioracle queriesLecture Notes in Computer Science, 1990