Scalable multiparty computation from non-linear secret sharing

DOI10.1007/978-3-031-68397-8_12MaRDI QIDQ6653034

Pratyay Mukherjee, Sanjam Garg, Abhishek Jain, Mingyuan Wang

Publication date: 13 December 2024

secret sharing multiparty computation scalable MPC

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

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Even faster integer multiplication
A full proof of the BGW protocol for perfectly secure multiparty computation
Fast modular transforms
Order-C secure multiparty computation for highly repetitive circuits
Unconditional communication-efficient MPC via Hall's marriage theorem
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
Communication lower bounds for statistically secure MPC, with or without preprocessing
Fast multiplication of large numbers
Boolean circuits versus arithmetic circuits
Integer multiplication in time \(O(n\log n)\)
Chinese remaindering with errors
Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE
Efficient Multi-party Computation: From Passive to Active Security via Secure SIMD Circuits
Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography
Scalable Multiparty Computation with Nearly Optimal Work and Resilience
Scalable and Unconditionally Secure Multiparty Computation
How to Share a Secret
A modular approach to key safeguarding
Fully homomorphic encryption using ideal lattices
How to Garble Arithmetic Circuits
Two Round Multiparty Computation via Multi-key FHE
New ways to garble arithmetic circuits
Sharing transformation and dishonest majority MPC with packed secret sharing
More efficient dishonest majority secure computation over \(\mathbb{Z}_{2^k}\) via Galois rings
Cryptography with weights: MPC, encryption and signatures
Efficient arithmetic in garbled circuits

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)