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

Journal of Cryptology

High-Throughput Secure Three-Party Computation with an Honest Majority

Jun Furukawa, Yehuda Lindell, Ariel Nof, Or Weinstein

Published May 22, 2023• 4 citations
Publisher
DOI
10.1007/s00145-023-09461-7

Related papers

High-Throughput Secure Three-Party Computation for Malicious Adversaries and an Honest Majority

Jun Furukawa, Yehuda Lindell, Ariel Nof +1 more

Lecture notes in computer science•Jan 1, 2017•155 citations

Improved Building Blocks for Secure Multi-party Computation Based on Secret Sharing with Honest Majority

Marina Blanton, Ah Reum Kang, Chen Yuan

Lecture notes in computer science•Jan 1, 2020•24 citations

Complete Fairness in Multi-party Computation without an Honest Majority

Steven Gordon, Jonathan I. Katz

Lecture notes in computer science•Jan 1, 2009•53 citations

Adaptively Secure Multi-Party Computation with Dishonest Majority

Sanjam Garg, Amit Sahai

Lecture notes in computer science•Jan 1, 2012•31 citations

High-Throughput Semi-Honest Secure Three-Party Computation with an Honest Majority

Toshinori Araki, Jun Furukawa, Yehuda Lindell +2 more

In this paper, we describe a new information-theoretic protocol (and a computationally-secure variant) for secure three-party computation with an honest majority. The protocol has very minimal computation and communication; for Boolean circuits, each party sends only a single bit for every AND gate (and nothing is sent for XOR gates). Our protocol is (simulation-based) secure in the presence of semi-honest adversaries, and achieves privacy in the client/server model in the presence of malicious adversaries. On a cluster of three 20-core servers with a 10Gbps connection, the implementation of our protocol carries out over 1.3 million AES computations per second, which involves processing over 7 billion gates per second. In addition, we developed a Kerberos extension that replaces the ticket-granting-ticket encryption on the Key Distribution Center (KDC) in MIT-Kerberos with our protocol, using keys/ passwords that are shared between the servers. This enables the use of Kerberos while protecting passwords. Our implementation is able to support a login storm of over 35,000 logins per second, which suffices even for very large organizations. Our work demonstrates that high-throughput secure computation is possible on standard hardware.

ACM SIGSAC Conference on Computer and Communications Security (CCS)•Oct 24, 2016•429 citations

Secure multi-party computation

Yan Huang

Elsevier eBooks•Jan 1, 2020•40 citations
In this paper, we describe a new information-theoretic protocol (and a computationally-secure variant) for secure three-party computation with an honest majority. The protocol has very minimal computation and communication; for Boolean circuits, each party sends only a single bit for every AND gate (and nothing is sent for XOR gates). Our protocol is (simulation-based) secure in the presence of semi-honest adversaries, and achieves privacy in the client/server model in the presence of malicious adversaries. On a cluster of three 20-core servers with a 10Gbps connection, the implementation of our protocol carries out over 1.3 million AES computations per second, which involves processing over 7 billion gates per second. In addition, we developed a Kerberos extension that replaces the ticket-granting-ticket encryption on the Key Distribution Center (KDC) in MIT-Kerberos with our protocol, using keys/ passwords that are shared between the servers. This enables the use of Kerberos while protecting passwords. Our implementation is able to support a login storm of over 35,000 logins per second, which suffices even for very large organizations. Our work demonstrates that high-throughput secure computation is possible on standard hardware.