On fully-secure honest majority MPC without n^2 round overhead
From MaRDI portal
(Redirected from Publication:6619922)
On fully-secure honest majority MPC without \(n^2\) round overhead
On fully-secure honest majority MPC without \(n^2\) round overhead
Recommendations
Cites work
- Asymptotically free broadcast in constant expected time via packed VSS
- Detect, pack and batch: perfectly-secure MPC with linear communication and constant expected time
- Efficient fully secure computation via distributed zero-knowledge proofs
- Efficient perfectly secure computation with optimal resilience
- Essentially Optimal Robust Secret Sharing with Maximal Corruptions
- Guaranteed output delivery comes free in honest majority MPC
- scientific article; zbMATH DE number 1583776 (Why is no real title available?)
- Near-linear unconditionally-secure multiparty computation with a dishonest minority
- Perfectly-Secure MPC with Linear Communication Complexity
- Scalable and Unconditionally Secure Multiparty Computation
- Secure multiparty computation and secret sharing
- Secure protocol transformations
- Semi-homomorphic encryption and multiparty computation
- Simplified VSS and fast-track multiparty computations with applications to threshold cryptography
- Theory of Cryptography
- Towards optimal robust secret sharing with security against a rushing adversary
Cited in
(1)
This page was built for publication: On fully-secure honest majority MPC without \(n^2\) round overhead
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6619922)
