DOCSLIB.ORG
  • Sign Up
  • Log In
  • Upload
  • Sign Up
  • Log In
  • Upload
  • Home
  • »  Tags
  • »  Oded Goldreich

Oded Goldreich

  • On the Randomness Complexity of Interactive Proofs and Statistical Zero-Knowledge Proofs*

    On the Randomness Complexity of Interactive Proofs and Statistical Zero-Knowledge Proofs*

  • LINEAR ALGEBRA METHODS in COMBINATORICS László Babai

    LINEAR ALGEBRA METHODS in COMBINATORICS László Babai

  • Foundations of Cryptography – a Primer Oded Goldreich

    Foundations of Cryptography – a Primer Oded Goldreich

  • A Note on Perfect Correctness by Derandomization⋆

    A Note on Perfect Correctness by Derandomization⋆

  • Counting T-Cliques: Worst-Case to Average-Case Reductions and Direct Interactive Proof Systems

    Counting T-Cliques: Worst-Case to Average-Case Reductions and Direct Interactive Proof Systems

  • Computational Complexity

    Computational Complexity

  • Complexity Theory and Cryptography Understanding the Foundations of Cryptography Is Understanding the Foundations of Hardness

    Complexity Theory and Cryptography Understanding the Foundations of Cryptography Is Understanding the Foundations of Hardness

  • Computational Complexity

    Computational Complexity

  • The Complexity of Estimating Min-Entropy

    The Complexity of Estimating Min-Entropy

  • Computational Complexity: a Modern Approach PDF Book

    Computational Complexity: a Modern Approach PDF Book

  • Brief Professional Biography

    Brief Professional Biography

  • Notes on Levin's Theory of Average-Case Complexity

    Notes on Levin's Theory of Average-Case Complexity

  • Communication Complexity with Defective Randomness

    Communication Complexity with Defective Randomness

  • 2017 Knuth Prize Is Awarded to Oded Goldreich

    2017 Knuth Prize Is Awarded to Oded Goldreich

  • Foundations of Cryptography: Basic Tools Oded Goldreich Frontmatter More Information

    Foundations of Cryptography: Basic Tools Oded Goldreich Frontmatter More Information

  • Foundations of Cryptography { Teaching Notes

    Foundations of Cryptography { Teaching Notes

  • Foundations of Cryptography II: Basic Applications

    Foundations of Cryptography II: Basic Applications

  • ACM SIGACT Announces 2017 Awards Gödel, Knuth and Distinguished Service Prizes Recognize Contributions to Algorithms and Compu

    ACM SIGACT Announces 2017 Awards Gödel, Knuth and Distinguished Service Prizes Recognize Contributions to Algorithms and Compu

Top View
  • Computational Complexity
  • The Complexity of Differential Privacy
  • The Algorithmic Foundations of Differential Privacy
  • The Complexity of Estimating Min-Entropy
  • Pseudorandomness
  • A Tutorial on Concurrent Zero Knowledge∗
  • Proofs That Yield Nothing but Their Validity Or All Languages in NP Have Zero-Knowledge Proof Systems
  • A Call to German Parties Not to Equate Bds with Anti-Semitism
  • Ebook Download Tutorials on the Foundations of Cryptography : Dedicated to Oded Goldreich
  • Proof Beyond a Reasonable Doubt
  • Software Protection and Simulation on Oblivious Rams
  • Lovász and Wigderson Awarded 2021 Abel Prize
  • Why Philosophers Should Care About Computational Complexity
  • Zero-Knowledge Twenty Years After Its Invention
  • Foundations of Cryptography 89-856
  • Foundation of Cryptography (0368-4162-01), Intoduction Handout Mode
  • About the Authors of LNCS Volume 6650
  • How to Write a Paper


© 2024 Docslib.org    Feedback