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 Improved Secure Two-Party Computation Protocol

Yu Yu, Jussipekka Leiwo, A. Benjamin Premkumar

Published Jan 1, 2005• 1 citation
Publisher
DOI
10.1007/11599548_19

Related papers

An Efficient Protocol for Fair Secure Two-Party Computation

Mehmet Sabır Kiraz, Berry Schoenmakers

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

Improvement of a Secure Convex Hull Two-Party Computation Protocol

Zhao Wenjie -, Mingxing He

In 2008, Wang et. al. first investigate a sort of specific secure multi-party computation--secure convex hull two-party computation, and construct two protocols based on Gift wrapping method and Quick method separately. However, there are some errors in his protocol based on Quick method. This paper proposes two effective improved protocols. In addition, we analyze and compare security, computational complexity and communicational complexity about these two improved protocols.

Journal of Convergence Information Technology•May 26, 2010•2 citations

Efficient Secure Two-Party Computation

Thomas H. Schneider, Michael Zohner

•Dec 7, 2012•0 citations

A Key Agreement of the Improvements Based on Secure two-Party Computation

Junming Zhang

Secure Multiparty Computation protocol is an important area in cryptography.The research of multi-party computation was a subject of great importance in the international cryptographic circle.A key agreement scheme based on secure two-party computation is improved.Three schemes are proposed.It can be proved that even if Eve gets the same data as the receiver,the schemes are still secure.

Journal of Kaili University•Jan 1, 2011•0 citations

Efficient Secure Multi-party Computation

Martin Hirt, Ueli M. Maurer, Bartosz Przydatek

Lecture notes in computer science•Jan 1, 2000•128 citations

Faster Secure Two-Party Computation Using Garbled Circuits

Yan Huang, David Evans, Jonathan I. Katz +1 more

Secure two-party computation enables two parties to evaluate a function cooperatively without revealing to either party anything beyond the function's output. The garbled-circuit technique, a generic approach to secure two-party computation for semi-honest participants, was developed by Yao in the 1980s, but has been viewed as being of limited practical significance due to its inefficiency. We demonstrate several techniques for improving the running time and memory requirements of the garbled-circuit technique, resulting in an implementation of generic secure two-party computation that is significantly faster than any previously reported while also scaling to arbitrarily large circuits. We validate our approach by demonstrating secure computation of circuits with over 109 gates at a rate of roughly 10 microseconds per garbled gate, and showing order-of-magnitude improvements over the best previous privacy-preserving protocols for computing Hamming distance, Levenshtein distance, Smith-Waterman genome alignment, and AES.

USENIX Security Symposium•Jan 1, 2011•559 citations
Secure two-party computation enables two parties to evaluate a function cooperatively without revealing to either party anything beyond the function's output. The garbled-circuit technique, a generic approach to secure two-party computation for semi-honest participants, was developed by Yao in the 1980s, but has been viewed as being of limited practical significance due to its inefficiency. We demonstrate several techniques for improving the running time and memory requirements of the garbled-circuit technique, resulting in an implementation of generic secure two-party computation that is significantly faster than any previously reported while also scaling to arbitrarily large circuits. We validate our approach by demonstrating secure computation of circuits with over 109 gates at a rate of roughly 10 microseconds per garbled gate, and showing order-of-magnitude improvements over the best previous privacy-preserving protocols for computing Hamming distance, Levenshtein distance, Smith-Waterman genome alignment, and AES.