research-article

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

Authors:

Toshinori Araki,

Yehuda Lindell,

Kazuma OharaAuthors Info & Claims

CCS '16: Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security

Pages 805 - 817

https://doi.org/10.1145/2976749.2978331

Published: 24 October 2016 Publication History

Abstract

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.

References

[1]

G. Asharov and Y. Lindell. A Full Proof of the BGW Protocol for Perfectly-Secure Multiparty Computation. To appear in phJ.\ of Cryptology.

[2]

M. Ben-Or, S. Goldwasser, A. Wigderson.Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation. phSTOC 1988: 1--10

Digital Library

[3]

D. Beaver, S. Micali, and P. Rogaway. The round complexity of secure protocols. In the 22nd STOC, pages 503--513, 1990.

Digital Library

[4]

. Bogdanov, S. Laur and J. Willemson. Sharemind: A framework for fast privacy-preserving computations. In phESORICS 2008, Springer (LNCS 5283), 192--206, 2008.

Digital Library

[5]

D. Bogdanov, M. Niitsoo, T. Toft, J. Willemson.High-performance secure multi-party computation for data mining applications. phInt. J. Inf. Sec. 11(6): 403--418, 2012.

Digital Library

[6]

R. Canetti. Security and Composition of Multiparty Cryptographic Protocols. In the phJournal of Cryptology, 13(1):143--202, 2000.

Digital Library

[7]

R. Canetti. Universally Composable Security: A New Paradigm for CryptographicProtocols. In 42nd FOCS, pages 136--145, 2001.

Digital Library

[8]

D. Chaum, C. Crépeau and I. Damgå rd. Multi-party Unconditionally Secure Protocols. In 20th STOC, pages 11--19, 1988.

Digital Library

[9]

I. Damgård and M. Keller. Secure multiparty AES. In Financial Cryptography, Springer (LNCS 6052), pages 367--374, 2010.

Digital Library

[10]

O. Goldreich: Foundations of Cryptography - Volume 2, Basic Applications. Cambridge University Press 2004

Digital Library

[11]

O. Goldreich, S. Micali, and A. Wigderson. How to play any mental game. 19th STOC, 218--229, 1987.

Digital Library

[12]

S. Gueron, Y. Lindell, A. Nof and B. Pinkas. Fast Garbling of Circuits Under Standard Assumptions. Intextit22nd ACM CCS, pages 567--578, 2015.

Digital Library

[13]

Y. Ishai and E. Kushilevitz.On the Hardness of Information-Theoretic Multiparty Computation. In EUROCRYPT 2004, Springer (LNCS 3027),pages 439--455, 2004.

[14]

M. Keller, E. Orsini and P. Scholl. Actively Secure OT Extension with Optimal Overhead. In CRYPTO 2015, Springer (LNCS 9215), pages 724--741, 2015.

[15]

L. Kerik, P. Laud and J. Randmets. Optimizing MPC for robust and scalable integer and floating-point arithmetic. In 4th Workshop on Encrypted Computing and Applied Homomorphic Cryptography, 2016. In 4th WAHC, 2016.

[16]

E. Kushilevitz, Y. Lindell and T. Rabin. Information-Theoretically Secure Protocols and Security Under Composition. In the SIAM Journal on Computing, 39(5): 2090--2112, 2010.

Digital Library

[17]

J. Launchbury, I.S. Diatchki, T. DuBuisson and A. Adams-Moran. Efficient lookup-table protocol in secure multiparty computation. In ACM ICFP'12, pages 189--200, 2012.

Digital Library

[18]

. Laur, R. Talviste and J. Willemson. From Oblivious AES to Efficient and Secure Database Join in the Multiparty Setting. In ACNS'13, Springer (LNCS 7954), pages 84--101, 2013.

Digital Library

[19]

J. Perry, A. Ousterhout, H. Balakrishnan, D. Shah and H Fugal. Fastpass: a centralized "zero-queue" datacenter network. In SIGCOMM 2014, pages 307--318, 2014

Digital Library

[20]

