Unconditional communication-efficient MPC via Hall's marriage theorem

DOI10.1007/978-3-030-84245-1_10MaRDI QIDQ2128564zbMATH OpenOpenAlexFDO

Authors Vipul Goyal, Antigoni Polychroniadou, Yifan Song

Publication date 22 April 2022

Full work available at URL https://doi.org/10.1007/978-3-030-84245-1_10

zbMATH Keywords

communication complexityparty unconditional multiparty computation protocols

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Communication-efficient unconditional MPC with guaranteed output delivery
• Near-linear unconditionally-secure multiparty computation with a dishonest minority
• Scalable and Unconditionally Secure Multiparty Computation
• Guaranteed output delivery comes free in honest majority MPC
• Perfectly-Secure MPC with Linear Communication Complexity

Cites work

• Amortized complexity of information-theoretically secure MPC revisited
• Circuits resilient to additive attacks with applications to secure computation
• Constant-overhead unconditionally secure multiparty computation over binary fields
• Efficient fully secure computation via distributed zero-knowledge proofs
• 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 share a secret
• Minimising communication in honest-majority MPC by batchwise multiplication verification
• Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography
• Scalable and Unconditionally Secure Multiparty Computation
• The price of low communication in secure multi-party computation
• Zero-knowledge proofs on secret-shared data via fully linear PCPs

Cited in

(10)

• \textsc{SuperPack}: dishonest majority MPC with constant online communication
• Sharing transformation and dishonest majority MPC with packed secret sharing
• Cryptography with weights: MPC, encryption and signatures
• On information-theoretic secure multiparty computation with local repairability
• Secure multiparty computation with free branching
• Communication-efficient unconditional MPC with guaranteed output delivery
• Non-interactive zero-knowledge proofs to multiple verifiers
• Scalable multiparty computation from non-linear secret sharing
• Stochastic secret sharing with 1-bit shares and applications to MPC
• Efficient NIZKs from LWE via polynomial reconstruction and ``MPC in the head

This page was built for publication: Unconditional communication-efficient MPC via Hall's marriage theorem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2128564)