#### Filter Results:

- Full text PDF available (126)

#### Publication Year

1996

2018

- This year (5)
- Last 5 years (46)
- Last 10 years (102)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Cynthia Dwork, Guy N. Rothblum, Salil P. Vadhan
- 2010 IEEE 51st Annual Symposium on Foundations of…
- 2010

Boosting is a general method for improving the accuracy of learning algorithms. We use boosting to construct improved {\em privacy-preserving synopses} of an input database. These are data structures… (More)

- Silvio Micali, Michael O. Rabin, Salil P. Vadhan
- FOCS
- 1999

We efficiently combine unpredictability and verifiability by extending the Goldreich–Goldwasser–Micali construction of pseudorandom functions fs from a secret seed s, so that knowledge ofs not only… (More)

- Madhu Sudan, Luca Trevisan, Salil P. Vadhan
- Electronic Colloquium on Computational Complexity
- 1998

Impagliazzo andWigderson IW have recently shown that if there exists a decision problem solvable in time O n and having circuit complexity n for all but nitely many n then P BPP This result is a… (More)

- Ran Raz, Omer Reingold, Salil P. Vadhan
- Electronic Colloquium on Computational Complexity
- 1999

We give explicit constructions of extractors which work for a source of any min-entropy on strings of length n. These extractors can extract any constant fraction of the min-entropy using O(log n)… (More)

- Salil P. Vadhan
- SIAM J. Comput.
- 2001

We show that a number of graph-theoretic counting problems remain NP-hard, indeed #P-complete, in very restricted classes of graphs. In particular, it is shown that the problems of counting… (More)

- Yevgeniy Dodis, Salil P. Vadhan, Daniel Wichs
- IACR Cryptology ePrint Archive
- 2009

Proofs of Retrievability (PoR), introduced by Juels and Kaliski [JK07], allow the client to store a file F on an untrusted server, and later run an efficient audit protocol in which the server proves… (More)

- Amit Sahai, Salil P. Vadhan
- IACR Cryptology ePrint Archive
- 2000

We present the first complete problem for SZK, the class of promise problems possessing statistical zero-knowledge proofs (against an honest verifier). The problem, called Statistical Difference, is… (More)

- Daniele Micciancio, Salil P. Vadhan
- CRYPTO
- 2003

We construct several new statistical zero-knowledge proofs with efficient provers, i.e. ones where the prover strategy runs in probabilistic polynomial time given an NP witness for the input string.… (More)

- Omer Reingold, Luca Trevisan, Salil P. Vadhan
- TCC
- 2004

Starting with the seminal paper of Impagliazzo and Rudich [18], there has been a large body of work showing that various cryptographic primitives cannot be reduced to each other via “black-box”… (More)

- Eli Ben-Sasson, Oded Goldreich, Prahladh Harsha, Madhu Sudan, Salil P. Vadhan
- Electronic Colloquium on Computational Complexity
- 2004

We continue the study of the trade-off between the length of PCP sand their query complexity, establishing the following main results(which refer to proofs of satisfiability of circuits of size… (More)