Sciweavers

Share
ASIACRYPT
2005
Springer

Gate Evaluation Secret Sharing and Secure One-Round Two-Party Computation

11 years 5 months ago
Gate Evaluation Secret Sharing and Secure One-Round Two-Party Computation
We propose Gate Evaluation Secret Sharing (GESS) – a new kind of secret sharing, designed for use in secure function evaluation (SFE) with minimal interaction. The resulting simple and powerful GESS approach to SFE is a generalization of Yao’s garbled circuit technique. We give efficient GESS schemes for evaluating binary gates and prove (almost) matching lower bounds. We give a more efficient informationtheoretic reduction of SFE of a boolean formula F to oblivious transfer. Its complexity is ≈ Èd2 i , where di is the depth of the i-th leaf of F.
Vladimir Kolesnikov
Added 26 Jun 2010
Updated 26 Jun 2010
Type Conference
Year 2005
Where ASIACRYPT
Authors Vladimir Kolesnikov
Comments (0)
books