poster

Poster MPClan:: Protocol Suite for Privacy-Conscious Computations

Authors:

Shravani Patil,

Ajith SureshAuthors Info & Claims

CCS '22: Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security

Pages 3379 - 3381

https://doi.org/10.1145/3548606.3563496

Published: 07 November 2022 Publication History

Abstract

The growing volumes of data collected and its analysis to provide better services create worries about digital privacy. The literature has relied on secure multiparty computation techniques to address privacy concerns and give practical solutions. However, recent research has mostly focused on the small-party honest-majority setting of up to four parties, noting efficiency concerns. In this work, we extend the strategies to support a larger number of participants in honest-majority setting with efficiency at the center stage.

Designed in the preprocessing paradigm, our semi-honest protocol improves the online complexity of the decade-old state-of-the-art protocol of Damgård and Nielson (CRYPTO'07). In addition to having an improved online communication cost, we can shut down almost half of the parties in the online phase, thereby saving up to 50% in the system's operational costs. Our maliciously secure protocol also enjoys similar benefits and requires only half of the parties, except for a one-time verification, towards the end.

We benchmark popular applications such as deep neural networks, graph neural networks and genome sequence matching using prototype implementations to showcase the practicality of the designed protocols. Our improved protocols aid in bringing up to 60-80% savings in monetary cost over prior work.

References

[1]

Dan Boneh, Elette Boyle, Henry Corrigan-Gibbs, Niv Gilboa, and Yuval Ishai. 2019. Zero-Knowledge Proofs on Secret-Shared Data via Fully Linear PCPs. In CRYPTO.

[2]

Megha Byali, Harsh Chaudhari, Arpita Patra, and Ajith Suresh. 2020. FLASH: Fast and Robust Framework for Privacy-preserving Machine Learning. PETS (2020).

[3]

Harsh Chaudhari, Ashish Choudhury, Arpita Patra, and Ajith Suresh. 2019. ASTRA: High Throughput 3PC over Rings with Application to Secure Prediction. In ACM CCSW@CCS.

Digital Library

[4]

Harsh Chaudhari, Rahul Rachuri, and Ajith Suresh. 2020. Trident: Efficient 4PC Framework for Privacy Preserving Machine Learning. In NDSS.

[5]

Cryptography and Privacy Engineering Group at TU Darmstadt. 2017. ENCRYPTO Utils. https://github.com/encryptogroup/ENCRYPTO_utils.

[6]

Ivan Damgård and Jesper Buus Nielsen. 2007. Scalable and unconditionally secure multiparty computation. In CRYPTO.

[7]

Michaël Defferrard, Xavier Bresson, and Pierre Vandergheynst. 2016. Convolutional Neural Networks on Graphs with Fast Localized Spectral Filtering. In NeurIPS.

[8]

Daniel Escudero and Anders Dalskov. 2021. Honest Majority MPC with Abort with Minimal Online Communication. In LATINCRYPT.

[9]

Daniel Genkin, Yuval Ishai, Manoj M Prabhakaran, Amit Sahai, and Eran Tromer. 2014. Circuits resilient to additive attacks with applications to secure computation. In STOC.

[10]

Vipul Goyal, Yanyi Liu, and Yifan Song. 2019. Communication-efficient unconditional MPC with guaranteed output delivery. In CRYPTO. Springer.

[11]

Vipul Goyal and Yifan Song. 2020. Malicious Security Comes Free in Honest-Majority MPC. In CRYPTO.

[12]

Nishat Koti, Mahak Pancholi, Arpita Patra, and Ajith Suresh. 2021. SWIFT: Super-fast and Robust Privacy-Preserving Machine Learning. In USENIX Security.

[13]

Nishat Koti, Shravani Patil, Arpita Patra, and Ajith Suresh. 2022a. MPClan: Protocol Suite for Privacy-Conscious Computations. Cryptology ePrint Archive, Paper 2022/675. https://eprint.iacr.org/2022/675

[14]

Nishat Koti, Arpita Patra, Rahul Rachuri, and Ajith Suresh. 2022b. Tetrad: Actively Secure 4PC for Secure Training and Inference. NDSS.

[15]

Yann LeCun, Léon Bottou, Yoshua Bengio, and Patrick Haffner. 1998. Gradient-based learning applied to document recognition. Proc. of the IEEE (1998).

[16]

Yann LeCun and Corinna Cortes. 2010. MNIST handwritten digit database. (2010). http://yann.lecun.com/exdb/mnist/.

[17]

Payman Mohassel and Peter Rindal. 2018. ABY(3): A Mixed Protocol Framework for Machine Learning. In CCS.

[18]

Arpita Patra, Thomas Schneider, Ajith Suresh, and Hossein Yalame. 2021. ABY2.0: Improved Mixed-Protocol Secure Two-Party Computation. In USENIX Security.

[19]

Arpita Patra and Ajith Suresh. 2020. BLAZE: Blazing Fast Privacy-Preserving Machine Learning. In NDSS.

[20]

Thomas Schneider and Oleksandr Tkachenko. 2019. EPISODE: efficient privacy-preserving similar sequence queries on outsourced genomic databases. In AsiaCCS.

[21]

Liyan Shen, Xiaojun Chen, Jinqiao Shi, Ye Dong, and Binxing Fang. 2020. An Efficient 3-Party Framework for Privacy-Preserving Neural Network Inference. In ESORICS.

[22]

Karen Simonyan and Andrew Zisserman. 2015. Very Deep Convolutional Networks for Large-Scale Image Recognition. In ICLR.

Cited By

Gehlhar TMarx FSchneider TSuresh AWehrle TYalame H(2023)SafeFL: MPC-friendly Framework for Private and Robust Federated Learning2023 IEEE Security and Privacy Workshops (SPW)10.1109/SPW59333.2023.00012(69-76)Online publication date: May-2023
https://doi.org/10.1109/SPW59333.2023.00012
Brüggemann AHundt RSchneider TSuresh AYalame H(2023)FLUTE: Fast and Secure Lookup Table Evaluations2023 IEEE Symposium on Security and Privacy (SP)10.1109/SP46215.2023.10179345(515-533)Online publication date: May-2023
https://doi.org/10.1109/SP46215.2023.10179345

Recommendations

Poster: Efficient Three-Party Shuffling Using Precomputation
CCS '22: Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security

In this paper, we revisit the problem of secure shuffling in a three-server setting with an honest majority. We begin with the recent work of Araki. et al. (CCS'21) and use precomputation to improve the communication and round complexity of the online ...
On the theoretical gap between synchronous and asynchronous MPC protocols
PODC '10: Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Multiparty computation (MPC) protocols among n parties secure against t active faults are known to exist if and only if
- t < n/2, when the channels are synchronous, and
- t < n/3, when the channels are asynchronous, respectively.
In this work we analyze ...
Revisiting the Efficiency of Perfectly Secure Asynchronous Multi-party Computation Against General Adversaries
Progress in Cryptology – INDOCRYPT 2022
Abstract
In this paper, we present a perfectly-secure multi-party computation (MPC) protocol in the asynchronous communication setting with optimal resilience. Our protocol is secure against a computationally-unbounded malicious adversary characterized by ... $^{}$ $^{}$ $^{}$

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

CCS '22: Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security

November 2022

3598 pages

ISBN:9781450394505

DOI:10.1145/3548606

General Chairs:
Heng Yin
University of California, Riverside
,
Angelos Stavrou
Virginia Tech
,
Program Chairs:
Cas Cremers
CISPA Helmholtz Center for Information Security
,
Elaine Shi
Carnegie Mellon University

Copyright © 2022 Owner/Author.

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.

Sponsors

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

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 07 November 2022

Check for updates

Author Tags

Qualifiers

Poster

Funding Sources

European Union?s Horizon 2020 research and innovation program
Google India AI/ML Research Award
SERB MATRICS (Theoretical Sciences) Grant
Deutsche Forschungsgemeinschaft (DFG)
Centre for Networked Intelligence (a Cisco CSR initiative)
DST National Mission on Interdisciplinary Cyber-Physical Systems (NM-CPS)

Conference

CCS '22

Sponsor:

SIGSAC

CCS '22: 2022 ACM SIGSAC Conference on Computer and Communications Security

November 7 - 11, 2022

CA, Los Angeles, USA

Acceptance Rates

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

2
Total Citations
View Citations
119
Total Downloads

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

Reflects downloads up to 03 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

Gehlhar TMarx FSchneider TSuresh AWehrle TYalame H(2023)SafeFL: MPC-friendly Framework for Private and Robust Federated Learning2023 IEEE Security and Privacy Workshops (SPW)10.1109/SPW59333.2023.00012(69-76)Online publication date: May-2023
https://doi.org/10.1109/SPW59333.2023.00012
Brüggemann AHundt RSchneider TSuresh AYalame H(2023)FLUTE: Fast and Secure Lookup Table Evaluations2023 IEEE Symposium on Security and Privacy (SP)10.1109/SP46215.2023.10179345(515-533)Online publication date: May-2023
https://doi.org/10.1109/SP46215.2023.10179345

View Options

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.

Figures

Tables

Media

View Table of Conten