Cryptographic Asynchronous Multi-party Computation with Optimal Resilience

DOI10.1007/11426639_19MaRDI QIDQ5385737zbMATH OpenOpenAlexFDO

Authors Martin Hirt, Jesper Buus Nielsen, Bartosz Przydatek

Publication date 6 May 2008

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11426639_19

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Asynchronous Multi-Party Computation with Quadratic Communication
• Simple and Efficient Perfectly-Secure Asynchronous MPC
• Asynchronous Multiparty Computation: Theory and Implementation
• On the communication efficiency of statistically secure asynchronous MPC with optimal resilience
• Communication efficient statistical asynchronous multiparty computation with optimal resilience

Cited in

(24)

• Always have a backup plan: fully secure synchronous MPC with asynchronous fallback
• High throughput secure MPC over small population in hybrid networks (extended abstract)
• MPC with synchronous security and asynchronous responsiveness
• Round-efficient Byzantine agreement and multi-party computation with asynchronous fallback
• On the communication efficiency of statistically secure asynchronous MPC with optimal resilience
• On communication-efficient asynchronous MPC with adaptive security
• Linear overhead optimally-resilient robust MPC using preprocessing
• Breaking the ${\mathcal{O}}(n|C|)$ Barrier for Unconditionally Secure Asynchronous Multiparty Computation
• Constant-round asynchronous multi-party computation based on one-way functions
• Asynchronous Multi-Party Computation with Quadratic Communication
• Upper Bounds on the Communication Complexity of Optimally Resilient Cryptographic Multiparty Computation
• Revisiting the efficiency of asynchronous MPC with optimal resilience against general adversaries
• Network-agnostic security comes (almost) for free in DKG and MPC
• Concurrent asynchronous Byzantine agreement in expected-constant rounds, revisited
• Network-agnostic multi-party computation revisited (extended abstract)
• Towards achieving asynchronous MPC with linear communication and optimal resilience
• Computationally efficient asynchronous MPC with linear communication and low additive overhead
• Constant-round asynchronous MPC with optimal resilience and linear communication
• Peeking into the future: MPC resilient to super-rushing adversaries
• Randomized agreement, verifiable secret sharing and multi-party computation in granular synchrony
• Is it even possible? On the parallel composition of asynchronous MPC protocols
• Information-theoretic network-agnostic MPC with polynomial communication
• Perfectly secure network-agnostic MPC comes for free
• Synchronous distributed key generation without broadcasts

This page was built for publication: Cryptographic Asynchronous Multi-party Computation with Optimal Resilience

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5385737)