poster

How to Choose Suitable Secure Multiparty Computation Using Generalized SPDZ

Authors:

Hikaru TsuchidaAuthors Info & Claims

CCS '18: Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security

Pages 2198 - 2200

https://doi.org/10.1145/3243734.3278510

Published: 15 October 2018 Publication History

Get Access

Abstract

A variety of secure multiparty computation (MPC) protocols have been proposed up to now. Since their performance characteristics are incomparable, the most suitable MPC protocol may be completely different depending on the given computational task and environment. It is tedious work to compare all the possibility to choose the most suitable MPC. The paper " Generalizing the SPDZ Compiler For Other Protocols'' in this ACM-CCS 2018 shows a framework for adding MPC protocols to a development tool of MPC program called "SPDZ'', which enables to compare multiple protocols easily. This poster and demo show how this framework is useful for choosing the suitable protocol for given target computation and environment.

References

[1]

. Araki, A. Barak, J. Furukawa, M. Keller, Y. Lindell, K. Ohara and H. Tsuchida. Generalizing the SPDZ Compiler For Other Protocols. To appear at ACM CCS 2018.

Digital Library

Google Scholar

[2]

ristol Cryptography Group. Multiparty computation with SPDZ, MASCOT, and Overdrive offline phases https://github.com/bristolcrypto/SPDZ-2

Google Scholar

[3]

. Damgård, V. Pastro, N.P. Smart and S. Zakarias. Multiparty Computation from Somewhat Homomorphic Encryption. In CRYPTO 2012, pages 643--662, 2012.

Digital Library

Google Scholar

[4]

. Lindell and A. Nof. A Framework for Constructing Fast MPC over ArithmeticCircuits with Malicious Adversaries and an Honest-Majority. In the 24th ACMCCS, pages 259--276, 2017.

Digital Library

Google Scholar

[5]

. Araki, J. Furukawa, Y. Lindell, A. Nof and K. Ohara. High-Throughput Semi-Honest Secure Three-Party Computation with an Honest Majority. In the 23rdACM CCS, pages 805--817, 2016.

Digital Library

Google Scholar

[6]

Araki, A. Barak, J. Furukawa, T. Lichter, Y. Lindell, A. Nof, K. Ohara, A. Watzmanand O. Weinstein. Optimized Honest-Majority MPC for Malicious Adversaries- Breaking the 1 Billion-Gate Per Second Barrier. In the 38th IEEESymposium on Security and Privacy, pages 843--862, 2017.

Crossref

Google Scholar

[7]

arcel Keller, Valerio Pastro, and Dragos Rotaru. Overdrive: Making SPDZ great again. In EUROCRYPT 2018, Springer (LNCS 10822), pages 158--189, 2018.

Crossref

Google Scholar

Cited By

View all

TSUCHIDA HNISHIDE T(2022)Constant-Round Fair SS-4PC for Private Decision Tree EvaluationIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences10.1587/transfun.2021DMP0016E105.A:9(1270-1288)Online publication date: 1-Sep-2022
https://doi.org/10.1587/transfun.2021DMP0016
TSUCHIDA HNISHIDE TMAEDA Y(2022)Private Decision Tree Evaluation with Constant Rounds via (Only) SS-3PC over Ring and FieldIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences10.1587/transfun.2021CIP0018E105.A:3(214-230)Online publication date: 1-Mar-2022
https://doi.org/10.1587/transfun.2021CIP0018
Xu RJoshi JLi C(2022) NN-EMD: Efficiently Training Neural Networks Using Encrypted Multi-Sourced Datasets IEEE Transactions on Dependable and Secure Computing10.1109/TDSC.2021.307443919:4(2807-2820)Online publication date: 1-Jul-2022
https://doi.org/10.1109/TDSC.2021.3074439
Show More Cited By

Index Terms

How to Choose Suitable Secure Multiparty Computation Using Generalized SPDZ
1. Security and privacy
  1. Cryptography
  2. Security services
    1. Privacy-preserving 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 ...
