Efficient fully secure computation via distributed zero-knowledge proofs
From MaRDI portal
Publication:2691587
DOI10.1007/978-3-030-64840-4_9OpenAlexW3108254846MaRDI QIDQ2691587
Ariel Nof, Yuval Ishai, Niv Gilboa, Elette Boyle
Publication date: 29 March 2023
Full work available at URL: https://doi.org/10.1007/978-3-030-64840-4_9
Related Items (13)
Unconditional communication-efficient MPC via Hall's marriage theorem ⋮ Sublinear GMW-style compiler for MPC with preprocessing ⋮ Honest majority MPC with abort with minimal online communication ⋮ MPC-in-multi-heads: a multi-prover zero-knowledge proof system (or: how to jointly prove any NP statements in ZK) ⋮ Secure multiparty computation with sublinear preprocessing ⋮ \textsc{SuperPack}: dishonest majority MPC with constant online communication ⋮ MPClan: protocol suite for privacy-conscious computations ⋮ Sharing transformation and dishonest majority MPC with packed secret sharing ⋮ Attaining GOD beyond honest majority with friends and foes ⋮ Non-interactive zero-knowledge proofs to multiple verifiers ⋮ On linear communication complexity for (maximally) fluid MPC ⋮ Constant-overhead unconditionally secure multiparty computation over binary fields ⋮ Efficient compiler to covert security with public verifiability for honest majority MPC
Cites Work
- Unnamed Item
- Unnamed Item
- Fast large-scale honest-majority MPC for malicious adversaries
- Minimising communication in honest-majority MPC by batchwise multiplication verification
- Secure computation with low communication from cross-checking
- Guaranteed output delivery comes free in honest majority MPC
- Towards optimal robust secret sharing with security against a rushing adversary
- Zero-knowledge proofs on secret-shared data via fully linear PCPs
- Communication-efficient unconditional MPC with guaranteed output delivery
- Secure multi-party computation made simple
- Secure Protocol Transformations
- Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority
- Authenticated Algorithms for Byzantine Agreement
- How to share a secret
- Secure Computation with Minimal Interaction, Revisited
- Scalable and Unconditionally Secure Multiparty Computation
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Reaching Agreement in the Presence of Faults
- Theory of Cryptography
- On the exact round complexity of secure three-party computation
This page was built for publication: Efficient fully secure computation via distributed zero-knowledge proofs
