Studies in complexity and cryptography: miscellanea on the interplay between randomness and computation

Lidor Avigad, Mihir Bellare, Zvika Brakerski, Oded Goldreich (Editor), S Goldwasser, Shai Halevi, Tali Kaufman, Leonid Levin, Noam Nisan, Dana Ron, Madhu Sudan, Luca Trevisan, Salil Vadhan, Avi Wigderson, David Zuckerman

Research output: Book/ReportBookpeer-review

Abstract

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.
Original languageEnglish
Place of PublicationHeidelberg
PublisherSpringer
Number of pages563
ISBN (Electronic)9783642226700
ISBN (Print)3642226698, 9783642226694
DOIs
StatePublished - 2011

Publication series

NameState-of-the-Art Survey
PublisherSpringer
Volume6650
ISSN (Print)0302-9743

ULI Keywords

  • uli
  • Computational complexity
  • Cryptography -- Mathematics
  • Complexity, Computational

Cite this