000 05522nam a22006135i 4500
001 978-3-642-22670-0
003 DE-He213
005 20240730180336.0
007 cr nn 008mamaa
008 110727s2011 gw | s |||| 0|eng d
020 _a9783642226700
_9978-3-642-22670-0
024 7 _a10.1007/978-3-642-22670-0
_2doi
050 4 _aQA75.5-76.95
072 7 _aUYA
_2bicssc
072 7 _aCOM014000
_2bisacsh
072 7 _aUYA
_2thema
082 0 4 _a004.0151
_223
100 1 _aGoldreich, Oded.
_eauthor.
_4aut
_4http://id.loc.gov/vocabulary/relators/aut
_9119732
245 1 0 _aStudies in Complexity and Cryptography
_h[electronic resource] :
_bMiscellanea on the Interplay between Randomness and Computation /
_cby Oded Goldreich.
250 _a1st ed. 2011.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2011.
300 _aXI, 563 p. 9 illus., 1 illus. in color.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v6650
505 0 _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 Motivationfor Reducing the Randomness Complexity of Algorithms.- About the Authors. .
520 _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.
650 0 _aComputer science.
_99832
650 0 _aCryptography.
_91973
650 0 _aData encryption (Computer science).
_99168
650 0 _aMachine theory.
_9119733
650 0 _aComputer science
_xMathematics.
_93866
650 0 _aDiscrete mathematics.
_912873
650 0 _aAlgorithms.
_93390
650 1 4 _aTheory of Computation.
_9119734
650 2 4 _aCryptology.
_931769
650 2 4 _aFormal Languages and Automata Theory.
_9119735
650 2 4 _aDiscrete Mathematics in Computer Science.
_931837
650 2 4 _aAlgorithms.
_93390
710 2 _aSpringerLink (Online service)
_9119736
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783642226694
776 0 8 _iPrinted edition:
_z9783642226717
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v6650
_9119737
856 4 0 _uhttps://doi.org/10.1007/978-3-642-22670-0
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c90273
_d90273