- CS225: Pseudorandomness Prof. Salil Vadhan Lecture 11: Extractors vs. Hashing and Expanders.
- Computational Complexity # Salil Vadhan, Harvard University
- The Complexity of Zero Knowledge Salil Vadhan #
- CS221: Computational Complexity Prof. Salil Vadhan Lecture 14: More on NTIME(n) #= TIME(n) and
- CS 225: Pseudorandomness Prof. Salil Vadhan Problem Set 4
- CS 120/CSCI E-177: Introduction to Cryptography Salil Vadhan and Alon Rosen Oct. 26, 2006
- CS 221: Computational Complexity Prof. Salil Vadhan Lecture Notes 11
- Dense Subsets of Pseudorandom Sets Omer Reingold
- Derandomized Squaring of Graphs Eyal Rozenman
- Foundations and Trends R Vol. xx, No xx (xxxx) 1175
- arXiv:0806.1948v1[cs.DS]11Jun2008 Tight Bounds for Hashing Block Sources
- CS221: Computational Complexity Prof. Salil Vadhan Lecture 20: Circuit Complexity
- New Proofs of the GreenTaoZiegler Dense Model Theorem: An Exposition
- CS225: Pseudorandomness Prof. Salil Vadhan Lecture 9 (revised)
- Dense Subsets of Pseudorandom Sets [Extended Abstract]
- AM 106/206: Applied Algebra Prof. Salil Vadhan Problem Set 5
- CS221: Computational Complexity Prof. Salil Vadhan Lecture 29: P#P
- Foundations and Trends R Vol. xx, No xx (xxxx) 171
- Checking Polynomial Identities over any Field: Towards a Derandomization?
- CS225: Pseudorandomness Prof. Salil Vadhan Lecture 2: Randomized Algorithms and Complexity Classes
- CS221: Computational Complexity Prof. Salil Vadhan Lecture 30: ArthurMerlin Games
- Rapidly Mixing Markov Chains and their Applications
- CS 225: Pseudorandomness Prof. Salil Vadhan Problem Set 1
- CS225: Pseudorandomness Prof. Salil Vadhan Lecture 17: Pseudorandom Generators
- CS221: Computational Complexity Prof. Salil Vadhan Lecture 13: The Polynomial Hierarchy
- CS221: Computational Complexity Prof. Salil Vadhan Lecture 28: Interactive Proof Systems, Graph Nonisomorphism
- AM 106/206: Applied Algebra Prof. Salil Vadhan Lecture Notes 2
- CS225: Pseudorandomness Prof. Salil Vadhan Lecture 22: Black-Box PRG Constructions and Extractors
- CS 221: Computational Complexity Prof. Salil Vadhan Lecture Notes 13
- CS 225: Pseudorandomness Prof. Salil Vadhan Problem Set 3
- CS221: Computational Complexity Prof. Salil Vadhan Lecture 15: EXPSPACECompleteness
- CS221: Computational Complexity Prof. Salil Vadhan Lecture 20: Circuit Complexity
- CS225: Pseudorandomness Prof. Salil Vadhan Lecture 13: More Connections with Expanders
- Simpler Session-Key Generation from Short Random Passwords Minh-Huyen Nguyen y Salil Vadhan z
- CS221: Computational Complexity Prof. Salil Vadhan Lecture 22: Parity is not in AC 0
- Derandomized Squaring of Graphs # Eyal Rozenman
- CS 225: Pseudorandomness Prof. Salil Vadhan Problem Set 5
- CS 225: Pseudorandomness Prof. Salil Vadhan Problem Set 6
- Why Simple Hash Functions Work: Exploiting the Entropy in a Data Stream
- On the Complexity of Differentially Private Data Release Efficient Algorithms and Hardness Results
- AM 106/206: Applied Algebra Prof. Salil Vadhan Lecture Notes 20
- AM 106/206: Applied Algebra Prof. Salil Vadhan Problem Set 4
- Extracting Randomness from Samplable Distributions Luca Trevisan \Lambda Salil Vadhan y
- CS221: Computational Complexity Prof. Salil Vadhan Lecture 17: Randomized Complexity
- CS221: Computational Complexity Prof. Salil Vadhan Lecture 33: Hastad's Optimal PCP,
- Statistically Hiding Commitments and Statistical ZeroKnowledge Arguments
- Statistical ZeroKnowledge Arguments for NP from Any OneWay Function # (Extended Abstract)
- On Approximating the Entropy of Polynomial Mappings Dan Gutfreund2
- Computational Differential Privacy Ilya Mironov1
- CS 225: Pseudorandomness Prof. Salil Vadhan Problem Set 5
- CS 120/CSCI E-177: Introduction to Cryptography Problem Set 2
- Concurrent Zero Knowledge without Complexity Assumptions Daniele Micciancio
- CS225: Pseudorandomness Prof. Salil Vadhan Lecture 1: Introduction
- "Marge, I agree with you -in theory. In theory, communism works. In theory." --Homer Simpson CS359G Lecture 5: Characters of Abelian Groups
- CS 120/CSCI E-177: Introduction to Cryptography Problem Set 4
- CS221: Computational Complexity Prof. Salil Vadhan Lecture 9: Savitch's theorem, NL = co-NL
- CS225: Pseudorandomness Prof. Salil Vadhan Lecture 20: Locally Decodable Codes
- Derandomization in Cryptography Weizmann Institute of Science
- Short PCPs Verifiable in Polylogarithmic Time Eli Ben-Sasson
- Composition of Zero-Knowledge Proofs with Efficient Provers
- S-T Connectivity on Digraphs with a Known Stationary Distribution Kai-Min Chung
- S-T Connectivity on Digraphs with a Known Stationary Distribution
- Improved Delegation of Computation using Fully Homomorphic Encryption
- Improved Delegation of Computation using Fully Homomorphic Encryption
- Proofs of Retrievability via Hardness Amplification Yevgeniy Dodis1
- Boosting and Differential Privacy Cynthia Dwork, Guy N. Rothblum, Salil Vadhan
- Random Selection with an Adversarial Majority Ronen Gradwohl1
- Unbalanced Expanders and Randomness Extractors from ParvareshVardy Codes
- Unbalanced Expanders and Randomness Extractors from ParvareshVardy Codes
- Universal One-Way Hash Functions via Inaccessible Entropy
- SIAM J. COMPUT. c 2009 Society for Industrial and Applied Mathematics Vol. 39, No. 3, pp. 11531218
- Efficiency Improvements in Constructing Pseudorandom Generators from One-way Functions
- Inaccessible Entropy Iftach Haitner
- Using Nondeterminism to Amplify Hardness Alexander Healy
- Checking Polynomial Identities over any Field: Towards a Derandomization?
- The Limits of Two-Party Differential Privacy Andrew McGregor, Ilya Mironov, Toniann Pitassi, Omer Reingold, Kunal Talwar, Salil Vadhan
- Why Simple Hash Functions Work: Exploiting the Entropy in a Data Stream
- Statistical Zero-Knowledge Arguments for NP from Any One-Way Function (Extended Abstract)
- Zero Knowledge with Efficient Provers Minh-Huyen Nguyen
- Fairness with an Honest Minority and a Rational Majority
- Fairness with an Honest Minority and a Rational Majority
- Zero Knowledge and Soundness are Symmetric Shien Jin Ong Salil Vadhan
- Pseudorandom Walks on Regular Digraphs and the RL vs. L Problem
- The Hardness of the Expected Decision Depth In memory of the second author's loving father, Yaakov (Yasha) Rosenfeld
- Are PCPs Inherent in Efficient Arguments? Guy N. Rothblum
- The Round Complexity of Two-Party Random Selection Saurabh Sanghvi
- The Computational Complexity of Nash Equilibria in Concisely Represented Games
- The Computational Complexity of Nash Equilibria in Concisely Represented Games
- Regularity, Boosting, and Efficiently Simulating Every High-Entropy Distribution
- Pseudorandomness and Average-case Complexity via Uniform Reductions
- Extracting Randomness from Samplable Distributions Luca Trevisan Salil Vadhany
- Foundations and Trends R Vol. xx, No xx (xxxx) 1180
- Foundations and Trends R Vol. xx, No xx (xxxx) 1175
- The Power of Randomness Before we study the derandomization of randomized algorithms, we will need some algorithms to
- The Unified Theory of Pseudorandomness Salil Vadhan
- CS 225: Pseudorandomness Prof. Salil Vadhan Problem Set 3
- CS 225: Pseudorandomness Prof. Salil Vadhan Problem Set 4
- CS 225: Pseudorandomness Prof. Salil Vadhan Problem Set 5
- CS 225: Pseudorandomness Problem Set 6 (Take-Home Final)
- The Power of Randomness 2.1 Polynomial Identity Testing
- Expander Graphs Now that we have seen a variety of basic derandomization techniques, we will move on to study
- CS 225: Pseudorandomness Prof. Salil Vadhan Problem Set 3
- CS 225: Pseudorandomness Prof. Salil Vadhan Problem Set 5
- CS225: Pseudorandomness Prof. Salil Vadhan Lecture 2: Randomized Algorithms and Complexity Classes
- CS225: Pseudorandomness Prof. Salil Vadhan Lecture 5: Basic Derandomization Techniques
- CS225: Pseudorandomness Prof. Salil Vadhan Lecture 6: Basic Derandomization Techniques II
- CS225: Pseudorandomness Prof. Salil Vadhan Lecture 23: Conclusions & Beyond
- CS 225: Pseudorandomness Prof. Salil Vadhan Problem Set 1
- CS 225: Pseudorandomness Prof. Salil Vadhan Problem Set 2
- CS 225: Pseudorandomness Prof. Salil Vadhan Problem Set 3
- CS 225: Pseudorandomness Prof. Salil Vadhan Problem Set 4
- CS 120/CSCI E-177: Introduction to Cryptography Salil Vadhan and Alon Rosen September 19, 2006
- CS 120/CSCI E-177: Introduction to Cryptography Salil Vadhan and Alon Rosen Sept. 21 & 26, 2006
- CS 120/CSCI E-177: Introduction to Cryptography Problem Set 3
- CS 120: Introduction to Cryptography Salil Vadhan and Alon Rosen Oct. 19, 2006
- CS 120/CSCI E-177: Introduction to Cryptography Salil Vadhan and Alon Rosen Oct. 31, 2006
- CS 120/CSCI E-177: Introduction to Cryptography Problem Set 5
- CS 120/CSCI E-177: Introduction to Cryptography Salil Vadhan and Alon Rosen Nov. 7, 2006
- CS 120/CSCI E-177: Introduction to Cryptography Salil Vadhan and Alon Rosen Nov. 14, 2006
- CS 120/ E-177: Introduction to Cryptography Salil Vadhan and Alon Rosen Nov. 22, 2006
- CS 120/CSCI E-177: Introduction to Cryptography Problem Set 7
- CS 120/ E-177: Introduction to Cryptography Salil Vadhan and Alon Rosen Nov. 22, 2006
- CS 120/ E-177: Introduction to Cryptography Salil Vadhan and Alon Rosen Dec. 4, 2006
- CS 120/ E-177: Introduction to Cryptography Salil Vadhan and Alon Rosen Dec. 12, 2006
- CS 120/ E-177: Introduction to Cryptography Salil Vadhan and Alon Rosen Dec. 14, 2006
- CS 120/ E-177: Introduction to Cryptography Salil Vadhan and Alon Rosen Dec. 18, 2006
- AM 106/206: Applied Algebra Prof. Salil Vadhan Lecture Notes 1
- AM 106/206: Applied Algebra Prof. Salil Vadhan Problem Set 1
- AM 106/206: Applied Algebra Prof. Salil Vadhan Lecture Notes 3
- AM 106/206: Applied Algebra Prof. Salil Vadhan Lecture Notes 4
- AM 106/206: Applied Algebra Prof. Salil Vadhan Lecture Notes 9
- AM 106/206: Applied Algebra Prof. Salil Vadhan Problem Set 4
- AM 106/206: Applied Algebra Prof. Salil Vadhan Lecture Notes 11
- AM 106/206: Applied Algebra Prof. Salil Vadhan Lecture Notes 12
- AM 106/206: Applied Algebra Prof. Salil Vadhan Problem Set 6
- AM 106/206: Applied Algebra Prof. Salil Vadhan Problem Set 7
- AM 106/206: Applied Algebra Prof. Salil Vadhan Lecture Notes 21
- AM 106/206: Applied Algebra Prof. Salil Vadhan Lecture Notes 22
- AM 106/206: Applied Algebra Prof. Salil Vadhan Problem Set 10
- AM 106/206: Applied Algebra Prof. Salil Vadhan Lecture Notes 1
- AM 106/206: Applied Algebra Prof. Salil Vadhan Problem Set 2
- AM 106/206: Applied Algebra Prof. Salil Vadhan Lecture Notes 6
- AM 106/206: Applied Algebra Prof. Salil Vadhan Problem Set 4
- AM 106/206: Applied Algebra Prof. Salil Vadhan Lecture Notes 12
- AM 106/206: Applied Algebra Prof. Salil Vadhan Lecture Notes 13
- AM 106/206: Applied Algebra Prof. Salil Vadhan Lecture Notes 16
- AM 106/206: Applied Algebra Prof. Salil Vadhan Problem Set 7
- AM 106/206: Applied Algebra Prof. Salil Vadhan Problem Set 8
- CS 221: Computational Complexity Prof. Salil Vadhan Problem Set 0
- CS 221: Computational Complexity Prof. Salil Vadhan Lecture Notes 2
- CS 221: Computational Complexity Prof. Salil Vadhan Lecture Notes 3
- CS 221: Computational Complexity Prof. Salil Vadhan Lecture Notes 5
- CS 221: Computational Complexity Prof. Salil Vadhan Lecture Notes 6
- CS 221: Computational Complexity Prof. Salil Vadhan Lecture Notes 10
- CS 221: Computational Complexity Prof. Salil Vadhan Problem Set 3
- CS 221: Computational Complexity Prof. Salil Vadhan Lecture Notes 14
- CS 221: Computational Complexity Prof. Salil Vadhan Problem Set 4
- CS 221: Computational Complexity Prof. Salil Vadhan Lecture Notes 16
- CS 221: Computational Complexity Prof. Salil Vadhan Problem Set 5
- CS 221: Computational Complexity Prof. Salil Vadhan Lecture Notes 22
- CS 221: Computational Complexity Prof. Salil Vadhan Lecture Notes 24
- CS 221: Computational Complexity Prof. Salil Vadhan Lecture Notes 25
- CS 221: Computational Complexity Prof. Salil Vadhan Lecture Notes 26
- CS 221: Computational Complexity Prof. Salil Vadhan Lecture Notes 27
- CS221: Computational Complexity Prof. Salil Vadhan Lecture 5: Space and Nondeterminism
- CS221: Computational Complexity Prof. Salil Vadhan Lecture 10: Alternation
- CS221: Computational Complexity Prof. Salil Vadhan Lecture 13: The Polynomial Hierarchy
- CS221: Computational Complexity Prof. Salil Vadhan Lecture 14: More on NTIME(n) = TIME(n) and
- CS221: Computational Complexity Prof. Salil Vadhan Lecture 16: Recap, Overview, Relativization,
- CS221: Computational Complexity Prof. Salil Vadhan Lecture 22: AC
- CS221: Computational Complexity Prof. Salil Vadhan Lecture 24: Counting Problems
- CS221: Computational Complexity Prof. Salil Vadhan Lecture 31: Multiprover Interactive Proofs and
- CS221: Computational Complexity Prof. Salil Vadhan Lecture 32: The PCP Theorem and
- CS221: Computational Complexity Prof. Salil Vadhan Lecture 33: Hastad's Optimal PCP,
- CS221: Computational Complexity Prof. Salil Vadhan Lecture 35: The PCP Theorem and Final Thoughts
- Deterministic Extractors For Small-Space Sources Jesse Kamp
- CS221: Computational Complexity Prof. Salil Vadhan Lecture 2: Turing Machines,Computational Problems,
- CS221: Computational Complexity Prof. Salil Vadhan Lecture 15: EXPSPACE-Completeness
- The Complexity of Counting in Sparse, Regular, and Planar Graphs
- The Complexity of Counting A Thesis presented
- Amplifying Collision Resistance: A ComplexityTheoretic Treatment
- CS225: Pseudorandomness Prof. Salil Vadhan Lecture 12: Constructing Extractors
- CS 225: Pseudorandomness Prof. Salil Vadhan Problem Set 2
- CS221: Computational Complexity Prof. Salil Vadhan Lecture 13: Does the PH collapse? and an application of
- CS 225: Pseudorandomness Prof. Salil Vadhan Problem Set 1
- CS 120/ E-177: Introduction to Cryptography Salil Vadhan and Alon Rosen Oct. 17, 2006
- AM 106/206: Applied Algebra Prof. Salil Vadhan Lecture Notes 7
- A Lower Bound on List Size for List Decoding Venkatesan Guruswami and Salil Vadhan
- Proceedings of the International Congress of Mathematicians Hyderabad, India, 2010
- Why Simple Hash Functions Work: Exploiting the Entropy in a Data Stream
- AM 106/206: Applied Algebra Prof. Salil Vadhan Problem Set 8
- AM 106/206: Applied Algebra Prof. Salil Vadhan Problem Set 0
- Regularity, Boosting, and Efficiently Simulating Every High-Entropy Distribution
- Simpler Session-Key Generation from Short Random Passwords
- CS 221: Computational Complexity Prof. Salil Vadhan Problem Set 1
- CS 120/ E-177: Introduction to Cryptography Salil Vadhan and Alon Rosen Oct. 5, 2006
- CS 225: Pseudorandomness Prof. Salil Vadhan Problem Set 4
- CS225: Pseudorandomness Prof. Salil Vadhan Lecture 23: Conclusions & Beyond
- CS225: Pseudorandomness Prof. Salil Vadhan Lecture 18: PRGs from Average-Case Hardness
- Pseudorandom Bit Generators that Fool Modular Sums Extended Abstract
- CS221: Computational Complexity Prof. Salil Vadhan Lecture 6: Nondeterministic Time
- Why Simple Hash Functions Work: Exploiting the Entropy in a Data Stream
- Deterministic Extractors For SmallSpace Sources Jesse Kamp #
- CS221: Computational Complexity Prof. Salil Vadhan Lecture 18: Randomized Computation
- An Unconditional Study of Computational Zero Knowledge # Salil P. Vadhan +
- CS221: Computational Complexity Prof. Salil Vadhan Lecture 9: Savitch's theorem, NL = co-NL
- An Improved Pseudorandom Generator Based on Hardness of Factoring
- Zero Knowledge with Efficient Provers MinhHuyen Nguyen #
- CS225: Pseudorandomness Prof. Salil Vadhan Lecture 22: BlackBox PRG Constructions and Extractors
- AM 106/206: Applied Algebra Prof. Salil Vadhan Lecture Notes 2
- Lower Bounds for Non-Black-Box Zero Knowledge Yehuda Lindell
- Pseudorandom Bit Generators that Fool Modular Sums
- CS 120/CSCI E-177: Introduction to Cryptography Problem Set 1
- Random Selection with an Adversarial Majority # Ronen Gradwohl +
- An Unconditional Study of Computational Zero Knowledge Salil P. Vadhan
- AM 106/206: Applied Algebra Prof. Salil Vadhan Lecture Notes 8
- COMPRESSION OF SAMPLABLE Luca Trevisan, Salil Vadhan, and David Zuckerman
- Random Selection with an Adversarial Majority Ronen Gradwohl
- CS221: Computational Complexity Prof. Salil Vadhan Lecture 30: Arthur-Merlin Games
- Basic Derandomization Techniques In the previous chapter, we saw some striking examples of the power of randomness for the design
- AM 106/206: Applied Algebra Prof. Salil Vadhan Problem Set 1
- Basic Derandomization Techniques In the previous chapter, we saw some striking examples of the power of randomness for the design
- CS 120/CSCI E-177: Introduction to Cryptography Problem Set 9
- Inaccessible Entropy Iftach Haitner
- Pseudorandom generators without the XOR Lemma Madhu Sudan y Luca Trevisan z Salil Vadhan x
- CS221: Computational Complexity Prof. Salil Vadhan Lecture 34: More Hardness of Approximation,
- CS221: Computational Complexity Prof. Salil Vadhan Lecture 13: Does the PH collapse? and an application of
- Manipulating Statistical Difference Amit Sahai and Salil Vadhan
- CS225: Pseudorandomness Prof. Salil Vadhan Lecture 16: List-Decodable Codes vs. Extractors & Expanders
- A Lower Bound on List Size for List Decoding # Venkatesan Guruswami +
- CS225: Pseudorandomness Prof. Salil Vadhan Lecture 11: Extractors vs. Hashing and Expanders.
- CS221: Computational Complexity Prof. Salil Vadhan Lecture 7: Completeness
- CS221: Computational Complexity Prof. Salil Vadhan Lecture 21: Circuit Depth and Simultaneous
- CS221: Computational Complexity Prof. Salil Vadhan Lecture 19: Circuit Complexity
- AM 106/206: Applied Algebra Prof. Salil Vadhan Lecture Notes 6
- ARE PCPS INHERENT IN EFFICIENT Guy N. Rothblum and Salil Vadhan
- CS 120/CSCI E-177: Introduction to Cryptography Salil Vadhan and Alon Rosen Oct. 3, 2006
- CS221: Computational Complexity Prof. Salil Vadhan Lecture 19: Circuit Complexity
- On Constructing Locally Computable Extractors and Cryptosystems in the Bounded Storage Model #
- AM 106/206: Applied Algebra Prof. Salil Vadhan Lecture Notes 5
- CS221: Computational Complexity Prof. Salil Vadhan Lecture 31: Multiprover Interactive Proofs and
- CS 225: Pseudorandomness Prof. Salil Vadhan Problem Set 1
- CS221: Computational Complexity Prof. Salil Vadhan Lecture 32: The PCP Theorem and
- Random Selection with an Adversarial Majority # Ronen Gradwohl 1## , Salil Vadhan 2# # # , and David Zuckerman 3+
- AM 106/206: Applied Algebra Prof. Salil Vadhan Lecture Notes 18
- Using Nondeterminism to Amplify Hardness # Alexander Healy + Salil Vadhan #
- CS221: Computational Complexity Prof. Salil Vadhan Lecture 16: Recap, Overview, Relativization,
- AM 106/206: Applied Algebra Prof. Salil Vadhan Lecture Notes 13
- AM 106/206: Applied Algebra Prof. Salil Vadhan Lecture Notes 10
- Deterministic Extractors For Small-Space Sources Jesse Kamp
- AM 106/206: Applied Algebra Prof. Salil Vadhan Lecture Notes 3
- CS221: Computational Complexity Prof. Salil Vadhan Lecture 28: Interactive Proof Systems, Graph Nonisomorphism
- CS225: Pseudorandomness Prof. Salil Vadhan Lecture 14: Error-Correcting Codes
- CS225: Pseudorandomness Prof. Salil Vadhan Lecture 14: ErrorCorrecting Codes
- CS221: Computational Complexity Prof. Salil Vadhan Lecture 24: Counting Problems
- CS221: Computational Complexity Prof. Salil Vadhan Lecture 25: Counting Problems (cont.)
- CS 221: Computational Complexity Prof. Salil Vadhan Lecture Notes 12
- CS 225: Pseudorandomness Prof. Salil Vadhan Problem Set 6
- A Lower Bound on List Size for List Decoding Venkatesan Guruswami
- On Extractors and Exposure-Resilient Functions for Sublogarithmic Entropy
- AM 106/206: Applied Algebra Prof. Salil Vadhan Lecture Notes 14
- Computational Complexity Salil Vadhan, Harvard University
- CS 225: Pseudorandomness Prof. Salil Vadhan Problem Set 6
- Probabilistic Proof Systems { Part I 1 Lecture 1. Interactive Proofs 1
- CS225: Pseudorandomness Prof. Salil Vadhan Lecture 16: ListDecodable Codes vs. Extractors & Expanders
- CS225: Pseudorandomness Prof. Salil Vadhan Lecture 3: Sampling and Approximation Problems
- The Round Complexity of TwoParty Random Selection # Saurabh Sanghvi + Salil Vadhan #
- AM 106/206: Applied Algebra Prof. Salil Vadhan Lecture Notes 17
- CS221: Computational Complexity Prof. Salil Vadhan Lecture 4: More Hierarchy Theorems
- CS225: Pseudorandomness Prof. Salil Vadhan Lecture 15: ListDecoding Algorithms
- ON INTERACTIVE PROOFS WITH A LACONIC PROVER
- CS 120/ E-177: Introduction to Cryptography Salil Vadhan and Alon Rosen Oct. 12, 2006
- CS 221: Computational Complexity Prof. Salil Vadhan Lecture Notes 19
- CS 120/ E-177: Introduction to Cryptography Salil Vadhan and Alon Rosen Dec. 12, 2006
- CS221: Computational Complexity Prof. Salil Vadhan Lecture 11: PSPACEcompleteness and the
- Using Nondeterminism to Amplify Hardness # Alexander Healy + Salil Vadhan #
- Simpli ed derandomization of BPP using a hitting set generator Oded Goldreich y Salil Vadhan z Avi Wigderson x
- Randomness Conductors and ConstantDegree Lossless [Extended Abstract] #
- CS221: Computational Complexity Prof. Salil Vadhan Lecture 2: Turing Machines,Computational Problems,
- Randomness Extractors Randomness extractors are functions that extract almost-uniform bits from sources of biased and
- On Extractors and Exposure-Resilient Functions for Sublogarithmic Entropy
- CS 120/CSCI E-177: Introduction to Cryptography Salil Vadhan and Alon Rosen Nov. 16, 2006
- [Adl] L. Adleman. Two theorems on random polynomial time. In 19th Annual Symposium on Foundations of Computer Science (Ann Arbor, Mich., 1978), pages 7583. IEEE, Long Beach, Calif., 1978.
- CS 221: Computational Complexity Prof. Salil Vadhan Lecture Notes 9
- CS221: Computational Complexity Prof. Salil Vadhan Lecture 21: Circuit Depth and Simultaneous
- On Approximating the Entropy of Polynomial Mappings Dan Gutfreund
- CS221: Computational Complexity Prof. Salil Vadhan Lecture 18: Randomized Computation
- Expander Graphs Now that we have seen a variety of basic derandomization techniques, we will move on to study
- CS 221: Computational Complexity Prof. Salil Vadhan Lecture Notes 7
- Efficiency Improvements in Constructing Pseudorandom Generators from One-way Functions
- AM 106/206: Applied Algebra Prof. Salil Vadhan Problem Set 3
- CS225: Pseudorandomness Prof. Salil Vadhan Lecture 4: Random Walks
- CS225: Pseudorandomness Prof. Salil Vadhan Lecture 10: Randomness Extractors
- Zero Knowledge and Soundness are Symmetric Shien Jin Ong and Salil Vadhan
- CS 120/CSCI E-177: Introduction to Cryptography Salil Vadhan and Alon Rosen Sept. 21, 2006
- Tight Bounds for Hashing Block Sources Kai-Min Chung and Salil Vadhan
- CS221: Computational Complexity Prof. Salil Vadhan Lecture ???: Completeness in P, NP and NL
- CS 225: Pseudorandomness Prof. Salil Vadhan Problem Set 5
- CS221: Computational Complexity Prof. Salil Vadhan Lecture 27: AverageCase Complexity, LowDegree Extensions
- CS225: Pseudorandomness Prof. Salil Vadhan Lecture 9 (revised): Explicit Constructions of Expanders
- Randomnessefficient Low Degree Tests and Short PCPs via EpsilonBiased Sets
- An Unconditional Study of Computational Zero Knowledge # Salil P. Vadhan +
- CS225: Pseudorandomness Prof. Salil Vadhan Lecture 5: Basic Derandomization Techniques
- Comparing Entropies in Statistical Zero Knowledge with Applications to the Structure of SZK
- PSEUDORANDOMNESS AND AVERAGECASE COMPLEXITY VIA
- Robust PCPs of Proximity, Shorter PCPs and Applications to Coding
- CS 120/CSCI E-177: Introduction to Cryptography Problem Set 6
- CS 120/CSCI E-177: Introduction to Cryptography Problem Set 8
- AM 106/206: Applied Algebra Prof. Salil Vadhan Lecture Notes 18
- CS225: Pseudorandomness Prof. Salil Vadhan Lecture 12: Constructing Extractors
- Robust PCPs of Proximity, Shorter PCPs and Applications to Coding #
- Derandomization in Cryptography Boaz Barak #
- CS225: Pseudorandomness Prof. Salil Vadhan Lecture 21: Local ListDecoding
- CS221: Computational Complexity Prof. Salil Vadhan Lecture 25: Counting Problems (cont.)
- CS221: Computational Complexity Prof. Salil Vadhan Lecture 26: Average Case Complexity,
- An Equivalence between Zero Knowledge and Commitments
- AM 106/206: Applied Algebra Prof. Salil Vadhan Lecture Notes 15
- On Constructing Locally Computable Extractors and Cryptosystems in the Bounded Storage Model
- CS225: Pseudorandomness Prof. Salil Vadhan Lecture 8: Random Walks on Expanders
- CS 221: Computational Complexity Prof. Salil Vadhan Lecture Notes 17
- Extractors: Optimal up to Constant Factors Institute of Information Science,
- On Transformations of Interactive Proofs that Preserve the Prover's Salil Vadhan
- Why Simple Hash Functions Work: Exploiting the Entropy in a Data Stream #
- CS225: Pseudorandomness Prof. Salil Vadhan Lecture 19: Worstcase vs. Averagecase Hardness
- The Complexity of Counting in Sparse, Regular, and Planar Graphs Salil P. Vadhan
- CS221: Computational Complexity Prof. Salil Vadhan Lecture 6: Nondeterministic Time
- An Improved Pseudorandom Generator Based on Hardness of Factoring
- CS225: Pseudorandomness Prof. Salil Vadhan Lecture 19: Worst-case vs. Average-case Hardness
- Foundations and Trends R Vol. xx, No xx (xxxx) 185
- CS 225: Pseudorandomness Prof. Salil Vadhan Problem Set 2
- Limitations of Hardness vs. Randomness under Uniform Reductions
- CS221: Computational Complexity Prof. Salil Vadhan Lecture 27: Average-Case Complexity, Low-Degree Extensions
- CS 221: Computational Complexity Prof. Salil Vadhan Lecture Notes 1
- CS225: Pseudorandomness Prof. Salil Vadhan Lecture 3: Sampling and Approximation Problems
- Copyright by SIAM. Unauthorized reproduction of this article is prohibited. SIAM J. COMPUT. c 2008 Society for Industrial and Applied Mathematics
- AM 106/206: Applied Algebra Prof. Salil Vadhan Problem Set 5
- CS 225: Pseudorandomness Prof. Salil Vadhan Problem Set 6
- Using Nondeterminism to Amplify Hardness Alexander Healy
- CS221: Computational Complexity Prof. Salil Vadhan Lecture 4: More Hierarchy Theorems
- AM 106/206: Applied Algebra Prof. Salil Vadhan Problem Set 9
- Computational Complexity Salil Vadhan
- CS225: Pseudorandomness Prof. Salil Vadhan Lecture 7: Expander Graphs
- CS 120/CSCI E-177: Introduction to Cryptography Salil Vadhan and Alon Rosen Sept. 28, 2006
- AM 106/206: Applied Algebra Prof. Salil Vadhan Problem Set 6
- CS221: Computational Complexity Prof. Salil Vadhan Lecture 22: Parity is not in AC0
- When and How Can Data be Efficiently Released with Privacy? Cynthia Dwork Moni Naor
- AM 106/206: Applied Algebra Prof. Salil Vadhan Problem Set 3
- On Extractors and Exposure-Resilient Functions for Sublogarithmic Entropy
- CS 221: Computational Complexity Prof. Salil Vadhan Lecture Notes 18
- AM 106/206: Applied Algebra Prof. Salil Vadhan Lecture Notes 19
- CS221: Computational Complexity Prof. Salil Vadhan Lecture 34: More Hardness of Approximation,
- CS 221: Computational Complexity Prof. Salil Vadhan Lecture Notes 23
- CS225: Pseudorandomness Prof. Salil Vadhan Lecture 6: Basic Derandomization Techniques II
- CS225: Pseudorandomness Prof. Salil Vadhan Lecture 20: Locally Decodable Codes
- CS 225: Pseudorandomness Prof. Salil Vadhan Problem Set 2
- CS225: Pseudorandomness Prof. Salil Vadhan Lecture 8: Random Walks on Expanders
- Lower Bounds for NonBlackBox Zero Knowledge # Boaz Barak + Yehuda Lindell # Salil Vadhan
- CS221: Computational Complexity Prof. Salil Vadhan Lecture 10: NSPACE, Current Map of Classes,
- The Power of a Pebble: Exploring and Mapping Directed Graphs
- The Round Complexity of TwoParty Random Selection # Saurabh Sanghvi + Salil Vadhan #
- Introduction 1.1 Overview of this Survey
- Are PCPs Inherent in Efficient Arguments? Guy N. Rothblum
- CS 221: Computational Complexity Prof. Salil Vadhan Lecture Notes 15
- AM 106/206: Applied Algebra Prof. Salil Vadhan Lecture Notes 8
- The Computational Complexity of Nash Equilibria in Concisely Represented Games
- AM 106/206: Applied Algebra Prof. Salil Vadhan Lecture Notes 19
- CS225: Pseudorandomness Prof. Salil Vadhan Lecture 17: Pseudorandom Generators
- CS225: Pseudorandomness Prof. Salil Vadhan Lecture 4: Random Walks
- CS221: Computational Complexity Prof. Salil Vadhan Lecture 5: Space and Nondeterminism
- Extractors and condensers from univariate polynomials Venkatesan Guruswami #
- Extracting Randomness from Samplable Distributions EXTENDED ABSTRACT
- COMPRESSION OF SAMPLABLE Luca Trevisan, Salil Vadhan, and David Zuckerman
- CS225: Pseudorandomness Prof. Salil Vadhan Lecture 7: Expander Graphs
- Short PCPs Verifiable in Polylogarithmic Time Eli BenSasson # Oded Goldreich + Prahladh Harsha # Madhu Sudan
- Pseudorandomness and Averagecase Complexity via Uniform Reductions #
- CS221: Computational Complexity Prof. Salil Vadhan Lecture 35: The PCP Theorem and Final Thoughts
- AM 106/206: Applied Algebra Prof. Salil Vadhan Lecture Notes 10
- Extractors and condensers from univariate polynomials Venkatesan Guruswami
- AM 106/206: Applied Algebra Prof. Salil Vadhan Lecture Notes 16
- CS 221: Computational Complexity Prof. Salil Vadhan Problem Set 2
- CS 221: Computational Complexity Prof. Salil Vadhan Lecture Notes 20
- CS225: Pseudorandomness Prof. Salil Vadhan Lecture 13: More Connections with Expanders
- CS 221: Computational Complexity Problem Set 6 (Take-Home Final)
- The Complexity of Zero Knowledge Salil Vadhan
- CS 221: Computational Complexity Prof. Salil Vadhan Lecture Notes 4
- Statistically Hiding Commitments and Statistical Zero-Knowledge Arguments
- CS 120: Introduction to Cryptography Salil Vadhan and Alon Rosen Oct. 19, 2006
- CS225: Pseudorandomness Prof. Salil Vadhan Lecture 1: Introduction
- CS 225: Pseudorandomness Prof. Salil Vadhan Problem Set 4
- Simpler Session-Key Generation from Short Random Passwords #
- The Computational Complexity of Nash Equilibria in Concisely Represented Games #
- The Computational Complexity of Nash Equilibria in Concisely Represented Games #
- CS225: Pseudorandomness Prof. Salil Vadhan Lecture 10: Randomness Extractors
- The Unified Theory of Pseudorandomness # Salil Vadhan +
- CS221: Computational Complexity Prof. Salil Vadhan Lecture 29: P #P
- PSEUDORANDOMNESS AND AVERAGE-CASE COMPLEXITY VIA
- AM 106/206: Applied Algebra Prof. Salil Vadhan Lecture Notes 20
- Foundations and Trends R Vol. xx, No xx (xxxx) 182
- List-Decodable Codes The field of coding theory is motivated by the problem of communicating reliably over noisy chan-
- An Unconditional Study of Computational Zero Knowledge Salil P. Vadhan
- CS225: Pseudorandomness Prof. Salil Vadhan Lecture 21: Local List-Decoding
- CS 221: Computational Complexity Prof. Salil Vadhan Lecture Notes 8
- Pseudorandom Generators 7.1 Motivation and Definition
- CS 221: Computational Complexity Prof. Salil Vadhan Lecture Notes 21
- PCPs and the Hardness of Generating Synthetic Data Jonathan Ullman Salil Vadhan
- CS 225: Pseudorandomness Prof. Salil Vadhan Problem Set 1
- A Complete Problem for Statistical Zero Knowledge Amit Sahai y Salil Vadhan z
- CS225: Pseudorandomness Prof. Salil Vadhan Lecture 18: PRGs from AverageCase Hardness
- CS221: Computational Complexity Prof. Salil Vadhan Lecture 22: AC
- Verifiable Random Functions Silvio Micali \Lambda Michael Rabin y Salil Vadhan z
- CS 225: Pseudorandomness Prof. Salil Vadhan Problem Set 3
- CS225: Pseudorandomness Prof. Salil Vadhan Lecture 15: List-Decoding Algorithms
- AM 106/206: Applied Algebra Prof. Salil Vadhan Lecture Notes 5
- CS221: Computational Complexity Prof. Salil Vadhan Lecture 17: Randomized Complexity
- AM 106/206: Applied Algebra Prof. Salil Vadhan Lecture Notes 17
- AM 106/206: Applied Algebra Prof. Salil Vadhan Lecture Notes 9
- Fairness with an Honest Minority and a Rational Majority
- Time-Lock Puzzles in the Random Oracle Model Mohammad Mahmoody1
