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. Finally, some applications where nearly one-sided tests occur naturally are discussed.
Article PDF
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by Oded Goldreich
Rights and permissions
About this article
Cite this article
Hast, G. Nearly One-Sided Tests and the Goldreich–Levin Predicate. J Cryptol 17, 209–229 (2004). https://doi.org/10.1007/s00145-003-0141-4
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00145-003-0141-4