Studies in Complexity and Cryptography. Miscellanea on the Interplay between Randomness and Computation

In Collaboration with Lidor Avigad, Mihir Bellare, Zvika Brakerski, Shafi Goldwasser, Shai Halevi, Tali Kaufman, Leonid Levin, Noam Nisan, Dana Ron, Madhu Sudan, Luca Trevisan, Salil Vadhan, Avi Wigderson, David Zuckerman

  • Oded Goldreich

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

Table of contents

  1. Front Matter
  2. Research Contributions

    1. Mihir Bellare, Oded Goldreich
      Pages 6-12
    2. Oded Goldreich, Leonid A. Levin, Noam Nisan
      Pages 13-25
    3. Oded Goldreich, Avi Wigderson
      Pages 26-29
    4. Oded Goldreich, Shafi Goldwasser, Shai Halevi
      Pages 30-39
    5. Oded Goldreich, David Zuckerman
      Pages 40-53
    6. Oded Goldreich
      Pages 54-58
    7. Oded Goldreich, Salil Vadhan, Avi Wigderson
      Pages 59-67
    8. Oded Goldreich, Dana Ron
      Pages 68-75
    9. Oded Goldreich, Madhu Sudan, Luca Trevisan
      Pages 109-113
    10. Zvika Brakerski, Oded Goldreich
      Pages 141-155
    11. Lidor Avigad, Oded Goldreich
      Pages 156-172
    12. Oded Goldreich, Tali Kaufman
      Pages 173-190
    13. Oded Goldreich
      Pages 191-232
  3. Surveys

    1. Oded Goldreich
      Pages 248-272
    2. Oded Goldreich, Noam Nisan, Avi Wigderson
      Pages 273-301
    3. Oded Goldreich
      Pages 333-372
    4. Oded Goldreich, Salil Vadhan
      Pages 390-405
    5. Oded Goldreich
      Pages 422-450
    6. Oded Goldreich
      Pages 451-464
    7. Oded Goldreich
      Pages 465-469
    8. Oded Goldreich
      Pages 470-506
    9. Oded Goldreich
      Pages 507-539
  4. Programmatic and Reflective Articles

  5. Back Matter

About this book


This book presents a collection of 36 pieces of scientific work in the areas of complexity theory and foundations of cryptography: 20 research contributions, 13 survey articles, and 3 programmatic and reflective viewpoint statements. These so far formally unpublished pieces were written by Oded Goldreich, some in collaboration with other scientists.
The articles included in this book essentially reflect the topical scope of the scientific career of Oded Goldreich now spanning three decades. In particular the topics dealt with include average-case complexity, complexity of approximation, derandomization, expander graphs, hashing functions, locally testable codes, machines that take advice, NP-completeness, one-way functions, probabilistically checkable proofs, proofs of knowledge, property testing, pseudorandomness, randomness extractors, sampling, trapdoor permutations, zero-knowledge, and non-iterative zero-knowledge.
All in all, this potpourri of studies in complexity and cryptography constitutes a most valuable contribution to the field of theoretical computer science centered around the personal achievements and views of one of its outstanding representatives.


coding theory complexity classes computability computational complexity computational intractability cryptology graph computations

Editors and affiliations

  • Oded Goldreich
    • 1
  1. 1.Faculty of Mathematics and Computer ScienceWeizmann Institute of ScienceRehovotIsrael

Bibliographic information

  • DOI
  • Copyright Information Springer-Verlag GmbH Berlin Heidelberg 2011
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science Computer Science (R0)
  • Print ISBN 978-3-642-22669-4
  • Online ISBN 978-3-642-22670-0
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site
Industry Sectors
IT & Software
Consumer Packaged Goods
Energy, Utilities & Environment