Cryptographic Asynchronous Multi-party Computation with Optimal Resilience

DOI10.1007/11426639_19zbMath1137.94372OpenAlexW2109873787MaRDI QIDQ5385737

Bartosz Przydatek, Martin Hirt, Jesper Buus Nielsen

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)

Related Items (11)

High throughput secure MPC over small population in hybrid networks (extended abstract) ⋮ Constant-Round Asynchronous Multi-Party Computation Based on One-Way Functions ⋮ 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 ⋮ 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 ⋮ Always have a backup plan: fully secure synchronous MPC with asynchronous fallback

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