Fully secure MPC and zk-FLIOP over rings: new constructions, improvements and extensions
From MaRDI portal
Publication:6653026
DOI10.1007/978-3-031-68397-8_5MaRDI QIDQ6653026
Anders Dalskov, Ariel Nof, Daniel E. Escudero
Publication date: 13 December 2024
Could not fetch data.
Cites Work
- Title not available (Why is that?)
- Fast large-scale honest-majority MPC for malicious adversaries
- Amortized complexity of information-theoretically secure MPC revisited
- \(\mathrm{SPD}\mathbb {Z}_{2^k}\): efficient MPC \(\mod 2^k\) for dishonest majority
- Constant-overhead unconditionally secure multiparty computation over binary fields
- Guaranteed output delivery comes free in honest majority MPC
- A secret-sharing based MPC protocol for Boolean circuits with good amortized complexity
- ATLAS: efficient and scalable MPC in the honest majority setting
- Efficient information-theoretic multi-party computation over non-commutative rings
- Sublinear GMW-style compiler for MPC with preprocessing
- Asymptotically-good arithmetic secret sharing over \(\mathbb{Z}/p^{\ell }\mathbb{Z}\) with strong multiplication and its applications to efficient MPC
- Secure multiparty computation with sublinear preprocessing
- Zero-knowledge proofs on secret-shared data via fully linear PCPs
- Communication-efficient unconditional MPC with guaranteed output delivery
- Efficient fully secure computation via distributed zero-knowledge proofs
- Secure Protocol Transformations
- Multiparty Computation from Somewhat Homomorphic Encryption
- Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority
- Authenticated Algorithms for Byzantine Agreement
- How to share a secret
- Efficient Multi-party Computation: From Passive to Active Security via Secure SIMD Circuits
- Founding Cryptography on Oblivious Transfer – Efficiently
- Scalable and Unconditionally Secure Multiparty Computation
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Reaching Agreement in the Presence of Faults
- Foundations of Cryptography
- Theory of Cryptography
- High-Throughput Secure Three-Party Computation for Malicious Adversaries and an Honest Majority
- On interactive oracle proofs for Boolean R1CS statements
- More efficient dishonest majority secure computation over \(\mathbb{Z}_{2^k}\) via Galois rings
- An Attack on Some Signature Schemes Constructed from Five-Pass Identification Schemes
This page was built for publication: Fully secure MPC and zk-FLIOP over rings: new constructions, improvements and extensions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6653026)
