Theoretical Computer Science and General Issues

Studies in Complexity and Cryptography

Miscellanea on the Interplay between Randomness and Computation

Authors: Goldreich, Oded

  • High quality selected papers
  • Unique visibility
  • State of the art research
see more benefits

Buy this book

eBook $79.99
price for USA (gross)
  • ISBN 978-3-642-22670-0
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Softcover $109.00
price for USA
  • ISBN 978-3-642-22669-4
  • Free shipping for individuals worldwide
  • Online orders shipping within 2-3 days.
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.

Table of contents (36 chapters)

  • Finding the Shortest Move-Sequence in the Graph-Generalized 15-Puzzle Is NP-Hard

    Goldreich, Oded

    Pages 1-5

  • Proving Computational Ability

    Bellare, Mihir (et al.)

    Pages 6-12

  • On Constructing 1-1 One-Way Functions

    Goldreich, Oded (et al.)

    Pages 13-25

  • On the Circuit Complexity of Perfect Hashing

    Goldreich, Oded (et al.)

    Pages 26-29

  • Collision-Free Hashing from Lattice Problems

    Goldreich, Oded (et al.)

    Pages 30-39

Buy this book

eBook $79.99
price for USA (gross)
  • ISBN 978-3-642-22670-0
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Softcover $109.00
price for USA
  • ISBN 978-3-642-22669-4
  • Free shipping for individuals worldwide
  • Online orders shipping within 2-3 days.
Loading...

Recommended for you

Loading...

Bibliographic Information

Bibliographic Information
Book Title
Studies in Complexity and Cryptography
Book Subtitle
Miscellanea on the Interplay between Randomness and Computation
Authors
Series Title
Theoretical Computer Science and General Issues
Series Volume
6650
Copyright
2011
Publisher
Springer-Verlag Berlin Heidelberg
Copyright Holder
Springer-Verlag GmbH Berlin Heidelberg
eBook ISBN
978-3-642-22670-0
DOI
10.1007/978-3-642-22670-0
Softcover ISBN
978-3-642-22669-4
Edition Number
1
Number of Pages
XI, 563
Number of Illustrations and Tables
8 b/w illustrations, 1 illustrations in colour
Topics