$1 / p$ -Secure Multiparty Computation without an Honest Majority and the Best of Both Worlds
Abstract
A protocol for computing a functionality is secure if an adversary in this protocol cannot cause more harm than in an ideal computation, where parties give their inputs to a trusted party that returns the output of the functionality to all ...
Bit Decomposition Protocols in Secure Multiparty Computation
WAHC '18: Proceedings of the 6th Workshop on Encrypted Computing & Applied Homomorphic Cryptography

We present improved protocols for the conversion of secret-shared bit-vectors into secret-shared integers and vice versa, for the use as subroutines in secure multiparty computation (SMC) protocols and for protocols verifying the adherence of parties to ...

Comments

Information & Contributors

Information

Published In

CCS '18: Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security

October 2018

2359 pages

ISBN:9781450356930

DOI:10.1145/3243734

General Chairs:
David Lie
University of Toronto
,
Mohammad Mannan
Concordia University
,
Program Chairs:
Michael Backes
CISPA Helmholtz Center i.G.
,
XiaoFeng Wang
Indiana University

Permission to make digital or hard copies of part or all 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 third-party components of this work must be honored. For all other uses, contact the Owner/Author.

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 15 October 2018

Check for updates

Author Tags

Qualifiers

Poster

Conference

CCS '18

Sponsor:

SIGSAC

CCS '18: 2018 ACM SIGSAC Conference on Computer and Communications Security

October 15 - 19, 2018

Toronto, Canada

Acceptance Rates

CCS '18 Paper Acceptance Rate 134 of 809 submissions, 17%;

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

Upcoming Conference

CCS '25

Sponsor:
sigsac

ACM SIGSAC Conference on Computer and Communications Security

October 13 - 17, 2025

Taipei , Taiwan

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

5
Total Citations
View Citations
337
Total Downloads

Downloads (Last 12 months)27
Downloads (Last 6 weeks)4

Reflects downloads up to 18 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

TSUCHIDA HNISHIDE T(2022)Constant-Round Fair SS-4PC for Private Decision Tree EvaluationIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences10.1587/transfun.2021DMP0016E105.A:9(1270-1288)Online publication date: 1-Sep-2022
https://doi.org/10.1587/transfun.2021DMP0016
TSUCHIDA HNISHIDE TMAEDA Y(2022)Private Decision Tree Evaluation with Constant Rounds via (Only) SS-3PC over Ring and FieldIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences10.1587/transfun.2021CIP0018E105.A:3(214-230)Online publication date: 1-Mar-2022
https://doi.org/10.1587/transfun.2021CIP0018
Xu RJoshi JLi C(2022) NN-EMD: Efficiently Training Neural Networks Using Encrypted Multi-Sourced Datasets IEEE Transactions on Dependable and Secure Computing10.1109/TDSC.2021.307443919:4(2807-2820)Online publication date: 1-Jul-2022
https://doi.org/10.1109/TDSC.2021.3074439
Tsuchida HNishide T(2021)Private Decision Tree Evaluation with Constant Rounds via (Only) Fair SS-4PCInformation Security and Privacy10.1007/978-3-030-90567-5_16(309-329)Online publication date: 4-Nov-2021
https://doi.org/10.1007/978-3-030-90567-5_16
Tsuchida HNishide TMaeda Y(2020)Private Decision Tree Evaluation with Constant Rounds via (Only) SS-3PC over RingProvable and Practical Security10.1007/978-3-030-62576-4_15(298-317)Online publication date: 20-Nov-2020
https://doi.org/10.1007/978-3-030-62576-4_15

View Options

Login options

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

Cited By

Index Terms

Recommendations

Optimizing Semi-Honest Secure Multiparty Computation for the Internet

$1 / p$ -Secure Multiparty Computation without an Honest Majority and the Best of Both Worlds

Bit Decomposition Protocols in Secure Multiparty Computation