Computationally efficient asynchronous MPC with linear communication and low additive overhead

DOI10.1007/978-3-032-01884-7_9MaRDI QIDQ6863904zbMATH OpenFDO

Authors Akhil Bandarupalli, Xiaoyu Ji, Aniket Kate, Chen-Da Liu-Zhang, Yifan Song

Publication date 4 February 2026

Full work available at URL https://doi.org/10.1007/978-3-032-01884-7_9

zbMATH Keywords

asynchronous complete secret-sharing protocol

Mathematics Subject Classification ID

Cryptography (94A60)

Cites work

• \textsf{Bingo}: adaptivity and asynchrony in verifiable secret sharing and distributed key generation
• Asynchronous Byzantine agreement with subquadratic communication
• Asynchronous Multi-Party Computation with Quadratic Communication
• Asynchronous Multiparty Computation: Theory and Implementation
• Asynchronous secure computations with optimal resilience (extended abstract)
• Asynchronous secure multiparty computation in constant time
• ATLAS: efficient and scalable MPC in the honest majority setting
• Computational verifiable secret sharing revisited
• Cryptographic Asynchronous Multi-party Computation with Optimal Resilience
• Efficient statistical asynchronous verifiable secret sharing with optimal resilience
• Guaranteed output delivery comes free in honest majority MPC
• scientific article; zbMATH DE number 1583776 (Why is no real title available?)
• scientific article; zbMATH DE number 176564 (Why is no real title available?)
• Lightweight asynchronous verifiable secret sharing with optimal resilience
• Linear-communication asynchronous complete secret sharing with optimal resilience
• Minimising communication in honest-majority MPC by batchwise multiplication verification
• Near-linear unconditionally-secure multiparty computation with a dishonest minority
• On communication-efficient asynchronous MPC with adaptive security
• On the communication efficiency of statistically secure asynchronous MPC with optimal resilience
• Perfect asynchronous MPC with linear communication overhead
• Revisiting Asynchronous Fault Tolerant Computation with Optimal Resilience
• Scalable and Unconditionally Secure Multiparty Computation
• Security and composition of multiparty cryptographic protocols
• Theory of Cryptography
• Towards achieving asynchronous MPC with linear communication and optimal resilience
• VSS from distributed ZK proofs and applications

Cited in

(3)

• Constant-round asynchronous MPC with optimal resilience and linear communication
• Information-theoretic network-agnostic MPC with polynomial communication
• Perfectly secure network-agnostic MPC comes for free

This page was built for publication: Computationally efficient asynchronous MPC with linear communication and low additive overhead

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