Cryptographic Hardness of Random Local Functions–Survey

  • Benny Applebaum
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7785)


Constant parallel-time cryptography allows performing complex cryptographic tasks at an ultimate level of parallelism, namely, by local functions that each of their output bits depend on a constant number of input bits. The feasibility of such highly efficient cryptographic constructions was widely studied in the last decade via two main research threads.


  1. 1.
    Applebaum, B., Ishai, Y., Kushilevitz, E.: Cryptography in NC0. SIAM Journal on Computing 36(4), 845–888 (2006)MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Applebaum, B., Ishai, Y., Kushilevitz, E.: Computationally private randomizing polynomials and their applications. Journal of Computational Complexity 15(2), 115–162 (2006)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Goldreich, O.: Candidate one-way functions based on expander graphs. Electronic Colloquium on Computational Complexity (ECCC) 7(090) (2000)Google Scholar

Copyright information

© International Association for Cryptologic Research 2013

Authors and Affiliations

  • Benny Applebaum
    • 1
  1. 1.School of Electrical EngineeringTel-Aviv UniversityIsrael

Personalised recommendations