Practical Signature-Free Asynchronous Common Subset in Constant Time

ePrint Report: Practical Signature-Free Asynchronous Common Subset in Constant Time

Sisi Duan, Xin Wang, Haibin Zhang

Asynchronous common subset (ACS) is a powerful paradigm enabling applications such as Byzantine fault-tolerance (BFT) and multi-party computation (MPC). The most efficient ACS framework in the information-theoretic (IT) setting is due to Ben-Or, Kelmer, and Rabin (BKR, 1994). The BKR ACS protocol has been both theoretically and practically impactful. However, the BKR protocol has an $O(\log n)$ running time (where $n$ is the number …

applications asynchronous ben computation eprint report framework free information log mpc paradigm party protocol report signature tolerance