Home > Proof Systems > DI06-Scalable-MPC
Scalable Secure Multiparty Computation¶
Description¶
Introduces scalable constructions for secure multiparty computation (MPC). While primarily an MPC paper, its techniques for efficient proof systems and commitments in the multi-party setting influenced later ZKP constructions.
Technical Characteristics¶
Complexity: - Prover: Polynomial - Verifier: Polynomial - Proof Size: Sublinear - Setup: transparent
Security: - Assumption: computational - Post-quantum: no (original formulation) - Basis: Information-theoretic MPC, secret sharing
Dependencies¶
Based on: Sigma-Protocols-Damgard, Pedersen-Commitments Circuit representation:
Applications¶
Used by: Ligero, Bulletproofs
Resources¶
- Paper: DI06-Scalable-MPC
- Code:
- Explainer: