The following pages link to Salil P. Vadhan (Q383730):
Displaying 50 items.
- (Q202086) (redirect page) (← links)
- A study of statistical zero-knowledge proofs (to appear) (Q383731) (← links)
- Are PCPs inherent in efficient arguments? (Q626678) (← links)
- Compression of samplable sources (Q813316) (← links)
- The hardness of the expected decision depth problem (Q845910) (← links)
- On interactive proofs with a laconic prover (Q1413647) (← links)
- Entropy waves, the zig-zag graph product, and new constant-degree expanders (Q1613289) (← links)
- Constructing locally computable extractors and cryptosystems in the bounded-storage model (Q1879468) (← links)
- Deterministic public-key encryption for adaptively-chosen plaintext distributions (Q1994638) (← links)
- PCPs and the hardness of generating synthetic data (Q2210447) (← links)
- Unifying computational entropies via Kullback-Leibler divergence (Q2305004) (← links)
- Pseudorandomness and average-case complexity via uniform reductions (Q2475578) (← links)
- Simpler session-key generation from short random passwords (Q2482336) (← links)
- Lower bounds for non-black-box zero knowledge (Q2490264) (← links)
- Limitations of the Impagliazzo-Nisan-Wigderson pseudorandom generator against permutation branching programs (Q2695266) (← links)
- Concurrent composition of differential privacy (Q2697876) (← links)
- The Complexity of Counting in Sparse, Regular, and Planar Graphs (Q2784460) (← links)
- The Complexity of Computing the Optimal Composition of Differential Privacy (Q2796124) (← links)
- Pseudorandom generators without the XOR Lemma (extended abstract) (Q2819586) (← links)
- Faster Algorithms for Privately Releasing Marginals (Q2843303) (← links)
- A Uniform Min-Max Theorem with Applications in Cryptography (Q2845663) (← links)
- Efficiency Improvements in Constructing Pseudorandom Generators from One-Way Functions (Q2848227) (← links)
- Pseudorandomness for Regular Branching Programs via Fourier Analysis (Q2851892) (← links)
- Pseudorandomness (Q2869768) (← links)
- Efficiency improvements in constructing pseudorandom generators from one-way functions (Q2875171) (← links)
- Randomness Condensers for Efficiently Samplable, Seed-Dependent Sources (Q2891509) (← links)
- Differential Privacy with Imperfect Randomness (Q2914280) (← links)
- Zero knowledge with efficient provers (Q2931393) (← links)
- Pseudorandom walks on regular digraphs and the RL vs. L problem (Q2931408) (← links)
- Privacy Games (Q2936999) (← links)
- The Computational Complexity of Nash Equilibria in Concisely Represented Games (Q2947564) (← links)
- (Q2969669) (← links)
- Publicly verifiable proofs of sequential work (Q2986887) (← links)
- Locally testable codes and cayley graphs (Q2988869) (← links)
- Redrawing the boundaries on purchasing data from privacy-sensitive individuals (Q2988895) (← links)
- PCPs and the Hardness of Generating Private Synthetic Data (Q3000552) (← links)
- Simplified Derandomization of BPP Using a Hitting Set Generator (Q3088176) (← links)
- On the Complexity of Computational Problems Regarding Distributions (Q3088193) (← links)
- (Q3096715) (← links)
- Separating Computational and Statistical Differential Privacy in the Client-Server Model (Q3179372) (← links)
- Computational Differential Privacy (Q3183561) (← links)
- S-T connectivity on digraphs with a known stationary distribution (Q3189013) (← links)
- (Q3191600) (← links)
- On transformation of interactive proofs that preserve the prover's complexity (Q3191986) (← links)
- Composition of Zero-Knowledge Proofs with Efficient Provers (Q3408217) (← links)
- Unbalanced expanders and randomness extractors from Parvaresh--Vardy codes (Q3452216) (← links)
- A complete problem for statistical zero knowledge (Q3455561) (← links)
- The Complexity of Distinguishing Markov Random Fields (Q3541806) (← links)
- Tight Bounds for Hashing Block Sources (Q3541807) (← links)
- Limitations of Hardness vs. Randomness under Uniform Reductions (Q3541813) (← links)
