The broadcast message complexity of secure multiparty computation

DOI10.1007/978-3-030-34578-5_16MaRDI QIDQ2181889zbMATH OpenOpenAlexFDO

Authors Sanjam Garg, Aarushi Goel, Abhishek Jain

Publication date 20 May 2020

Full work available at URL https://doi.org/10.1007/978-3-030-34578-5_16

zbMATH Keywords

MPC protocolssimultaneous broadcast model

Mathematics Subject Classification ID

Network protocols (68M12) Distributed systems (68M14) Communication theory (94A05) Cryptography (94A60)

Recommendations

• On the message complexity of secure multiparty computation
• Broadcast-optimal two-round MPC
• Perfectly-Secure MPC with Linear Communication Complexity
• scientific article; zbMATH DE number 7706034
• Brief announcement: Breaking the O(nm) bit barrier, secure multiparty computation with a static adversary

Cited in

(13)

• The complexity of multiparty PSM protocols and related models
• On the message complexity of secure multiparty computation
• Characterization of secure multiparty computation without broadcast
• Joint encryption and message-efficient secure computation
• Communication complexity of secure distributed computation in the presence of noise
• The bottleneck complexity of secure multiparty computation
• On the bottleneck complexity of MPC with correlated randomness
• On the complexity of broadcast setup
• Round-Efficient Secure Computation in Point-to-Point Networks
• Upper Bounds on the Communication Complexity of Optimally Resilient Cryptographic Multiparty Computation
• Brief announcement: Breaking the O(nm) bit barrier, secure multiparty computation with a static adversary
• Asymptotically free broadcast in constant expected time via packed VSS
• On the round complexity of fully secure solitary MPC with honest majority

This page was built for publication: The broadcast message complexity of secure multiparty computation

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