Speaker: **Yuval Ishai**

Affiliation: DIMACS, Rutgers University and AT&T Labs Research, Florham Park

Title : Randomizing Polynomials: A New Representation
with Applications to Round-Efficient Secure Computation
Date: Tuesday, September 12

Time: 4:30-5:30

Place: CORE Building, Room 431, Busch Campus

As an application, the secure evaluation of an arbitrary function can be reduced to the secure evaluation of degree-3 polynomials. A corollary of our reduction is that two (respectively, three) communication rounds are sufficient for k parties to compute any Boolean function f of their inputs, with perfect information-theoretic privacy against collusions of at most one third (resp., one half) of the parties, and communication complexity which is at most quadratic in the branching program size of f (with a small probability of one-sided error).

The talk is based on a joint work with Eyal Kushilevitz, and will not assume previous background on the problem of secure computation.

Previous

DIMACS home page

Contacting the Center

Document last modified on August 22, 2000.