Honest majority GOD MPC with O(depth(C)) rounds and low online communication

DOI10.1007/978-981-96-0938-3_8MaRDI QIDQ6965196zbMATH OpenFDO

Authors Amit Agarwal, Alexander Bienstock, Ivan B. Damgård, Daniel E. Escudero

Publication date 3 July 2025

Full work available at URL https://doi.org/10.1007/978-981-96-0938-3_8

zbMATH Keywords

detectable secret sharingperfectly-secure optimally-resilient secure multi-party computation

Mathematics Subject Classification ID

Network protocols (68M12) Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Cites work

• An Efficient Framework for Unconditionally Secure Multiparty Computation
• Communication lower bounds for statistically secure MPC, with or without preprocessing
• Communication-efficient unconditional MPC with guaranteed output delivery
• Detect, pack and batch: perfectly-secure MPC with linear communication and constant expected time
• Efficient multiparty computations secure against an adaptive adversary
• Efficient multiparty protocols using circuit randomization
• Efficient perfectly secure computation with optimal resilience
• Efficient secure multi-party computation. (Extended Abstract)
• Guaranteed output delivery comes free in honest majority MPC
• Near-linear unconditionally-secure multiparty computation with a dishonest minority
• On fully-secure honest majority MPC without \(n^2\) round overhead
• Perfect constant-round secure computation via perfect randomizing polynomials
• Perfectly-Secure MPC with Linear Communication Complexity
• Scalable and Unconditionally Secure Multiparty Computation
• Secure protocol transformations
• The round complexity of statistical MPC with optimal resiliency
• Theory of Cryptography

This page was built for publication: Honest majority GOD MPC with \(O(\operatorname{depth}(C))\) rounds and low online communication

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