An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries
Abstract
We show an efficient secure two-party protocol, based on Yao's construction, which provides security against malicious adversaries. Yao's original protocol is only secure in the presence of semi-honest adversaries. Security against malicious adversaries can be obtained by applying the compiler of Goldreich, Micali and Wigderson (the "GMW compiler"). However, this approach does not seem to be very practical as it requires using generic zero-knowledge proofs.
- Publication:
-
Lecture Notes in Computer Science
- Pub Date:
- 2007
- DOI:
- 10.1007/978-3-540-72540-4_4
- Bibcode:
- 2007LNCS.4515...52L