T. Rabin, M. Ben-Or.Verifiable Secret Sharing and Multiparty Protocols with Honest Majority (Extended Abstract). STOC 1989: 73--85

Digital Library

[21]

. Randmets. Personal comm. -- AES performance on the new Sharemind cluster. May, 2016.

[22]

. Talviste. Applying Secure Multi-Party Computation in Practice. Ph.D dissertation, Univ. of Tartu, 2016.

[23]

. Shamir. How to Share a Secret. Communications of the ACM, 22(11):612--613, 1979.

Digital Library

[24]

. Yao. How to Generate and Exchange Secrets. In the 27th FOCS, pages 162--167, 1986.

Digital Library

[25]

. Zahur, M. Rosulek and D. Evans.Two Halves Make a Whole - Reducing Data Transfer in Garbled Circuits Using Half Gates. EUROCRYPT, pages 220--250, 2015.

[26]

Sharemind, Cybernetica. https://sharemind.cyber.ee.

Cited By

Breuer MHein PPompe LMeyer UWetzel S(2024)Prioritization and exchange chains in privacy-preserving kidney exchangeJournal of Computer Security10.3233/JCS-230012(1-56)Online publication date: 5-Feb-2024
https://doi.org/10.3233/JCS-230012
Cheng NÖnen MMitrokotsa AChouchane OTodisco MIbarrondo AQuek TGao DZhou JCardenas A(2024)Nomadic: Normalising Maliciously-Secure Distance with Cosine Similarity for Two-Party Biometric AuthenticationProceedings of the 19th ACM Asia Conference on Computer and Communications Security10.1145/3634737.3657022(257-273)Online publication date: 1-Jul-2024
https://dl.acm.org/doi/10.1145/3634737.3657022
Breuer MMeyer UWetzel SQuek TGao DZhou JCardenas A(2024)Efficient Privacy-Preserving Approximation of the Kidney Exchange ProblemProceedings of the 19th ACM Asia Conference on Computer and Communications Security10.1145/3634737.3645015(306-322)Online publication date: 1-Jul-2024
https://dl.acm.org/doi/10.1145/3634737.3645015
Show More Cited By

Index Terms

High-Throughput Semi-Honest Secure Three-Party Computation with an Honest Majority
1. Theory of computation
  1. Computational complexity and cryptography
    1. Cryptographic protocols

Recommendations

Optimizing Semi-Honest Secure Multiparty Computation for the Internet
CCS '16: Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security

In the setting of secure multiparty computation, a set of parties with private inputs wish to compute some function of their inputs without revealing anything but their output. Over the last decade, the efficiency of secure two-party computation has ...
Two-Thirds Honest-Majority MPC for Malicious Adversaries at Almost the Cost of Semi-Honest
CCS '19: Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security

Secure multiparty computation (MPC) enables a set of parties to securely carry out a joint computation of their private inputs without revealing anything but the output. Protocols for semi-honest adversaries guarantee security as long as the corrupted ...
High-Throughput Secure Three-Party Computation with an Honest Majority
Abstract
In the setting of secure multiparty computation, a set of parties wish to carry out a joint computation of their inputs while keeping them private. In this paper, we describe new information-theoretic protocols for secure three-party computation ... $^{}$

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

CCS '16: Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security

October 2016

1924 pages

ISBN:9781450341394

DOI:10.1145/2976749

General Chairs:
Edgar Weippl
SBA Research, Austria
,
Stefan Katzenbeisser
TU Darmstadt, CYSEC, Germany
,
Program Chairs:
Christopher Kruegel
University of California, Santa Barbara, USA
,
Andrew Myers
Cornell University, USA
,
Shai Halevi
IBM Research, USA

Copyright © 2016 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

SIGSAC: ACM Special Interest Group on Security, Audit, and Control

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 24 October 2016

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Funding Sources

European Research Council

Conference

CCS'16

Sponsor:

SIGSAC

CCS'16: 2016 ACM SIGSAC Conference on Computer and Communications Security

October 24 - 28, 2016

