Perfectly-secure MPC with constant online communication complexity
From MaRDI portal
Cites work
- ATLAS: efficient and scalable MPC in the honest majority setting
- Communication-efficient unconditional MPC with guaranteed output delivery
- Detect, pack and batch: perfectly-secure MPC with linear communication and constant expected time
- Efficient perfectly secure computation with optimal resilience
- Fully secure MPC and zk-FLIOP over rings: new constructions, improvements and extensions
- Guaranteed output delivery comes free in honest majority MPC
- How to share a secret
- scientific article; zbMATH DE number 1583776 (Why is no real title available?)
- scientific article; zbMATH DE number 4195141 (Why is no real title available?)
- MPC with delayed parties over star-like networks
- Perfect (parallel) broadcast in constant expected rounds via statistical VSS
- Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography
- Perfectly-secure MPC with constant online communication complexity
- Perfectly-Secure MPC with Linear Communication Complexity
- Perfectly-secure multiplication for any \(t < n/3\)
- Scalable and Unconditionally Secure Multiparty Computation
- Security and composition of multiparty cryptographic protocols
- Sharing transformation and dishonest majority MPC with packed secret sharing
- Theory of Cryptography
- Unconditional communication-efficient MPC via Hall's marriage theorem
Cited in
(2)
This page was built for publication: Perfectly-secure MPC with constant online communication complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6955263)
