Book Volume 6650 2011

Studies in Complexity and Cryptography. Miscellanea on the Interplay between Randomness and Computation

In Collaboration with Lidor Avigad, Mihir Bellare, Zvika Brakerski, Shafi Goldwasser, Shai Halevi, Tali Kaufman, Leonid Levin, Noam Nisan, Dana Ron, Madhu Sudan, Luca Trevisan, Salil Vadhan, Avi Wigderson, David Zuckerman

Editors:

ISBN: 978-3-642-22669-4 (Print) 978-3-642-22670-0 (Online)

Table of contents (36 chapters)

previous Page of 2
  1. Front Matter

    Pages -

  2. Research Contributions

    1. No Access

      Chapter

      Pages 1-5

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

    2. No Access

      Chapter

      Pages 6-12

      Proving Computational Ability

    3. No Access

      Chapter

      Pages 13-25

      On Constructing 1-1 One-Way Functions

    4. No Access

      Chapter

      Pages 26-29

      On the Circuit Complexity of Perfect Hashing

    5. No Access

      Chapter

      Pages 30-39

      Collision-Free Hashing from Lattice Problems

    6. No Access

      Chapter

      Pages 40-53

      Another Proof That \(\mathcal{BPP}\subseteq \mathcal{PH}\) (and More)

    7. No Access

      Chapter

      Pages 54-58

      Strong Proofs of Knowledge

    8. No Access

      Chapter

      Pages 59-67

      Simplified Derandomization of BPP Using a Hitting Set Generator

    9. No Access

      Chapter

      Pages 68-75

      On Testing Expansion in Bounded-Degree Graphs

    10. No Access

      Chapter

      Pages 76-87

      Candidate One-Way Functions Based on Expander Graphs

    11. No Access

      Chapter

      Pages 88-97

      Using the FGLSS-Reduction to Prove Inapproximability Results for Minimum Vertex Cover in Hypergraphs

    12. No Access

      Chapter

      Pages 98-108

      The GGM Construction Does NOT Yield Correlation Intractable Function Ensembles

    13. No Access

      Chapter

      Pages 109-113

      From Logarithmic Advice to Single-Bit Advice

    14. No Access

      Chapter

      Pages 114-123

      On Probabilistic versus Deterministic Provers in the Definition of Proofs of Knowledge

    15. No Access

      Chapter

      Pages 124-135

      On the Average-Case Complexity of Property Testing

    16. No Access

      Chapter

      Pages 136-140

      A Candidate Counterexample to the Easy Cylinders Conjecture

    17. No Access

      Chapter

      Pages 141-155

      From Absolute Distinguishability to Positive Distinguishability

    18. No Access

      Chapter

      Pages 156-172

      Testing Graph Blow-Up

    19. No Access

      Chapter

      Pages 173-190

      Proximity Oblivious Testing and the Role of Invariances

    20. No Access

      Chapter

      Pages 191-232

      In a World of P=BPP

previous Page of 2