Computationally Private Information Retrieval with Polylogarithmic Communication
Authors:
- Silvio MicaliSMSilvio Micali
- 15 April 1999
- book chapter
- Published by Springer Nature
- p. 402-414
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Computationally private information retrieval (extended abstract)1997
- 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 intractability1988
- Recognizing primes in random polynomial time1987
- Almost all primes can be quickly certified1986
- Probabilistic encryptionJournal of Computer and System Sciences, 1984
- A Fast Monte-Carlo Test for PrimalitySIAM Journal on Computing, 1977