#### Filter Results:

- Full text PDF available (197)

#### Publication Year

1972

2017

- This year (4)
- Last 5 years (37)
- Last 10 years (88)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Benny Chor, Oded Goldreich, Eyal Kushilevitz, Madhu Sudan
- FOCS
- 1995

Publicly accessible databases are an indispensable resource for retrieving up-to-date information. But they also pose a significant risk to the privacy of the user, since a curious database operator can follow the user's queries and infer what the user is after. Indeed, in cases where the users' intentions are to be kept secret, users are often cautious… (More)

- Ari Juels, Madhu Sudan
- IACR Cryptology ePrint Archive
- 2002

We describe a simple and novel cryptographic construction that we refer to as a fuzzy vault. A player Alice may place a secret value κ in a fuzzy vault and “lock” it using a set A of elements from some public universe U . If Bob tries to “unlock” the vault using a set B of similar length, he obtains κ only if B is close to A, i.e., only if A and B overlap… (More)

- Sanjeev Arora, Carsten Lund, Rajeev Motwani, Madhu Sudan, Mario Szegedy
- Electronic Colloquium on Computational Complexity
- 1998

We show that every language in NP has a probablistic verifier that checks membership proofs for it using logarithmic number of random bits and by examining a <italic>constant</italic> number of bits in the proof. If a string is in the language, then there exists a proof such that the verifier accepts with probability 1 (i.e., for every choice of its random… (More)

- Madhu Sudan
- J. Complexity
- 1997

We present a randomized algorithm which takes as input n distinct points {(xi, yi)}i=1 from F × F (where F is a field) and integer parameters t and d and returns a list of all univariate polynomials f over F in the variable x of degree at most d which agree with the given set of points in at least t places (i.e., yi = f(xi) for at least t values of i),… (More)

- Venkatesan Guruswami, Madhu Sudan
- FOCS
- 1998

Given an error-correcting code over strings of length n and an arbitrary input string also of length n, the list decoding problem is that of finding all codewords within a specified Hamming distance from the input string. We present an improved list decoding algorithm for decoding Reed-Solomon codes. The list decoding problem for Reed-Solomon codes reduces… (More)

- David R. Karger, Rajeev Motwani, Madhu Sudan
- J. ACM
- 1994

We consider the problem of coloring <italic>k</italic>-colorable graphs with the fewest possible colors. We present a randomized polynomial time algorithm that colors a 3-colorable graph on <italic>n</italic> vertices with min{<italic>O</italic>(Δ<supscrpt>1/3</supscrpt> log<supscrpt>1/2</supscrpt> Δ log <italic>n</italic>),… (More)

- Ronitt Rubinfeld, Madhu Sudan
- SIAM J. Comput.
- 1996

The study of self-testing and self-correcting programs leads to the search for robust characterizations of functions. Here we make this notion precise and show such a characterization for polynomials. From this characterization, we get the following applications. We construct simple and eecient self-testers for polynomial functions. Our characterizations… (More)

- Venkatesan Guruswami, Madhu Sudan
- IEEE Trans. Information Theory
- 1999

Given an error-correcting code over strings of length n and an arbitrary input string also of length n, the list decoding problem is that of finding all codewords within a specified Hamming distance from the input string. We present an improved list decoding algorithm for decoding Reed-Solomon codes. The list decoding problem for Reed-Solomon codes reduces… (More)

We introduce a novel approach for sending messages over lossy packet-based networks. The new method, called Priority Encoding Transmission, allows a user to specify a different priority on each segment of the message. Based on the priorities, the sender uses the system to encode the segments into packets for transmission. The system ensures recovery of the… (More)

- Sanjeev Arora, Carsten Lund, Rajeev Motwani, Madhu Sudan, Mario Szegedy
- FOCS
- 1992

The class PCP(f(n), g(n)) consists of all languages L for which there exists a polynomial-time probabilistic oracle machine that uses O(f(n)) random bits, queries O(g(n)) bits of its oracle and behaves as follows: If x ∈ L then there exists an oracle y such that the machine accepts for all random choices but if x 6∈ L then for every oracle y the machine… (More)