scientific article; zbMATH DE number 7706034

DOI10.4230/LIPICS.ITC.2021.2MaRDI QIDQ6107250zbMATH OpenFDO

Authors Ivan B. Damgård, Bo-yang Li

Publication date 3 July 2023

Full work available at URL https://doi.org/10.4230/LIPICS.ITC.2021.2

zbMATH Keywords

lower boundsmultiparty computation

Mathematics Subject Classification ID

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

Recommendations

• On the communication complexity of secure computation
• Communication lower bounds for statistically secure MPC, with or without preprocessing
• On the communication required for unconditionally secure multiplication
• Perfectly-Secure MPC with Linear Communication Complexity
• The price of low communication in secure multi-party computation

Cited in

(9)

• The broadcast message complexity of secure multiparty computation
• A note on the communication complexity of multiparty computation in the correlated randomness model
• Communication lower bounds for statistically secure MPC, with or without preprocessing
• On the communication required for unconditionally secure multiplication
• On the communication complexity of secure computation
• The bottleneck complexity of secure multiparty computation
• Upper Bounds on the Communication Complexity of Optimally Resilient Cryptographic Multiparty Computation
• MPC with low bottleneck-complexity: information-theoretic security and more
• New upper and lower bounds for perfectly secure MPC

This page was built for publication:

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