Round-optimal and communication-efficient multiparty computation
From MaRDI portal
Publication:2169992
Recommendations
Cites work
- (Leveled) fully homomorphic encryption without bootstrapping
- \(k\)-round multiparty computation from \(k\)-round oblivious transfer via garbled interactive circuits
- A black-box construction of fully-simulatable, round-optimal oblivious transfer from strongly uniform key agreement
- A proof of security of Yao's protocol for two-party computation
- Adaptively secure MPC with sublinear communication complexity
- Adaptively secure multi-party computation with dishonest majority
- Advances in Cryptology – CRYPTO 2004
- Bounded-concurrent secure multi-party computation with a dishonest majority
- Constant round non-malleable protocols using one way functions
- Constant-round non-malleable commitments from sub-exponential one-way functions
- Foundations of Cryptography
- Founding Cryptography on Oblivious Transfer – Efficiently
- From FE combiners to secure MPC and back
- Functional encryption: definitions and challenges
- Fuzzy Identity-Based Encryption
- Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation
- scientific article; zbMATH DE number 2009981 (Why is no real title available?)
- Multi-key fully-homomorphic encryption in the plain model
- Oblivious transfer from trapdoor permutations in minimal rounds
- On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
- Promise zero knowledge and its applications to round optimal MPC
- Round optimal secure multiparty computation from minimal assumptions
- Round-optimal secure multi-party computation
- Round-optimal secure two-party computation from trapdoor permutations
- Secure computation with minimal interaction, revisited
- Secure multiparty computation with minimal interaction
- Spooky Encryption and Its Applications
- Succinct non-interactive secure computation
- The Exact Round Complexity of Secure Computation
- Two round multiparty computation via multi-key FHE
- Two-round multiparty secure computation from minimal assumptions
Cited in
(14)- \(k\)-round multiparty computation from \(k\)-round oblivious transfer via garbled interactive circuits
- A new approach to round-optimal secure multiparty computation
- Efficient information-theoretic multi-party computation over non-commutative rings
- From FE combiners to secure MPC and back
- Towards efficiency-preserving round compression in MPC. Do fewer rounds mean more computation?
- Collusion-Free Multiparty Computation in the Mediated Model
- Communication Locality in Secure Multi-party Computation
- Round Efficient Unconditionally Secure Multiparty Computation Protocol
- Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation
- List oblivious transfer and applications to round-optimal black-box multiparty coin tossing
- Broadcast-optimal four-round MPC in the plain model
- Authenticated BitGC for actively secure rate-one 2PC
- Black-box constant-round secure 2PC with succinct communication
- Round-optimal black-box multiparty computation from polynomial-time assumptions
This page was built for publication: Round-optimal and communication-efficient multiparty computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2169992)
