Perfectly-secure multiparty computation with linear communication complexity over any modulus
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 1583776 (Why is no real title available?)
- scientific article; zbMATH DE number 2002850 (Why is no real title available?)
- Amortized complexity of information-theoretically secure MPC revisited
- Asymptotically-good arithmetic secret sharing over \(\mathbb{Z}/p^{\ell }\mathbb{Z}\) with strong multiplication and its applications to efficient MPC
- Communication-efficient unconditional MPC with guaranteed output delivery
- Constant-overhead unconditionally secure multiparty computation over binary fields
- Degree-D reverse multiplication-friendly embeddings: constructions and applications
- Efficient information-theoretic secure multiparty computation over \(\mathbb{Z}/p^k\mathbb{Z}\) via Galois rings
- Guaranteed output delivery comes free in honest majority MPC
- How to share a secret
- Improved single-round secure multiplication using regenerating codes
- Near-linear unconditionally-secure multiparty computation with a dishonest minority
- Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography
- Perfectly-Secure MPC with Linear Communication Complexity
- Scalable and Unconditionally Secure Multiparty Computation
- Secure protocol transformations
- Security and composition of multiparty cryptographic protocols
- Sharing transformation and dishonest majority MPC with packed secret sharing
- Unconditional communication-efficient MPC via Hall's marriage theorem
Cited in
(1)
This page was built for publication: Perfectly-secure multiparty computation with linear communication complexity over any modulus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6965202)
