Sciweavers

Share
EUROCRYPT
2003
Springer

Nearly One-Sided Tests and the Goldreich-Levin Predicate

10 years 1 months ago
Nearly One-Sided Tests and the Goldreich-Levin Predicate
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.
Gustav Hast
Added 06 Jul 2010
Updated 06 Jul 2010
Type Conference
Year 2003
Where EUROCRYPT
Authors Gustav Hast
Comments (0)
books