The SCEAS System
| |||||||

## Search the dblp DataBase
Salil P. Vadhan:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Venkatesan Guruswami, Salil P. Vadhan
**A Lower Bound on List Size for List Decoding.**[Citation Graph (0, 0)][DBLP] APPROX-RANDOM, 2005, pp:318-329 [Conf] - Eyal Rozenman, Salil P. Vadhan
**Derandomized Squaring of Graphs.**[Citation Graph (0, 0)][DBLP] APPROX-RANDOM, 2005, pp:436-447 [Conf] - Eli Ben-Sasson, Oded Goldreich, Prahladh Harsha, Madhu Sudan, Salil P. Vadhan
**Short PCPs Verifiable in Polylogarithmic Time.**[Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 2005, pp:120-134 [Conf] - Michael R. Capalbo, Omer Reingold, Salil P. Vadhan, Avi Wigderson
**Randomness Conductors and Constant-Degree Lossless Expanders.**[Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 2002, pp:15- [Conf] - Oded Goldreich, Salil P. Vadhan
**Comparing Entropies in Statistical Zero Knowledge with Applications to the Structure of SZK.**[Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 1999, pp:54-0 [Conf] - Madhu Sudan, Luca Trevisan, Salil P. Vadhan
**Pseudorandom Generators without the XOR Lemma (Abstract).**[Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 1999, pp:4- [Conf] - Luca Trevisan, Salil P. Vadhan
**Pseudorandomness and Average-Case Complexity via Uniform Reductions.**[Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 2002, pp:129-138 [Conf] - Luca Trevisan, Salil P. Vadhan, David Zuckerman
**Compression of Samplable Sources.**[Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 2004, pp:1-14 [Conf] - Mihir Bellare, Shai Halevi, Amit Sahai, Salil P. Vadhan
**Many-to-One Trapdoor Functions and Their Ralation to Public-Key Cryptosystems.**[Citation Graph (0, 0)][DBLP] CRYPTO, 1998, pp:283-298 [Conf] - Boaz Barak, Oded Goldreich, Russell Impagliazzo, Steven Rudich, Amit Sahai, Salil P. Vadhan, Ke Yang
**On the (Im)possibility of Obfuscating Programs.**[Citation Graph (0, 0)][DBLP] CRYPTO, 2001, pp:1-18 [Conf] - Boaz Barak, Shien Jin Ong, Salil P. Vadhan
**Derandomization in Cryptography.**[Citation Graph (0, 0)][DBLP] CRYPTO, 2003, pp:299-315 [Conf] - Oded Goldreich, Amit Sahai, Salil P. Vadhan
**Can Statistical Zero Knowledge Be Made Non-interactive? or On the Relationship of SZK and NISZK.**[Citation Graph (0, 0)][DBLP] CRYPTO, 1999, pp:467-484 [Conf] - Daniele Micciancio, Salil P. Vadhan
**Statistical Zero-Knowledge Proofs with Efficient Provers: Lattice Problems and More.**[Citation Graph (0, 0)][DBLP] CRYPTO, 2003, pp:282-298 [Conf] - Ronen Gradwohl, Salil P. Vadhan, David Zuckerman
**Random Selection with an Adversarial Majority.**[Citation Graph (0, 0)][DBLP] CRYPTO, 2006, pp:409-426 [Conf] - Salil P. Vadhan
**On Constructing Locally Computable Extractors and Cryptosystems in the Bounded Storage Model.**[Citation Graph (0, 0)][DBLP] CRYPTO, 2003, pp:61-77 [Conf] - Boaz Barak, Yehuda Lindell, Salil P. Vadhan
**Lower Bounds for Non-Black-Box Zero Knowledge.**[Citation Graph (0, 0)][DBLP] FOCS, 2003, pp:384-393 [Conf] - Silvio Micali, Michael O. Rabin, Salil P. Vadhan
**Verifiable Random Functions.**[Citation Graph (0, 0)][DBLP] FOCS, 1999, pp:120-130 [Conf] - Omer Reingold, Salil P. Vadhan, Avi Wigderson
**Entropy Waves, the Zig-Zag Graph Product, and New Constant-Degree Expanders and Extractors.**[Citation Graph (0, 0)][DBLP] FOCS, 2000, pp:3-13 [Conf] - Ran Raz, Omer Reingold, Salil P. Vadhan
**Error Reduction for Extractors.**[Citation Graph (0, 0)][DBLP] FOCS, 1999, pp:191-201 [Conf] - Amit Sahai, Salil P. Vadhan
**A Complete Promise Problem for Statistical Zero-Knowledge.**[Citation Graph (0, 0)][DBLP] FOCS, 1997, pp:448-457 [Conf] - Luca Trevisan, Salil P. Vadhan
**Extracting Randomness from Samplable Distributions.**[Citation Graph (0, 0)][DBLP] FOCS, 2000, pp:32-42 [Conf] - Salil P. Vadhan
**Randomness Extractors and their Many Guises.**[Citation Graph (0, 0)][DBLP] FOCS, 2002, pp:9-0 [Conf] - Salil P. Vadhan
**An Unconditional Study of Computational Zero Knowledge.**[Citation Graph (0, 0)][DBLP] FOCS, 2004, pp:176-185 [Conf] - Minh-Huyen Nguyen, Shien Jin Ong, Salil P. Vadhan
**Statistical Zero-Knowledge Arguments for NP from Any One-Way Function.**[Citation Graph (0, 0)][DBLP] FOCS, 2006, pp:3-14 [Conf] - Oded Goldreich, Salil P. Vadhan, Avi Wigderson
**On Interactive Proofs with a Laconic Prover.**[Citation Graph (0, 0)][DBLP] ICALP, 2001, pp:334-345 [Conf] - Salil P. Vadhan
**Order in Pseudorandomness.**[Citation Graph (0, 0)][DBLP] RANDOM-APPROX, 2001, pp:10-11 [Conf] - Nenad Dedic, Leonid Reyzin, Salil P. Vadhan
**An Improved Pseudorandom Generator Based on Hardness of Factoring.**[Citation Graph (0, 0)][DBLP] SCN, 2002, pp:88-101 [Conf] - Grant Schoenebeck, Salil P. Vadhan
**The computational complexity of nash equilibria in concisely represented games.**[Citation Graph (0, 0)][DBLP] ACM Conference on Electronic Commerce, 2006, pp:270-279 [Conf] - Eli Ben-Sasson, Oded Goldreich, Prahladh Harsha, Madhu Sudan, Salil P. Vadhan
**Robust pcps of proximity, shorter pcps and applications to coding.**[Citation Graph (0, 0)][DBLP] STOC, 2004, pp:1-10 [Conf] - Eli Ben-Sasson, Madhu Sudan, Salil P. Vadhan, Avi Wigderson
**Randomness-efficient low degree tests and short PCPs via epsilon-biased sets.**[Citation Graph (0, 0)][DBLP] STOC, 2003, pp:612-621 [Conf] - Michael A. Bender, Antonio Fernández, Dana Ron, Amit Sahai, Salil P. Vadhan
**The Power of a Pebble: Exploring and Mapping Directed Graphs.**[Citation Graph (0, 0)][DBLP] STOC, 1998, pp:269-278 [Conf] - Michael R. Capalbo, Omer Reingold, Salil P. Vadhan, Avi Wigderson
**Randomness conductors and constant-degree lossless expanders.**[Citation Graph (0, 0)][DBLP] STOC, 2002, pp:659-668 [Conf] - Oded Goldreich, Amit Sahai, Salil P. Vadhan
**Honest-Verifier Statistical Zero-Knowledge Equals General Statistical Zero-Knowledge.**[Citation Graph (0, 0)][DBLP] STOC, 1998, pp:399-408 [Conf] - Alexander Healy, Salil P. Vadhan, Emanuele Viola
**Using nondeterminism to amplify hardness.**[Citation Graph (0, 0)][DBLP] STOC, 2004, pp:192-201 [Conf] - Jesse Kamp, Anup Rao, Salil P. Vadhan, David Zuckerman
**Deterministic extractors for small-space sources.**[Citation Graph (0, 0)][DBLP] STOC, 2006, pp:691-700 [Conf] - Daniel Lewin, Salil P. Vadhan
**Checking Polynomial Identities over any Field: Towards a Derandomization?**[Citation Graph (0, 0)][DBLP] STOC, 1998, pp:438-447 [Conf] - Chi-Jen Lu, Omer Reingold, Salil P. Vadhan, Avi Wigderson
**Extractors: optimal up to constant factors.**[Citation Graph (0, 0)][DBLP] STOC, 2003, pp:602-611 [Conf] - Minh-Huyen Nguyen, Salil P. Vadhan
**Zero knowledge with efficient provers.**[Citation Graph (0, 0)][DBLP] STOC, 2006, pp:287-295 [Conf] - Ran Raz, Omer Reingold, Salil P. Vadhan
**Extracting all the Randomness and Reducing the Error in Trevisan's Extractors.**[Citation Graph (0, 0)][DBLP] STOC, 1999, pp:149-158 [Conf] - Omer Reingold, Luca Trevisan, Salil P. Vadhan
**Pseudorandom walks on regular digraphs and the RL vs. L problem.**[Citation Graph (0, 0)][DBLP] STOC, 2006, pp:457-466 [Conf] - Saurabh Sanghvi, Salil P. Vadhan
**The round complexity of two-party random selection.**[Citation Graph (0, 0)][DBLP] STOC, 2005, pp:338-347 [Conf] - Madhu Sudan, Luca Trevisan, Salil P. Vadhan
**Pseudorandom Generators Without the XOR Lemma (Extended Abstract).**[Citation Graph (0, 0)][DBLP] STOC, 1999, pp:537-546 [Conf] - Salil P. Vadhan
**On transformation of interactive proofs that preserve the prover's complexity.**[Citation Graph (0, 0)][DBLP] STOC, 2000, pp:200-207 [Conf] - Minh-Huyen Nguyen, Salil P. Vadhan
**Simpler Session-Key Generation from Short Random Passwords.**[Citation Graph (0, 0)][DBLP] TCC, 2004, pp:428-445 [Conf] - Omer Reingold, Luca Trevisan, Salil P. Vadhan
**Notions of Reducibility between Cryptographic Primitives.**[Citation Graph (0, 0)][DBLP] TCC, 2004, pp:1-20 [Conf] - Daniele Micciancio, Shien Jin Ong, Amit Sahai, Salil P. Vadhan
**Concurrent Zero Knowledge Without Complexity Assumptions.**[Citation Graph (0, 0)][DBLP] TCC, 2006, pp:1-20 [Conf] - Oded Goldreich, Salil P. Vadhan, Avi Wigderson
**On interactive proofs with a laconic prover.**[Citation Graph (0, 0)][DBLP] Computational Complexity, 2002, v:11, n:1-2, pp:1-53 [Journal] - Luca Trevisan, Salil P. Vadhan, David Zuckerman
**Compression of Samplable Sources.**[Citation Graph (0, 0)][DBLP] Computational Complexity, 2005, v:14, n:3, pp:186-227 [Journal] - Oded Goldreich, Salil P. Vadhan, Avi Wigderson
**Simplified derandomization of BPP using a hitting set generator.**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2000, v:7, n:4, pp:- [Journal] - Amit Sahai, Salil P. Vadhan
**A Complete Problem for Statistical Zero Knowledge**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2000, v:7, n:84, pp:- [Journal] - Omer Reingold, Salil P. Vadhan, Avi Wigderson
**Entropy Waves, the Zig-Zag Graph Product, and New Constant-Degree Expanders and Extractors**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2001, v:8, n:18, pp:- [Journal] - Oded Goldreich, Salil P. Vadhan, Avi Wigderson
**On Interactive Proofs with a Laconic Prover**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2001, v:8, n:46, pp:- [Journal] - Boaz Barak, Oded Goldreich, Russell Impagliazzo, Steven Rudich, Amit Sahai, Salil P. Vadhan, Ke Yang
**On the (Im)possibility of Obfuscating Programs**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2001, v:8, n:057, pp:- [Journal] - Eli Ben-Sasson, Oded Goldreich, Prahladh Harsha, Madhu Sudan, Salil P. Vadhan
**Robust PCPs of Proximity, Shorter PCPs and Applications to Coding**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:021, pp:- [Journal] - Boaz Barak, Yehuda Lindell, Salil P. Vadhan
**Lower Bounds for Non-Black-Box Zero Knowledge**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:083, pp:- [Journal] - Alexander Healy, Salil P. Vadhan, Emanuele Viola
**Using Nondeterminism to Amplify Hardness**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:087, pp:- [Journal] - Luca Trevisan, Salil P. Vadhan, David Zuckerman
**Compression of Samplable Sources**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:012, pp:- [Journal] - Omer Reingold, Luca Trevisan, Salil P. Vadhan
**Pseudorandom Walks in Biregular Graphs and the RL vs. L Problem**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:022, pp:- [Journal] - Grant Schoenebeck, Salil P. Vadhan
**The Computational Complexity of Nash Equilibria in Concisely Represented Games**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:052, pp:- [Journal] - Eyal Rozenman, Salil P. Vadhan
**Derandomized Squaring of Graphs**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:092, pp:- [Journal] - Daniele Micciancio, Shien Jin Ong, Amit Sahai, Salil P. Vadhan
**Concurrent Zero Knowledge without Complexity Assumptions**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:093, pp:- [Journal] - Saurabh Sanghvi, Salil P. Vadhan
**The Round Complexity of Two-Party Random Selection**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:110, pp:- [Journal] - Boaz Barak, Shien Jin Ong, Salil P. Vadhan
**Derandomization in Cryptography**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:114, pp:- [Journal] - Salil P. Vadhan
**Extracting All the Randomness from a Weakly Random Source**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 1998, v:5, n:47, pp:- [Journal] - Madhu Sudan, Luca Trevisan, Salil P. Vadhan
**Pseudorandom generators without the XOR Lemma**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 1998, v:5, n:74, pp:- [Journal] - Oded Goldreich, Amit Sahai, Salil P. Vadhan
**Can Statistical Zero Knowledge be made Non-Interactive? or On the Relationship of SZK and NISZK**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 1999, v:6, n:13, pp:- [Journal] - Ran Raz, Omer Reingold, Salil P. Vadhan
**Extracting All the Randomness and Reducing the Error in Trevisan's Extractors**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 1999, v:, n:46, pp:- [Journal] - Michael A. Bender, Antonio Fernández, Dana Ron, Amit Sahai, Salil P. Vadhan
**The Power of a Pebble: Exploring and Mapping Directed Graphs.**[Citation Graph (0, 0)][DBLP] Inf. Comput., 2002, v:176, n:1, pp:1-21 [Journal] - Dana Ron, Amir Rosenfeld, Salil P. Vadhan
**The hardness of the Expected Decision Depth problem.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2007, v:101, n:3, pp:112-118 [Journal] - Amit Sahai, Salil P. Vadhan
**A complete problem for statistical zero knowledge.**[Citation Graph (0, 0)][DBLP] J. ACM, 2003, v:50, n:2, pp:196-249 [Journal] - Boaz Barak, Yehuda Lindell, Salil P. Vadhan
**Lower bounds for non-black-box zero knowledge.**[Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 2006, v:72, n:2, pp:321-391 [Journal] - Ran Raz, Omer Reingold, Salil P. Vadhan
**Extracting all the Randomness and Reducing the Error in Trevisan's Extractors.**[Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 2002, v:65, n:1, pp:97-128 [Journal] - Madhu Sudan, Luca Trevisan, Salil P. Vadhan
**Pseudorandom Generators without the XOR Lemma.**[Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 2001, v:62, n:2, pp:236-266 [Journal] - Salil P. Vadhan
**Constructing Locally Computable Extractors and Cryptosystems in the Bounded-Storage Model.**[Citation Graph (0, 0)][DBLP] J. Cryptology, 2004, v:17, n:1, pp:43-77 [Journal] - Alexander Healy, Salil P. Vadhan, Emanuele Viola
**Using Nondeterminism to Amplify Hardness.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2006, v:35, n:4, pp:903-931 [Journal] - Salil P. Vadhan
**The Complexity of Counting in Sparse, Regular, and Planar Graphs.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2001, v:31, n:2, pp:398-427 [Journal] - Eli Ben-Sasson, Oded Goldreich, Prahladh Harsha, Madhu Sudan, Salil P. Vadhan
**Robust PCPs of Proximity, Shorter PCPs, and Applications to Coding.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2006, v:36, n:4, pp:889-974 [Journal] - Salil P. Vadhan
**An Unconditional Study of Computational Zero Knowledge.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2006, v:36, n:4, pp:1160-1214 [Journal] - Boaz Barak, Shien Jin Ong, Salil P. Vadhan
**Derandomization in Cryptography.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2007, v:37, n:2, pp:380-400 [Journal] - Kai-min Chung, Omer Reingold, Salil P. Vadhan
**S-T Connectivity on Digraphs with a Known Stationary Distribution.**[Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 2007, pp:236-249 [Conf] - Venkatesan Guruswami, Christopher Umans, Salil P. Vadhan
**Unbalanced Expanders and Randomness Extractors from Parvaresh-Vardy Codes.**[Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 2007, pp:96-108 [Conf] - Ran Canetti, Ronald L. Rivest, Madhu Sudan, Luca Trevisan, Salil P. Vadhan, Hoeteck Wee
**Amplifying Collision Resistance: A Complexity-Theoretic Treatment.**[Citation Graph (0, 0)][DBLP] CRYPTO, 2007, pp:264-283 [Conf] - Shien Jin Ong, Salil P. Vadhan
**Zero Knowledge and Soundness Are Symmetric.**[Citation Graph (0, 0)][DBLP] EUROCRYPT, 2007, pp:187-209 [Conf] **Limitations of Hardness vs. Randomness under Uniform Reductions.**[Citation Graph (, )][DBLP]**Tight Bounds for Hashing Block Sources.**[Citation Graph (, )][DBLP]**The Complexity of Distinguishing Markov Random Fields.**[Citation Graph (, )][DBLP]**Pseudorandom Bit Generators That Fool Modular Sums.**[Citation Graph (, )][DBLP]**Are PCPs Inherent in Efficient Arguments?**[Citation Graph (, )][DBLP]**Regularity, Boosting, and Efficiently Simulating Every High-Entropy Distribution.**[Citation Graph (, )][DBLP]**Computational Differential Privacy.**[Citation Graph (, )][DBLP]**Improved Delegation of Computation Using Fully Homomorphic Encryption.**[Citation Graph (, )][DBLP]**Universal One-Way Hash Functions via Inaccessible Entropy.**[Citation Graph (, )][DBLP]**Dense Subsets of Pseudorandom Sets.**[Citation Graph (, )][DBLP]**The Complexity of Zero Knowledge.**[Citation Graph (, )][DBLP]**Why simple hash functions work: exploiting the entropy in a data stream.**[Citation Graph (, )][DBLP]**On the complexity of differentially private data release: efficient algorithms and hardness results.**[Citation Graph (, )][DBLP]**Inaccessible entropy.**[Citation Graph (, )][DBLP]**Efficiency improvements in constructing pseudorandom generators from one-way functions.**[Citation Graph (, )][DBLP]**An Equivalence Between Zero Knowledge and Commitments.**[Citation Graph (, )][DBLP]**Interactive and Noninteractive Zero Knowledge are Equivalent in the Help Model.**[Citation Graph (, )][DBLP]**Fairness with an Honest Minority and a Rational Majority.**[Citation Graph (, )][DBLP]**Proofs of Retrievability via Hardness Amplification.**[Citation Graph (, )][DBLP]**Composition of Zero-Knowledge Proofs with Efficient Provers.**[Citation Graph (, )][DBLP]**Are PCPs Inherent in Efficient Arguments?**[Citation Graph (, )][DBLP]**Pseudorandomness and Average-Case Complexity Via Uniform Reductions.**[Citation Graph (, )][DBLP]**Special Issue On Worst-case Versus Average-case Complexity Editors' Foreword.**[Citation Graph (, )][DBLP]**Tight Bounds for Hashing Block Sources**[Citation Graph (, )][DBLP]**On Extractors and Exposure-Resilient Functions for Sublogarithmic Entropy**[Citation Graph (, )][DBLP]**Limitations of Hardness vs. Randomness under Uniform Reductions.**[Citation Graph (, )][DBLP]**Regularity, Boosting, and Efficiently Simulating Every High-Entropy Distribution.**[Citation Graph (, )][DBLP]**Dense Subsets of Pseudorandom Sets.**[Citation Graph (, )][DBLP]**S-T Connectivity on Digraphs with a Known Stationary Distribution.**[Citation Graph (, )][DBLP]**Statistical Zero-Knowledge Arguments for NP from Any One-Way Function.**[Citation Graph (, )][DBLP]**Extractors and condensers from univariate polynomials.**[Citation Graph (, )][DBLP]**Random Selection with an Adversarial Majority.**[Citation Graph (, )][DBLP]**An Unconditional Study of Computational Zero Knowledge.**[Citation Graph (, )][DBLP]**Zero Knowledge and Soundness are Symmetric.**[Citation Graph (, )][DBLP]
Search in 0.008secs, Finished in 0.013secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |