Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in computer science

An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries

Yehuda Lindell, Benny Pinkas B

Published Jan 1, 2007• 431 citations
Publisher
DOI
10.1007/978-3-540-72540-4_4

Related papers

An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries

Yehuda Lindell, Benny Pinkas B

Journal of Cryptology•Apr 9, 2014•51 citations

Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries

Yehuda Lindell, Benny Pinkas B, Nigel Paul Smart

Lecture notes in computer science•Jan 1, 2008•144 citations

Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer.

Yehuda Lindell, Benny Pinkas B

Protocols for secure two-party computation enable a pair of parties to compute a function of their inputs while preserving security properties such as privacy, correctness and independence of inputs. Recently, a number of protocols have been proposed for the efficient construction of two-party computation secure in the presence of malicious adversaries (where security is proven under the standard simulation-based ideal/real model paradigm for defining security). In this paper, we present a protocol for this task that follows the methodology of using cut-and-choose to boost Yao’s protocol to be secure in the presence of malicious adversaries. Relying on specific assumptions (DDH), we construct a protocol that is significantly more efficient and far simpler than the protocol of Lindell and Pinkas (Eurocrypt 2007) that follows the same methodology. We provide an exact, concrete analysis of the efficiency of our scheme and demonstrate that (at least for not very small circuits) our protocol is more efficient than any other known today. secure two-party computation, malicious adversaries, cut-and-choose, concrete effi-Keywords: ciency An extended abstract of this work appeared at TCC 2011.

•Jan 1, 2010•3 citations

An Efficient Protocol for Fair Secure Two-Party Computation

Mehmet Sabır Kiraz, Berry Schoenmakers

Lecture notes in computer science•Apr 4, 2008•15 citations

Zero knowledge proof for secure two-party computation with malicious adversaries in distributed networks

Xiaoyi Yang, Meijuan Huang

Distributed networks remarkably enhance the convenience of network connectivity. How to achieve efficient cooperative computation while preserving data privacy is a challenge in the scenario of distributed networks. Secure computation, as the key technology of information security and privacy protection in the distributed networks, attracts more and more attention. In the paper, we develop the protocols of secure two-party computation in the presence of malicious adversaries which are constructed with homomorphic probabilistic cryptosystem, and propose four honest-verifier zero-knowledge proof protocols to detect two cheating behaviours of the malicious adversary. The proposed protocols are more targeted than the existing work. The analysis shows that the proposed protocols are complete, sound and zero-knowledge. As an application, we show how to use our protocols in a secure two-party protocol to detect cheating, which can make it secure in the presence of malicious adversaries.

International Journal of Computational Science and Engineering•Jan 1, 2018•1 citation

Faster Two-Party Computation Secure Against Malicious Adversaries in the Single-Execution Setting.

Xiao Wang, Alex J. Malozemoff, Jonathan I. Katz

•Jan 1, 2016•6 citations
Protocols for secure two-party computation enable a pair of parties to compute a function of their inputs while preserving security properties such as privacy, correctness and independence of inputs. Recently, a number of protocols have been proposed for the efficient construction of two-party computation secure in the presence of malicious adversaries (where security is proven under the standard simulation-based ideal/real model paradigm for defining security). In this paper, we present a protocol for this task that follows the methodology of using cut-and-choose to boost Yao’s protocol to be secure in the presence of malicious adversaries. Relying on specific assumptions (DDH), we construct a protocol that is significantly more efficient and far simpler than the protocol of Lindell and Pinkas (Eurocrypt 2007) that follows the same methodology. We provide an exact, concrete analysis of the efficiency of our scheme and demonstrate that (at least for not very small circuits) our protocol is more efficient than any other known today. secure two-party computation, malicious adversaries, cut-and-choose, concrete effi-Keywords: ciency An extended abstract of this work appeared at TCC 2011.
Distributed networks remarkably enhance the convenience of network connectivity. How to achieve efficient cooperative computation while preserving data privacy is a challenge in the scenario of distributed networks. Secure computation, as the key technology of information security and privacy protection in the distributed networks, attracts more and more attention. In the paper, we develop the protocols of secure two-party computation in the presence of malicious adversaries which are constructed with homomorphic probabilistic cryptosystem, and propose four honest-verifier zero-knowledge proof protocols to detect two cheating behaviours of the malicious adversary. The proposed protocols are more targeted than the existing work. The analysis shows that the proposed protocols are complete, sound and zero-knowledge. As an application, we show how to use our protocols in a secure two-party protocol to detect cheating, which can make it secure in the presence of malicious adversaries.