Scalable multiparty computation from non-linear secret sharing

DOI10.1007/978-3-031-68397-8_12MaRDI QIDQ6653034zbMATH OpenFDO

Authors Sanjam Garg, Abhishek Jain, Pratyay Mukherjee, Mingyuan Wang

Publication date 13 December 2024

Full work available at URL https://doi.org/10.1007/978-3-031-68397-8_12

zbMATH Keywords

multiparty computationscalable MPCsecret sharing

Mathematics Subject Classification ID

Distributed systems (68M14) Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Scalable Secure Multiparty Computation
• Scalable and Unconditionally Secure Multiparty Computation
• Multi-party computation with conversion of secret sharing
• General secure multi-party computation from any linear secret-sharing scheme
• Perfectly-Secure MPC with Linear Communication Complexity

Cites work

• A full proof of the BGW protocol for perfectly secure multiparty computation
• A modular approach to key safeguarding
• Boolean circuits versus arithmetic circuits
• Chinese remaindering with errors
• Communication lower bounds for statistically secure MPC, with or without preprocessing
• Cryptography with weights: MPC, encryption and signatures
• Efficient arithmetic in garbled circuits
• Efficient information-theoretic multi-party computation over non-commutative rings
• Efficient information-theoretic secure multiparty computation over \(\mathbb{Z}/p^k\mathbb{Z}\) via Galois rings
• Efficient multi-party computation: from passive to active security via secure SIMD circuits
• Even faster integer multiplication
• Fast modular transforms
• Fast multiplication of large numbers
• Faster integer multiplication
• Fully homomorphic encryption using ideal lattices
• How to Garble Arithmetic Circuits
• How to share a secret
• scientific article; zbMATH DE number 176543 (Why is no real title available?)
• scientific article; zbMATH DE number 176564 (Why is no real title available?)
• scientific article; zbMATH DE number 2009982 (Why is no real title available?)
• Integer multiplication in time \(O(n\log n)\)
• More efficient dishonest majority secure computation over \(\mathbb{Z}_{2^k}\) via Galois rings
• Multiparty computation with low communication, computation and interaction via threshold FHE
• New ways to garble arithmetic circuits
• Order-C secure multiparty computation for highly repetitive circuits
• Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography
• Scalable and Unconditionally Secure Multiparty Computation
• Scalable Multiparty Computation with Nearly Optimal Work and Resilience
• Sharing transformation and dishonest majority MPC with packed secret sharing
• Two round multiparty computation via multi-key FHE
• Unconditional communication-efficient MPC via Hall's marriage theorem

Cited in

(1)

• SCALES. MPC with small clients and larger ephemeral servers

This page was built for publication: Scalable multiparty computation from non-linear secret sharing

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