Order-C secure multiparty computation for highly repetitive circuits
From MaRDI portal
Publication:2056761
Cites work
- Circuits resilient to additive attacks with applications to secure computation
- Efficient multi-party computation: from passive to active security via secure SIMD circuits
- Fast large-scale honest-majority MPC for malicious adversaries
- Guaranteed output delivery comes free in honest majority MPC
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- How to share a secret
- scientific article; zbMATH DE number 5485433 (Why is no real title available?)
- Minimising communication in honest-majority MPC by batchwise multiplication verification
- Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography
- Robust Multiparty Computation with Linear Communication Complexity
- Scalable and Unconditionally Secure Multiparty Computation
- Scalable Multiparty Computation with Nearly Optimal Work and Resilience
- Scalable Secure Multiparty Computation
- The knowledge complexity of interactive proof-systems
Cited in
(10)- Secure multiparty computation with free branching
- Generalized pseudorandom secret sharing and efficient straggler-resilient secure computation
- \textsc{SuperPack}: dishonest majority MPC with constant online communication
- Sharing transformation and dishonest majority MPC with packed secret sharing
- Efficient NIZKs from LWE via polynomial reconstruction and ``MPC in the head
- Non-interactive zero-knowledge proofs to multiple verifiers
- Cryptography with weights: MPC, encryption and signatures
- Scalable multiparty computation from non-linear secret sharing
- Weakly super-invertible matrices and constant communication dishonest majority MPC
- Multi-committee MPC: from unanimous to identifiable abort
This page was built for publication: Order-C secure multiparty computation for highly repetitive circuits
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2056761)
