Nearly one-sided tests and the Goldreich-Levin predicate

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

Volumn 2656, Issue , 2003, Pages 195-210

  Hast, Gustav ^a  

^a ROYAL INSTITUTE OF TECHNOLOGY   (Sweden)

Author keywords

Goldreich Levin predicate; List decoding; Nearly one sided statistical test; Provable security; Pseudo random generator

Indexed keywords

CRYPTOGRAPHY; GOLD; RANDOM PROCESSES; STATISTICAL TESTS;

GOLDREICH-LEVIN PREDICATE; HARD CORES; LIST DECODING; PROVABLE SECURITY; PSEUDORANDOM GENERATORS; PSEUDORANDOMNESS; SIGNATURE SCHEME;

TESTING;

EID: 35048896431     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-39200-9_12     Document Type: Article

References (19)

1. M. Adcock and R. Cleve: A Quantum Goldreich-Levin Theorem with Cryptographic Applications. Proceedings, STACS 2002, LNCS 2285, 2002, pp. 323-334, Springer-Verlag.
2. M. Bellare: Practice-oriented provable-security. Proceedings, ISW '97, LNCS 1396, 1997, pp. 221-231, Springer-Verlag.
3. M. Bellare and P. Rogaway: The exact security of digital signatures: How to sign with RSA and Rabin. Proceedings, EUROCRYPT '96, LNCS 1070, 1996, pp. 399-416, Springer-Verlag.
4. L. Blum, M. Blum and M. Shub: A Simple Unpredictable Pseudo-Random Generator. SIAM Journal on Computing, 15, no. 2, 1986, pp. 364-383.
5. M. Blum and O. Goldreich: Towards a Computational Theory of Statistical Tests. Proceedings, 33rd IEEE FOCS, 1992, pp. 406-416.
6. M. Blum and S. Micali: How to Generate Cryptographically Strong Sequences of Pseudo-random Bits. SIAM Journal on Computing, 13, no. 4, 1984, pp. 850-864.
7. R. Fischlin and C. P. Schnorr: Stronger Security Proofs for RSA and Rabin Bits. Journal of Cryptology, 13, no. 2, 2000, pp. 221-244.
8. O. Goldreich: Foundations of Cryptography: Basic Tools. Cambridge U. Press, 2001.
9. O. Goldreich, S. Goldwasser and S. Micali: How to Construct Random Functions. JACM, 33. no. 4, 1986, pp. 792-807.
10. O. Goldreich, R. Impagliazzo, L. A. Levin, R. Venkatesan and D. Zuckerman: Security Preserving Amplification of Hardness. Proceedings, 31st IEEE FOCS, 1990, pp. 318-326.
11. O. Goldreich and L. A. Levin: A Hard Core Predicate for any One Way Function. Proceedings, 21st ACM STOC, 1989, pp. 25-32.
12. O. Goldreich, R. Rubinfeld, and M. Sudan: Learning polynomials with queries: The highly noisy case. SIAM Journal on Discrete Mathematics, 13, no. 4, 2000, pp. 535-570.
13. S. Goldwasser, S. Micali and R. Rivest: A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks. SIAM Journal on Computing, 17, no. 2, 1988, pp. 281-308.
14. G. Hast: Nearly One-Sided Tests and the Goldreich-Levin Predicate. Journal of Cryptology, to appear.
15. J. Håstad and M. Näslund: Practical Construction and Analysis of Pseudo-Randomness Primitives. Proceedings, ASIACRYPT 2001, LNCS 2248, 2001, pp. 442-459, Springer-Verlag.
16. A. Herzberg and M. Luby: Public Randomness in Cryptography. Proceedings, CRYPTO '92, LNCS 0740, 1992, pp. 421-432, Springer-Verlag.
17. L. A. Levin: Randomness and Non-determinism. Journal of Symbolic Logic, 58, no. 3, 1993, pp. 1102-1103.
18. M. Sudan, L. Trevisan and S. Vadhan: Pseudorandom generators without the XOR Lemma. Journal of Computer and System Sciences, 62, no. 2, 2001, pp. 236-266.
19. A. C. Yao: Theory and application of trapdoor functions. Proceedings, 23rd IEEE FOCS, 1982, pp. 80-91.