Computationally Private Information Retrieval with Polylogarithmic Communication
- 15 April 1999
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 402-414
- https://doi.org/10.1007/3-540-48910-x_28
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Replication is not needed: single database, computationally-private information retrievalPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Preserving privacy in a network of mobile computersPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Private information retrievalPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Noninteractive Zero-KnowledgeSIAM Journal on Computing, 1991
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message AttacksSIAM Journal on Computing, 1988
- Multi-prover interactive proofs: how to remove intractabilityPublished by Association for Computing Machinery (ACM) ,1988
- Recognizing primes in random polynomial timePublished by Association for Computing Machinery (ACM) ,1987
- Almost all primes can be quickly certifiedPublished by Association for Computing Machinery (ACM) ,1986
- Probabilistic encryptionJournal of Computer and System Sciences, 1984
- A Fast Monte-Carlo Test for PrimalitySIAM Journal on Computing, 1977