Abstract
We study statistical tests with binary output that rarely outputs one, which we call nearly one-sided statistical tests. We provide an efficient reduction establishing improved security for the Goldreich-Levin hard-core bit against nearly one-sided tests. The analysis is extended to prove the security of the Blum-Micali pseudo-random generator combined with the Goldreich-Levin bit.
Furthermore, applications where nearly one-sided tests naturally occur are discussed. This includes cryptographic constructions that replace real randomness with pseudo-randomness and where the adversary’s success easily can be verified. In particular, this applies to signature schemes that utilize a pseudo-random generator as a provider of randomness.
Chapter PDF
Similar content being viewed by others
Keywords
References
M. Adcock and R. Cleve: A Quantum Goldreich-Levin Theorem with Cryptographic Applications. Proceedings, STACS 2002, LNCS 2285, 2002, pp. 323–334, Springer-Verlag.
M. Bellare: Practice-oriented provable-security. Proceedings, ISW’ 97, LNCS 1396, 1997, pp. 221–231, Springer-Verlag.
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.
L. Blum, M. Blum and M. Shub: A Simple Unpredictable Pseudo-Random Generator. SIAM Journal on Computing, 15, no. 2, 1986, pp. 364–383.
M. Blum and O. Goldreich: Towards a Computational Theory of Statistical Tests. Proceedings, 33rd IEEE FOCS, 1992, pp. 406–416.
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.
R. Fischlin and C. P. Schnorr: Stronger Security Proofs for RSA and Rabin Bits. Journal of Cryptology, 13, no. 2, 2000, pp. 221–244.
O. Goldreich: Foundations of Cryptography: Basic Tools. Cambridge U. Press, 2001.
O. Goldreich, S. Goldwasser and S. Micali: How to Construct Random Functions. JACM, 33. no. 4, 1986, pp. 792–807.
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.
O. Goldreich and L. A. Levin: A Hard Core Predicate for any One Way Function. Proceedings, 21st ACM STOC, 1989, pp. 25–32.
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.
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.
G. Hast: Nearly One-Sided Tests and the Goldreich-Levin Predicate. Journal of Cryptology, to appear.
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.
A. Herzberg and M. Luby: Public Randomness in Cryptography. Proceedings, CRYPTO’ 92, LNCS 0740, 1992, pp. 421–432, Springer-Verlag.
L. A. Levin: Randomness and Non-determinism. Journal of Symbolic Logic, 58, no. 3, 1993, pp. 1102–1103.
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.
A. C. Yao: Theory and application of trapdoor functions. Proceedings, 23rd IEEE FOCS, 1982, pp. 80–91.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 International Association for Cryptologic Research
About this paper
Cite this paper
Hast, G. (2003). Nearly One-Sided Tests and the Goldreich-Levin Predicate. In: Biham, E. (eds) Advances in Cryptology — EUROCRYPT 2003. EUROCRYPT 2003. Lecture Notes in Computer Science, vol 2656. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-39200-9_12
Download citation
DOI: https://doi.org/10.1007/3-540-39200-9_12
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-14039-9
Online ISBN: 978-3-540-39200-2
eBook Packages: Springer Book Archive