Complexity bounds on general hard-core predicates

Journal of Cryptology

Volumn 14, Issue 3, 2001, Pages 177-195

  Goldmann, Mikael ^a  

^a ROYAL INSTITUTE OF TECHNOLOGY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 27644489812     PISSN: 09332790     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00145-001-0007-6     Document Type: Article

References (27)

1. W. Alexi, B. Chor, O. Goldreich, and C. P. Schnorr. RSA and Rabin functions: certain parts are as hard as the whole. SIAMJ. Comput., 17(2): 194-209, Apr. 1988.
2. M. Blum. Coin flipping by telephone: A protocol for solving impossible problems. In A. Gersho, editor, Advances in Ciyptology: A Report on CRYPTO 81, pages 11-15, Department of Electrical and Computer Engineering, U.C. Santa Barbara, 24-26 Aug. 1981. ECE Report 82-04, 1982.
3. M. Blum and S. Micali. How to generate cryptographically strong sequences of pseudo-random bits. SIAMJ. Comput., 13(4):850-864, Nov. 1984.
4. R. Dudley. Real Analysis and Probability. Chapman and Hall Mathematics Series. Chapman and Hall, New York, 1989.
5. H. Dym and H. P. McKean. Fourier Series and Integrals, volume 14 of Probability and Mathematical Statistics. Academic Press, New York, 1972.
6. M. Goldmann and M. Naslund. The complexity of computing hard core predicates. In B. S. Kaliski Jr., editor, Advances in Cryptology-CRYPTO '97, volume 1294 of Lecture Notes in Computer Science, pages 1-15. Springer-Verlag, Berlin, 1997.
7. M. Goldmann and A. Russell. Spectral bounds on general hard-core predicates. In H. Reichel and S. Tisson, editors, Proceedings of the llth Annual Symposium on Theoretical Aspects of Computer Science-STACS 2000, volume 1770 of Lecture Notes in Computer Science, pages 614-625. Springer-Verlag, Berlin, Feb. 2000.
8. O. Goldreich. Modem Cryptography, Probabilistic Proofs and Pseudorandom/less. Springer-Verlag, New York, 1999.
9. O. Goldreich and L. A. Levin. A hard-core predicate for all one-way functions. In Proceedings of the Twenty-First Annual ACM Symposium on Tlieory of Computing, pages 25-32, Seattle, Washington, 15-17 May 1989.
10. S. Goldwasser and S. Micali. Probabilistic encryption. J. Comput. System Sei., 28(2):270-299, Apr. 1984.
11. C. Gotsman and N. Linial. Spectral properties of threshold functions. Combinatorica, 14(1):35-50,1994.
12. J. Hâstad. Computational Limitations for Small Depth Circuits. Ph.D. thesis, ACM Doctoral Dissertations Award. MIT Press, Cambridge, Massachusettes, 1986.
13. J. Hâstad. Pseudo-random generators under uniform assumptions. In Proceedings of the Twenty Second Annual ACM Symposium on Theory of Computing, pages 395104, Baltimore, Maryland, 14-16 May 1990.
14. J. Hâstad, R. Impagliazzo, L. A. Levin, and M. Luby. A pseudorandom generator from any one-way function. S1AMJ. Comput., 28(4):1364-1396 (electronic), 1999.
15. J. Hâstad and M. Naslund. The security of all RSA and discrete log bits. In Proceedings of the 39th Annual Symposium on Foundations of Computer Science, pages 510-519, Palo Alto, California, 8-11 Nov. 1998.
16. J. Hâstad and M. Naslund. The security of individual RSA bits. Manuscript, 1999. An Earlier version appeared in [15].
17. J. Hâstad, A. W. Schrift, and A. Shamir. The discrete logarithm modulo a composite hides O(n) bits. J. Comput. System Sei., 47(3):376-404, Dec. 1993.
18. R. Impagliazzo, L. A. Levin, and M. Luby. Pseudo-random generation from one-way functions (extended abstracts). In Proceedings of the Twenty-First Annual ACM Symposium on Theory of Computing, pages 12-24, Seattle, Washington, 15-17 May 1989.
19. J. Kahn, G. Kalai, and N. Linial. The influence of variables on Boolean functions (extended abstract). In Proceedings of the 29th Annual Symposium on Foundations of Computer Science, pages 68-80, White Plains, New York, 24-26 Oct. 1988.
20. M. Kharitonov, A. V. Goldberg, and M. Yung. Lower bounds for pseudorandom number generators. In Proceedings of the 30th Annual Symposium on Foundations of Computer Science, pages 242-247, Research Triangle Park, North Carolina, 30 Oct.-l Nov. 1989.
21. N. Linial. Private communication. December, 1998.
22. N. Linial, Y. Mansour, and N. Nisan. Constant depth circuits, Fourier transform and leamability. Assoc. Comput. Mech., 40(3):607-620, July 1993.
23. M. Luby. Pseudorandom/less and Cryptographic Applications. Princeton University Press, Princeton, New Jersey, 1996.
24. Y. Mansour, N. Nisan, and P. Tiwari. The computational complexity of universal hashing. Theoret. Comput. Sei., 107(1):121-133, 1993.
25. M. Naslund. Universal hash functions and hard core bits. In EUROCRYPT: Advances in Cryptology: Proceedings of EUROCRYPT, volume 921 of Lecture Notes in Computer Science, pages 356-366. Springer-Verlag, Berlin, 1995.
26. M. Naslund. All bits in ax + b mod p are hard (extended abstract). In N. Koblitz, editor, Advances in Cryptology-CRYPTO '96, volume 1109 of Lecture Notes in Computer Science, pages 114-128. Springer-Verlag, Berlin, Aug. 1996.
27. A. C. Yao. Theory and applications of trapdoor functions (extended abstract). In Proceedings of the 23rd Annual Symposium on Foundations of Computer Science, pages 80-91, Chicago, Illinois, 3-5 Nov. 1982.