Perfectly-secure asynchronous MPC for general adversaries (extended abstract)

DOI10.1007/978-3-030-65277-7_35zbMath1492.94080OpenAlexW3112388349MaRDI QIDQ2152066

Nikhil Pappu, Ashish Choudhury

Publication date: 6 July 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-65277-7_35

zbMATH Keywords

Byzantine agreementasynchronous protocolssecure MPCgeneral adversary structuresnon-threshold model

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Distributed systems (68M14)

Related Items (3)

Revisiting the efficiency of asynchronous MPC with optimal resilience against general adversaries ⋮ Revisiting the efficiency of perfectly secure asynchronous multi-party computation against general adversaries ⋮ Almost-surely terminating asynchronous Byzantine agreement against general adversaries with optimal resilience

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Player simulation and general adversary structures in perfect multiparty computation
• Asynchronous Byzantine agreement with optimal resilience
• Communication-efficient unconditional MPC with guaranteed output delivery
• Efficient General-Adversary Multi-Party Computation
• Communication-Efficient MPC for General Adversary Structures
• Constant-Round Asynchronous Multi-Party Computation Based on One-Way Functions
• How to share a secret
• The Round Complexity of Verifiable Secret Sharing Revisited
• Simple and Efficient Perfectly-Secure Asynchronous MPC
• Asynchronous Multi-Party Computation with Quadratic Communication
• Impossibility of distributed consensus with one faulty process
• Foundations of Cryptography
• The Power of Shunning
• Fast asynchronous Byzantine agreement with optimal resilience
• Asynchronous secure computation
• Asynchronous secure computations with optimal resilience (extended abstract)
• Complete characterization of adversaries tolerable in secure multi-party computation (extended abstract)
• Perfectly-Secure MPC with Linear Communication Complexity
• Brief Announcement: Almost-surely Terminating Asynchronous Byzantine Agreement Protocols with a Constant Expected Running Time

This page was built for publication: Perfectly-secure asynchronous MPC for general adversaries (extended abstract)