Studies in Complexity and Cryptography: Miscellanea on the Interplay between Randomness and Computation [Paperback]

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.

Research Contributions.- Finding the Shortest Move-Sequence in the Graph-Generalized 15-Puzzle Is NP-Hard.-?Proving Computational Ability.- On Constructing 1-1 One-Way Functions.- On the Circuit Complexity of Perfect Hashing.-?Collision-Free Hashing from Lattice Problems.-?Another Proof That BPP ? PH (and More).- Strong Proofs of Knowledge.- ?Simplified Derandomization of BPP Using a Hitting Set Generator.-?On Testing Expansion in Bounded-Degree Graphs.-?Candidate One-Way Functions Based on Expander Graphs.-?Using the FGLSS-Reduction to Prove Inapproximability Results for Minimum Vertex Cover in Hypergraphs.-?The GGM Construction Does NOT Yield Correlation Intractable Function Ensembles.-?From Logarithmic Advice to Single-Bit Advice.-?On ProblS.