MPC for tech giants (GMPC): enabling Gulliver and the Lilliputians to cooperate amicably

DOI10.1007/978-3-031-68397-8_3MaRDI QIDQ6653024zbMATH OpenFDO

Authors Bar Alon, Moni Naor, Eran Omri, Uri Stemmer

Publication date 13 December 2024

Full work available at URL https://doi.org/10.1007/978-3-031-68397-8_3

zbMATH Keywords

generic protocols in the GMPC modelGulliver multi-party computation model

Mathematics Subject Classification ID

Distributed systems (68M14) Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• MPC for MPC: Secure Computation on a Massively Parallel Computing Architecture
• Secure multi-party computation in large networks
• Secure Multiparty Computation
• Perfectly-Secure MPC with Linear Communication Complexity
• Fully-secure MPC with minimal trust

Cites work

• A unified framework for UC from only OT
• Amplification by shuffling: from local to central differential privacy via anonymity
• Breaking the O(√ n)-Bit Barrier
• Communication Locality in Secure Multi-party Computation
• Distributed differential privacy via shuffling
• Foundations of Cryptography
• Know thy neighbor's neighbor: the power of lookahead in randomized P2P networks
• Leakage-resilient coin tossing
• Lower bounds and impossibility results for concurrent self composition
• Must the communication graph of MPC protocols be an expander?
• On the power of multiple anonymous messages: frequency estimation and selection in the shuffle model of differential privacy
• On the round complexity of the shuffle model
• Reaching Agreement in the Presence of Faults
• Security and composition of multiparty cryptographic protocols
• The bottleneck complexity of secure multiparty computation
• The Byzantine Generals Problem
• The hidden graph model: communication locality and optimal resiliency with adaptive faults
• The limits of pan privacy and shuffle privacy for learning and estimation
• The power of distributed verifiers in interactive proofs
• The power of synergy in differential privacy: combining a small curator with local randomizers
• The privacy blanket of the shuffle model
• The small-world phenomenon: an algorithmic perspective
• Theory of Cryptography
• Theory of Cryptography
• YOSO: You only speak once. Secure MPC with stateless ephemeral roles
• Zero-knowledge proofs on secret-shared data via fully linear PCPs

Cited in

(1)

• MPC for MPC: Secure Computation on a Massively Parallel Computing Architecture

This page was built for publication: MPC for tech giants (GMPC): enabling Gulliver and the Lilliputians to cooperate amicably

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6653024)