On communication-efficient asynchronous MPC with adaptive security
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 1583939 (Why is no real title available?)
- scientific article; zbMATH DE number 1808209 (Why is no real title available?)
- scientific article; zbMATH DE number 176564 (Why is no real title available?)
- scientific article; zbMATH DE number 1955785 (Why is no real title available?)
- Advances in Cryptology - CRYPTO 2003
- Asynchronous Multi-Party Computation with Quadratic Communication
- Asynchronous secure computations with optimal resilience (extended abstract)
- Asynchronous secure multiparty computation in constant time
- Communication-efficient unconditional MPC with guaranteed output delivery
- Constant-round asynchronous multi-party computation based on one-way functions
- Cryptographic Asynchronous Multi-party Computation with Optimal Resilience
- Efficient asynchronous verifiable secret sharing and multiparty computation
- Efficient statistical asynchronous verifiable secret sharing with optimal resilience
- Guaranteed output delivery comes free in honest majority MPC
- Magic functions
- Near-linear unconditionally-secure multiparty computation with a dishonest minority
- On communication-efficient asynchronous MPC with adaptive security
- Perfectly-Secure MPC with Linear Communication Complexity
- Robust Multiparty Computation with Linear Communication Complexity
- Scalable Secure Multiparty Computation
- Scalable and Unconditionally Secure Multiparty Computation
- Security and composition of multiparty cryptographic protocols
Cited in
(14)- High throughput secure MPC over small population in hybrid networks (extended abstract)
- MPC with synchronous security and asynchronous responsiveness
- On communication-efficient asynchronous MPC with adaptive security
- \textsf{Bingo}: adaptivity and asynchrony in verifiable secret sharing and distributed key generation
- Network-agnostic security comes (almost) for free in DKG and MPC
- Computationally efficient asynchronous MPC with linear communication and low additive overhead
- Constant-round asynchronous MPC with optimal resilience and linear communication
- Communication-efficient unconditional MPC with guaranteed output delivery
- Revisiting the efficiency of asynchronous MPC with optimal resilience against general adversaries
- Efficient distributed randomness generation from minimal assumptions where \underline{PA}rties \underline{S}peak \underline{S}equentially \underline{O}nce
- Towards achieving asynchronous MPC with linear communication and optimal resilience
- Concretely efficient large-scale MPC with active security (or tinykeys for tinyot)
- On the communication efficiency of statistically secure asynchronous MPC with optimal resilience
- Always have a backup plan: fully secure synchronous MPC with asynchronous fallback
This page was built for publication: On communication-efficient asynchronous MPC with adaptive security
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2697849)
