Skip to main content

Advertisement

SpringerLink
Log in
Menu
Find a journal Publish with us
Search
Cart
Book cover

International Conference on the Theory and Applications of Cryptographic Techniques

EUROCRYPT 2003: Advances in Cryptology — EUROCRYPT 2003 pp 195–210Cite as

  1. Home
  2. Advances in Cryptology — EUROCRYPT 2003
  3. Conference paper
Nearly One-Sided Tests and the Goldreich-Levin Predicate

Nearly One-Sided Tests and the Goldreich-Levin Predicate

  • Gustav Hast5 
  • Conference paper
  • First Online: 01 January 2003
  • 3480 Accesses

  • 3 Citations

Part of the Lecture Notes in Computer Science book series (LNCS,volume 2656)

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.

Keywords

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

Download conference paper PDF

References

  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.

    CrossRef  Google Scholar 

  2. M. Bellare: Practice-oriented provable-security. Proceedings, ISW’ 97, LNCS 1396, 1997, pp. 221–231, Springer-Verlag.

    Google Scholar 

  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.

    Google Scholar 

  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.

    CrossRef  MATH  MathSciNet  Google Scholar 

  5. M. Blum and O. Goldreich: Towards a Computational Theory of Statistical Tests. Proceedings, 33rd IEEE FOCS, 1992, pp. 406–416.

    Google Scholar 

  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.

    CrossRef  MATH  MathSciNet  Google Scholar 

  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.

    CrossRef  MATH  MathSciNet  Google Scholar 

  8. O. Goldreich: Foundations of Cryptography: Basic Tools. Cambridge U. Press, 2001.

    Google Scholar 

  9. O. Goldreich, S. Goldwasser and S. Micali: How to Construct Random Functions. JACM, 33. no. 4, 1986, pp. 792–807.

    CrossRef  MathSciNet  Google Scholar 

  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.

    Google Scholar 

  11. O. Goldreich and L. A. Levin: A Hard Core Predicate for any One Way Function. Proceedings, 21st ACM STOC, 1989, pp. 25–32.

    Google Scholar 

  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.

    CrossRef  MATH  MathSciNet  Google Scholar 

  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.

    CrossRef  MATH  MathSciNet  Google Scholar 

  14. G. Hast: Nearly One-Sided Tests and the Goldreich-Levin Predicate. Journal of Cryptology, to appear.

    Google Scholar 

  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.

    CrossRef  Google Scholar 

  16. A. Herzberg and M. Luby: Public Randomness in Cryptography. Proceedings, CRYPTO’ 92, LNCS 0740, 1992, pp. 421–432, Springer-Verlag.

    Google Scholar 

  17. L. A. Levin: Randomness and Non-determinism. Journal of Symbolic Logic, 58, no. 3, 1993, pp. 1102–1103.

    Google Scholar 

  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.

    CrossRef  MATH  MathSciNet  Google Scholar 

  19. A. C. Yao: Theory and application of trapdoor functions. Proceedings, 23rd IEEE FOCS, 1982, pp. 80–91.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Numerical Analysis and Computer Science, Royal Institute of Technology, 100 44, Stockholm, Sweden

    Gustav Hast

Authors
  1. Gustav Hast
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Computer Science Department, Technion — Israel Institute of Technology, Haifa, 32000, Israel

    Eli Biham

Rights and permissions

Reprints 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

  • .RIS
  • .ENW
  • .BIB
  • DOI: https://doi.org/10.1007/3-540-39200-9_12

  • Published: 13 May 2003

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-14039-9

  • Online ISBN: 978-3-540-39200-2

  • eBook Packages: Springer Book Archive

Share this paper

Anyone you share the following link with will be able to read this content:

Sorry, a shareable link is not currently available for this article.

Provided by the Springer Nature SharedIt content-sharing initiative

Search

Navigation

  • Find a journal
  • Publish with us

Discover content

  • Journals A-Z
  • Books A-Z

Publish with us

  • Publish your research
  • Open access publishing

Products and services

  • Our products
  • Librarians
  • Societies
  • Partners and advertisers

Our imprints

  • Springer
  • Nature Portfolio
  • BMC
  • Palgrave Macmillan
  • Apress
  • Your US state privacy rights
  • Accessibility statement
  • Terms and conditions
  • Privacy policy
  • Help and support

167.114.118.210

Not affiliated

Springer Nature

© 2023 Springer Nature