#### Filter Results:

- Full text PDF available (182)

#### Publication Year

1997

2017

- This year (10)
- Last 5 years (39)
- Last 10 years (97)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Boaz Barak, Oded Goldreich, +4 authors Ke Yang
- CRYPTO
- 2001

Informally, an <i>obfuscator</i> <i>O</i> is an (efficient, probabilistic) “compiler” that takes as input a program (or circuit) <i>P</i> and produces a new program <i>O</i>(<i>P</i>) that has the same functionality as <i>P</i> yet is “unintelligible” in some sense. Obfuscators, if they exist, would have a wide variety of… (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 that yield, for a given set $\Q$ of queries over an input database, reasonably accurate estimates of the responses to every query in~$\Q$, even when the number… (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 of s not only enables one to evaluate fs at any point x, but also to provide an NP-proof that the value fs(x) is indeed correct without compromising the unpredictability of… (More)

- Yevgeniy Dodis, Salil P. Vadhan, Daniel Wichs
- TCC
- 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 that it (still) possesses the client’s data. Constructions of PoR schemes attempt to minimize the client and server storage, the communication complexity of an… (More)

- Venkatesan Guruswami, Christopher Umans, Salil P. Vadhan
- Twenty-Second Annual IEEE Conference on…
- 2007

We give an improved explicit construction of highly unbalanced bipartite expander graphs with expansion arbitrarily close to the degree (which is polylogarithmic in the number of vertices). Both the degree and the number of right-hand vertices are polynomially close to optimal, whereas the previous constructions of Ta-Shma et al. [2007] required at least… (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” reductions. The common interpretation of these results is that there are inherent limitations in using a primitive as a black box, and that these impossibility… (More)

- Amit Sahai, Salil P. Vadhan
- FOCS
- 1997

We present a complete promise problem for SZK, the class of languages possessing statistical zero-knowledge proofs (against an honest verifier). The problem is to decide whether two efficiently samplable distributions are either statisticallyclose or far apart. This characterizes SZK with no reference to interaction or zero-knowledge. From this theorem and… (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 <i>n</i>): 1 We present PCPs of length exp(Õ(log log <i>n</i>)<sup>2</sup>)•<i>n</i> that can be verified by making <i>o</i>(log log<i>n</i>) Boolean… (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. Our first proof systems are for approximate versions of the Shortest Vector Problem (SVP) and Closest Vector Problem (CVP), where the witness is simply a short… (More)

- Salil P. Vadhan
- Journal of Cryptology
- 2002

We consider the problem of constructing randomness extractors that are locally computable; that is, read only a small number of bits from their input. As recently shown by Lu locally computable extractors directly yield secure private-key cryptosystems in Maurer’s bounded-storage model. We suggest a general “sample-then-extract” approach to constructing… (More)