Amortized complexity of information-theoretically secure MPC revisited
From MaRDI portal
Publication:775982
DOI10.1007/978-3-319-96878-0_14zbMATH Open1457.94201OpenAlexW2810304253MaRDI QIDQ775982FDOQ775982
Ronald Cramer, Chen Yuan, Ignacio Cascudo, Chaoping Xing
Publication date: 30 June 2020
Full work available at URL: https://ir.cwi.nl/pub/27943
Recommendations
- Perfectly-Secure MPC with Linear Communication Complexity
- A secret-sharing based MPC protocol for Boolean circuits with good amortized complexity
- Efficient asynchronous verifiable secret sharing and multiparty computation
- Amortizing Garbled Circuits
- Simple and Efficient Perfectly-Secure Asynchronous MPC
Cited In (30)
- Efficient information-theoretic secure multiparty computation over \(\mathbb{Z}/p^k\mathbb{Z}\) via Galois rings
- Sharing transformation and dishonest majority MPC with packed secret sharing
- Efficient information-theoretic multi-party computation over non-commutative rings
- Mhz2K: MPC from HE over \(\mathbb{Z}_{2^k}\) with new packing, simpler reshare, and better ZKP
- Asymptotically-good arithmetic secret sharing over \(\mathbb{Z}/p^{\ell }\mathbb{Z}\) with strong multiplication and its applications to efficient MPC
- Unconditional communication-efficient MPC via Hall's marriage theorem
- Improved single-round secure multiplication using regenerating codes
- Amortized NISC over \(\mathbb{Z}_{2^k}\) from RMFE
- Degree-\(D\) reverse multiplication-friendly embeddings: constructions and applications
- Ramp hyper-invertible matrices and their applications to MPC protocols
- Asymptotically good multiplicative LSSS over Galois rings and applications to MPC over \(\mathbb{Z}/p^k\mathbb{Z} \)
- Circuit amortization friendly encodingsand their application to statistically secure multiparty computation
- \textsf{Mac'n'Cheese}: zero-knowledge proofs for Boolean and arithmetic circuits with nested disjunctions
- On interactive oracle proofs for Boolean R1CS statements
- Improved threshold signatures, proactive secret sharing, and input certification from LSS isomorphisms
- The price of active security in cryptographic protocols
- Homomorphic secret sharing for multipartite and general adversary structures supporting parallel evaluation of low-degree polynomials
- An efficient passive-to-active compiler for honest-majority MPC over rings
- Asymptotically quasi-optimal cryptography
- Field instruction multiple data
- Limits of polynomial packings for \(\mathbb{Z}_{p^k}\) and \(\mathbb{F}_{p^k}\)
- Constant-overhead unconditionally secure multiparty computation over binary fields
- More efficient dishonest majority secure computation over \(\mathbb{Z}_{2^k}\) via Galois rings
- Leakage-resilient linear secret-sharing against arbitrary bounded-size leakage family
- The quadratic hull of a code and the geometric view on multiplication algorithms
- Insured MPC: efficient secure computation with financial penalties
- Fully secure MPC and zk-FLIOP over rings: new constructions, improvements and extensions
- More efficient zero-knowledge protocols over \(\mathbb{Z}_{2^k}\) via Galois rings
- Stochastic secret sharing with 1-bit shares and applications to MPC
- Scalable agreement protocols with optimal optimistic efficiency
This page was built for publication: Amortized complexity of information-theoretically secure MPC revisited
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q775982)
