Sciweavers

Share
CRYPTO
2005
Springer

Secure Computation of Constant-Depth Circuits with Applications to Database Search Problems

9 years 2 months ago
Secure Computation of Constant-Depth Circuits with Applications to Database Search Problems
Motivated by database search problems such as partial match or nearest neighbor, we present secure multiparty computation protocols for constant-depth circuits. Specifically, for a constant-depth circuit C of size s with an m-bit input x, we obtain the following types of protocols. – In a setting where k ≥ poly log(s) servers hold C and a client holds x, we obtain a protocol in which the client privately learns C(x) by communicating ˜O(m) bits with each server. – In a setting where x is arbitrarily distributed between k ≥ poly log(s) parties who all know C, we obtain a secure protocol for evaluating C(x) using O(m · poly(k)) communication. Both types of protocols tolerate t = k/poly log(s) dishonest parties and their computational complexity is nearly linear in s. In particular, the protocols are optimal “up to polylog factors” with respect to communication, local computation, and minimal number of participating parties. We then apply the above results to obtain sublinea...
Omer Barkol, Yuval Ishai
Added 26 Jun 2010
Updated 26 Jun 2010
Type Conference
Year 2005
Where CRYPTO
Authors Omer Barkol, Yuval Ishai
Comments (0)
books