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.

• Type: Conference
• Year: 2004
• Where: ASIACRYPT
• Authors: Berry Schoenmakers, Pim Tuyls
• Keywords: ASIACRYPT 2004, Conditional Gate, Cryptology, Homomorphic Threshold, Homomorphic Threshold Cryptosystems