Asynchronous Multi-Party Computation with Quadratic Communication

DOI10.1007/978-3-540-70583-3_39zbMath1155.68384OpenAlexW1592786019MaRDI QIDQ3519524

Martin Hirt, Bartosz Przydatek, Jesper Buus Nielsen

Publication date: 19 August 2008

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-70583-3_39

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Network protocols (68M12) Authentication, digital signatures and secret sharing (94A62)

Related Items (11)

Perfectly-secure asynchronous MPC for general adversaries (extended abstract) ⋮ High throughput secure MPC over small population in hybrid networks (extended abstract) ⋮ Constant-Round Asynchronous Multi-Party Computation Based on One-Way Functions ⋮ Reaching consensus for asynchronous distributed key generation ⋮ Revisiting the efficiency of asynchronous MPC with optimal resilience against general adversaries ⋮ Network-agnostic security comes (almost) for free in DKG and MPC ⋮ MPC with synchronous security and asynchronous responsiveness ⋮ Asynchronous Multi-Party Computation with Quadratic Communication ⋮ 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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Security and composition of multiparty cryptographic protocols
• Joint encryption and message-efficient secure computation
• The Exact Security of Digital Signatures-How to Sign with RSA and Rabin
• Asynchronous Multi-Party Computation with Quadratic Communication
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• Random oracles in constantipole
• Fast asynchronous Byzantine agreement with optimal resilience
• Asynchronous secure computation
• Asynchronous secure computations with optimal resilience (extended abstract)
• Cryptographic Asynchronous Multi-party Computation with Optimal Resilience
• Theory of Cryptography

This page was built for publication: Asynchronous Multi-Party Computation with Quadratic Communication