Proving hard-core predicates using list decoding

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 2003, Pages 146-159

  Akavia, Adi ^a   Goldwasser, Shafi ^a,b   Safra, Samuel ^c  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^c TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS; CODES (SYMBOLS); COMPUTATIONAL COMPLEXITY; ERROR CORRECTION; FOURIER TRANSFORMS; LEARNING ALGORITHMS; LEARNING SYSTEMS; NUMBER THEORY; POLYNOMIALS; THEOREM PROVING;

HARD CORE PREDICATES; LIST DECODING; ONE WAY FUNCTION;

DECODING;

EID: 0344550526     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (22)

1. W. Alexi, B. Chor, O. Goldreich, and C. P. Schnorr. RSA and Rabin functions: certain parts are as hard as the whole. SIAM J. Computing, 17:194-209, 1988.
2. M. Ben-Or, B. Chor, and A. Shamir. On the cryptographic security of single RSA bits. In In Proc. 15th ACM Symposium on Theory of Computing, pages 421-430, 1983.
3. L. Blum, M. Blum, and M. Shub. A simple unpredictable pseudo-random number generator. SIAM J. Comput., 15(2):364-383, 1986.
4. M. Blum and S. Micali. How to generate cryptographically strong sequences of pseudo-random bits. SIAM Journal on Computing, 13(4):850-864, 1984.
5. R. Fischlin and P. Schnorr. Stronger security proofs for RSA and Rabin bits. J. Cryptology, 13:221-244, 2000.
6. M. Goldmann and A. Russell. Spectral bounds on general hard core predicates. In In Proc. of STACS, pages 614-625, 2000.
7. O. Goldreich and L. Levin. A hard-core predicate for all one-way functions. In STOC, 1989.
8. Oded Goldreich. Foundations of Cryptography, Basic Tools. Cambridge university press, 2001.
9. S. Goldwasser and S. Micali. Probabilistic encryption. JCSS, 28(2):270-299, 1984.
10. S. Goldwasser, S. Micali, and P. Tong. Why and how to establish a private code on a public network. In In Proc. 23rd IEEE Symp. on Foundations of Comp. Science, pages 134-144, 1982.
11. J. Hastad and M. Naslund. The security of individual RSA bits. In IEEE Symposium on Foundations of Computer Science, pages 510-521, 1998.
12. R. Impagliazzo. private communication
13. B. S. Kaliski. A pseudo-random bit generator based on elliptic logarithms. In In Advances in Cryptology - CRYPTO '86, A. M. Odlyzko, Ed., vol. 263 of Lecture Notes in Computer Science, Springer-Verlag, volume 263, pages 84-103, 1986.
14. E. Kushilevitz and Y. Mansour. Learning decision trees using the Fourier spectrum. SICOMP, 22(6):1331-1348, 1993.
15. D.L. Long and A. Wigderson. The Discrete Log problem hides O(log N) bits. SIAM J. Comp., 17:363-372, 1988.
16. Y. Mansour. Randomized interpolation and approximation of sparse polynomials. SIAM Journal on Computing, 24(2):357-368, 1995.
17. M. Naslund. All bits in ax + b modp are hard (extended abstract). In In Proc. of CRYPTO '96, pages 114-1128, 1996.
18. R. L. Rivest, A. Shamir, and L. M. Adelman. A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM, 21(2):120-126, 1978.
19. M. Sudan. List decoding: Algorithms and applications. SIGACTN: SIGACT News (ACM Special Interest Group on Automata and Computability Theory), 31, 2000.
20. U.V. Vazirani and V. V. Vazirani. Efficient and secure pseudo-random number generation. In Proc. 25th IEEE Symp. on Foundations of Computer Science, pages 458-463, 1984.
21. H. Wee. private communication.
22. A.C. Yao. Theory and application of trapdoor functions. In In 23rd IEEE Symposium on Foundations of Computer Science, pages 80-91, 1982.