LEADER 05892nam 22007815 450 001 996465753403316 005 20230406031251.0 010 $a3-642-22670-1 024 7 $a10.1007/978-3-642-22670-0 035 $a(CKB)2670000000099855 035 $a(SSID)ssj0000530773 035 $a(PQKBManifestationID)11335421 035 $a(PQKBTitleCode)TC0000530773 035 $a(PQKBWorkID)10570003 035 $a(PQKB)11651458 035 $a(DE-He213)978-3-642-22670-0 035 $a(MiAaPQ)EBC3067048 035 $a(PPN)156314320 035 $a(EXLCZ)992670000000099855 100 $a20110727d2011 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aStudies in Complexity and Cryptography$b[electronic resource] $eMiscellanea on the Interplay between Randomness and Computation /$fby Oded Goldreich 205 $a1st ed. 2011. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2011. 215 $a1 online resource (XI, 563 p. 9 illus., 1 illus. in color.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v6650 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-642-22669-8 320 $aIncludes bibliographical references. 327 $aResearch 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 Probabilistic versus Deterministic Provers in the Definition of Proofs of Knowledge.- On the Average-Case Complexity of Property Testing.- A Candidate Counterexample to the Easy Cylinders Conjecture.- From Absolute Distinguishability to Positive Distinguishability.- Testing Graph Blow-Up.- Proximity Oblivious Testing and the Role of Invariances.- In a World of P=BPP.- Surveys -- Notes on Levin?s Theory of Average-Case Complexity.- Three XOR-Lemmas ? An Exposition.- On Yao?s XOR-Lemma.- A Sample of Samplers: A Computational Perspective on Sampling.- Short Locally Testable Codes and Proofs.- Bravely, Moderately: A Common Theme in Four Recent Works.- On the Complexity of Computational Problems Regarding Distributions.- Basing Non-Interactive Zero-Knowledge on (Enhanced) Trapdoor Permutations: The State of the Art.- Average Case Complexity, Revisited.- Basic Facts about Expander Graphs.- A Brief Introduction to Property Testing.- Introduction to Testing Graph Properties.- Randomness and Computation.- Programmatic and Reflective Articles -- On Security Preserving Reductions ? Revised Terminology.- Contemplations on Testing Graph Properties.- Another Motivation for Reducing the Randomness Complexity of Algorithms.- About the Authors. . 330 $aThis 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. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v6650 606 $aComputer science 606 $aCryptography 606 $aData encryption (Computer science) 606 $aMachine theory 606 $aComputer science?Mathematics 606 $aDiscrete mathematics 606 $aAlgorithms 606 $aTheory of Computation 606 $aCryptology 606 $aFormal Languages and Automata Theory 606 $aDiscrete Mathematics in Computer Science 606 $aAlgorithms 615 0$aComputer science. 615 0$aCryptography. 615 0$aData encryption (Computer science). 615 0$aMachine theory. 615 0$aComputer science?Mathematics. 615 0$aDiscrete mathematics. 615 0$aAlgorithms. 615 14$aTheory of Computation. 615 24$aCryptology. 615 24$aFormal Languages and Automata Theory. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aAlgorithms. 676 $a511.3/52 700 $aGoldreich$b Oded$4aut$4http://id.loc.gov/vocabulary/relators/aut$066329 701 $aAvigad$b Lidor$01242269 702 $aGoldreich$b Oded 906 $aBOOK 912 $a996465753403316 996 $aStudies in Complexity and Cryptography$92881637 997 $aUNISA