Computationally private information retrieval with polylogarithmic communication

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1592, Issue , 1999, Pages 402-414

  Cachin, Christian ^a   Micali, Silvio ^b   Stadler, Markus ^c  

^a IBM RESEARCH ZURICH   (Switzerland)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^c Crypto AG   (Switzerland)

Author keywords

Euler s function; Integer factorization; Private information retrieval; hiding assumption

Indexed keywords

CRYPTOGRAPHY; FACTORIZATION;

COMPOSITE INTEGERS; COMPUTATIONALLY-PRIVATE INFORMATION RETRIEVAL; INTEGER FACTORIZATION; POLY-LOGARITHMIC COMMUNICATION; PRIVATE INFORMATION RETRIEVAL; S FUNCTION;

INFORMATION RETRIEVAL;

EID: 1642602228     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48910-X_28     Document Type: Conference Paper

References (17)

1. L. M. Adleman and M.-D. A. Huang, “Recognizing primes in random polynomial time," in Proc. 19th Annual ACM Symposium on Theory of Computing (STOC), pp. 462-469, 1987.
2. A. Ambainis, “Upper bound on the communication complexity of private information retrieval," in Proc. 24th ICALP, vol. 1256 of Lecture Notes in Computer Science, Springer, 1997.
3. E. Bach and J. Shallit, Algorithmic Number Theory, vol. 1: Efficient Algorithms. Cambridge: MIT Press, 1996.
4. M. Ben-Or, S. Goldwasser, J. Kilian, and A. Wigderson, “Multi prover interactive proofs: How to remove intractability," in Proc. 20th Annual ACM Symposium on Theory of Computing (STOC), pp. 113-131, 1988.
5. M. Blum, A. De Santis, S. Micali, and G. Persiano, “Noninteractive zeroknowledge," SIAM Journal on Computing, vol. 20, pp. 1085-1118, Dec. 1991.
6. B. Chor and N. Gilboa, “Computationally private information retrieval," in Proc. 29th Annual ACM Symposium on Theory of Computing (STOC), pp. 304-313, 1997.
7. B. Chor, O. Goldreich, E. Kushilevitz, and M. Sudan, “Private information retrieval," in Proc. 36th IEEE Symposium on Foundations of Computer Science (FOCS), 1995.
8. D. A. Cooper and K. P. Birman, “Preserving privacy in a network of mobile computers," in Proc. IEEE Symposium on Security and Privacy, pp. 26-38, 1995.
9. D. Coppersmith, “Finding a small root of a bivariate integer equation; factoring with high bits known," in Advances in Cryptology: EUROCRYPT '96 (U. Maurer, ed.), vol. 1233 of Lecture Notes in Computer Science, Springer, 1996.
10. D. Coppersmith, “Finding a small root of a univariate modular equation," in Ad- vances in Cryptology: EUROCRYPT '96 (U. Maurer, ed.), vol. 1233 of Lecture Notes in Computer Science, Springer, 1996.
11. D. Coppersmith. personal communication, 1998.
12. S. Goldwasser and J. Kilian, “Almost all primes can be quickly certified," in Proc. 18th Annual ACM Symposium on Theory of Computing (STOC), pp. 316-329, 1986.
13. S. Goldwasser and S. Micali, “Probabilistic encryption," Journal of Computer and System Sciences, vol. 28, pp. 270-299, 1984.
14. S. Goldwasser, S. Micali, and R. L. Rivest, “A digital signature scheme secure against adaptive chosen-message attacks," SIAM Journal on Computing, vol. 17, pp. 281-308, Apr. 1988.
15. E. Kushilevitz and R. Ostrovsky, “Replication is not needed: Single database, computationally-private information retrieval," in Proc. 38th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 364-373, 1997.
16. M. O. Rabin, “How to exchange secrets by oblivious transfer," Tech. Rep. TR-81, Harvard, 1981.
17. R. Solovay and V. Strassen, “A fast monte-carlo test for primality," SIAM Journal on Computing, vol. 6, no. 1, pp. 84-85, 1977.