A Theoretical Take on a Practical Consensus Protocol

ePrint Report: A Theoretical Take on a Practical Consensus Protocol

Victor Shoup

The Asynchronous Common Subset (ACS) problem is a fundamental problem in distributed computing. Very recently, Das et al. (2024) developed a new ACS protocol with several desirable properties: (i) it provides optimal resilience, tolerating up to $t < n/3$ corrupt parties out of $n$ parties in total, (ii) it does not rely on a trusted set up, (iii) it utilizes only "lighweight" cryptography, which can be instantiated using …

asynchronous computing corrupt distributed distributed computing eprint report problem protocol report resilience