Sciweavers

Share
ASIACRYPT
2004
Springer

Practical Two-Party Computation Based on the Conditional Gate

11 years 7 months ago
Practical Two-Party Computation Based on the Conditional Gate
Abstract. We present new results in the framework of secure multiparty computation based on homomorphic threshold cryptosystems. We introduce the conditional gate as a special type of multiplication gate that can be realized in a surprisingly simple and efficient way using just standard homomorphic threshold ElGamal encryption. As addition gates are essentially for free, the conditional gate not only allows for building a circuit for any function, but actually yields efficient circuits for a wide range of tasks.
Berry Schoenmakers, Pim Tuyls
Added 30 Jun 2010
Updated 30 Jun 2010
Type Conference
Year 2004
Where ASIACRYPT
Authors Berry Schoenmakers, Pim Tuyls
Comments (0)
books