Change search
ReferencesLink to record
Permanent link

Direct link
Nearly one-sided tests and the Goldreich-Levin predicate
KTH, Superseded Departments, Numerical Analysis and Computer Science, NADA.
2004 (English)In: Journal of Cryptology, ISSN 0933-2790, E-ISSN 1432-1378, Vol. 17, no 3, 209-229 p.Article in journal (Refereed) Published
Abstract [en]

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.

Place, publisher, year, edition, pages
2004. Vol. 17, no 3, 209-229 p.
Keyword [en]
nearly one-sided statistical test, Goldreich-Levin predicate, pseudorandom generator, provable security, list decoding of Hadamard code
National Category
Computer Engineering
URN: urn:nbn:se:kth:diva-44865DOI: 10.1007/s00145-003-0141-4ISI: 000222469900002ScopusID: 2-s2.0-4344609701OAI: diva2:451529
QC 20111026Available from: 2011-10-26 Created: 2011-10-25 Last updated: 2011-10-26Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Hast, Gustav
By organisation
Numerical Analysis and Computer Science, NADA
In the same journal
Journal of Cryptology
Computer Engineering

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 8 hits
ReferencesLink to record
Permanent link

Direct link