TY - GEN
T1 - Practical two-party computation based on the conditional gate
AU - Schoenmakers, L.A.M.
AU - Tuyls, P.T.
PY - 2004
Y1 - 2004
N2 - 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.
AB - 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.
U2 - 10.1007/978-3-540-30539-2_10
DO - 10.1007/978-3-540-30539-2_10
M3 - Conference contribution
SN - 3-540-23975-8
T3 - Lecture Notes in Computer Science
SP - 119
EP - 136
BT - Advances in Cryptology - ASIACRYPT 2004 (Proceedings 10th International Conference on the Theory and Application of Cryptology and Information Security, Jeju Island, Korea, December 5-9, 2004)
A2 - Lee, P.J.
PB - Springer
CY - Berlin
ER -