Vienna, Austria

Acceptance Rates

CCS '16 Paper Acceptance Rate 137 of 831 submissions, 16%;

Overall Acceptance Rate 1,261 of 6,999 submissions, 18%

Upcoming Conference

CCS '24

Sponsor:
sigsac

ACM SIGSAC Conference on Computer and Communications Security

October 14 - 18, 2024

Salt Lake City , UT , USA

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

234
Total Citations
View Citations
1,459
Total Downloads

Downloads (Last 12 months)205
Downloads (Last 6 weeks)20

Reflects downloads up to 11 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

Breuer MHein PPompe LMeyer UWetzel S(2024)Prioritization and exchange chains in privacy-preserving kidney exchangeJournal of Computer Security10.3233/JCS-230012(1-56)Online publication date: 5-Feb-2024
https://doi.org/10.3233/JCS-230012
Cheng NÖnen MMitrokotsa AChouchane OTodisco MIbarrondo AQuek TGao DZhou JCardenas A(2024)Nomadic: Normalising Maliciously-Secure Distance with Cosine Similarity for Two-Party Biometric AuthenticationProceedings of the 19th ACM Asia Conference on Computer and Communications Security10.1145/3634737.3657022(257-273)Online publication date: 1-Jul-2024
https://dl.acm.org/doi/10.1145/3634737.3657022
Breuer MMeyer UWetzel SQuek TGao DZhou JCardenas A(2024)Efficient Privacy-Preserving Approximation of the Kidney Exchange ProblemProceedings of the 19th ACM Asia Conference on Computer and Communications Security10.1145/3634737.3645015(306-322)Online publication date: 1-Jul-2024
https://dl.acm.org/doi/10.1145/3634737.3645015
Carter AHernandez RHomsi SCosgrove M(2024)Security games with malicious adversaries in the clouds: status updateAssurance and Security for AI-enabled Systems10.1117/12.3014000(23)Online publication date: 10-Jun-2024
https://doi.org/10.1117/12.3014000
Wang SZheng YJia XWang C(2024)eGrass: An Encrypted Attributed Subgraph Matching System With Malicious SecurityIEEE Transactions on Information Forensics and Security10.1109/TIFS.2024.340908919(5999-6014)Online publication date: 2024
https://doi.org/10.1109/TIFS.2024.3409089
Pohle EAbidin APreneel B(2024)Fast Evaluation of S-Boxes With Garbled CircuitsIEEE Transactions on Information Forensics and Security10.1109/TIFS.2024.340214519(5530-5544)Online publication date: 2024
https://doi.org/10.1109/TIFS.2024.3402145
Eshun SPalmieri P(2024)A Cryptographic Protocol for Efficient Mutual Location Privacy Through Outsourcing in Indoor Wi-Fi LocalizationIEEE Transactions on Information Forensics and Security10.1109/TIFS.2024.337280519(4086-4099)Online publication date: 2024
https://doi.org/10.1109/TIFS.2024.3372805
Tong QLi XMiao YWang YLiu XDeng R(2024)Beyond Result Verification: Efficient Privacy-Preserving Spatial Keyword Query With Suppressed LeakageIEEE Transactions on Information Forensics and Security10.1109/TIFS.2024.335441419(2746-2760)Online publication date: 2024
https://doi.org/10.1109/TIFS.2024.3354414
Li JWang JZhang RXin YXu W(2024)NEMO: Practical Distributed Boolean Queries With Minimal LeakageIEEE Transactions on Information Forensics and Security10.1109/TIFS.2024.335143319(2594-2608)Online publication date: 2024
https://doi.org/10.1109/TIFS.2024.3351433
Wang RLuo MFeng QPeng CHe D(2024)Multi-Party Privacy-Preserving Faster R-CNN Framework for Object DetectionIEEE Transactions on Emerging Topics in Computational Intelligence10.1109/TETCI.2023.32965028:1(956-967)Online publication date: Feb-2024
https://doi.org/10.1109/TETCI.2023.3296502
Show More Cited By

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents