Actively secure MPC with O(|C|) computation and communication via CRT
From MaRDI portal
Publication:7443571
Cites work
- \textsc{SuperPack}: dishonest majority MPC with constant online communication
- A modular approach to key safeguarding
- Chinese remaindering with errors
- Circuits resilient to additive attacks with applications to secure computation
- Communication lower bounds for statistically secure MPC, with or without preprocessing
- Concretely-efficient zero-knowledge arguments for arithmetic circuits and their application to lattice-based cryptography
- Cryptography with weights: MPC, encryption and signatures
- Efficient multi-party computation: from passive to active security via secure SIMD circuits
- Efficient multiparty protocols using circuit randomization
- How to share a secret
- Malicious security in collaborative zk-SNARKs: more than meets the eye
- Multiparty Computation from Somewhat Homomorphic Encryption
- Order-C secure multiparty computation for highly repetitive circuits
- Perfectly secure fluid MPC with abort and linear communication complexity
- Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography
- Practical non-interactive publicly verifiable secret sharing with thousands of parties
- Scalable and Unconditionally Secure Multiparty Computation
- Scalable multiparty computation from non-linear secret sharing
- Sharing transformation and dishonest majority MPC with packed secret sharing
- The more the merrier: reducing the cost of large scale MPC
- Unconditional communication-efficient MPC via Hall's marriage theorem
This page was built for publication: Actively secure MPC with \(O(|C|)\) computation and communication via CRT
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7443571)