Paper 2024/677
Asynchronous Consensus without Trusted Setup or Public-Key Cryptography
Abstract
Byzantine consensus is a fundamental building block in distributed cryptographic problems. Despite decades of research, most existing asynchronous consensus protocols require a strong trusted setup and expensive public-key cryptography. In this paper, we study asynchronous Byzantine consensus protocols that do not rely on a trusted setup and do not use public-key cryptography such as digital signatures. We give an Asynchronous Common Subset (ACS) protocol whose security is only based on cryptographic hash functions modeled as a random oracle. Our protocol has
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- Published elsewhere. ACM CCS 2024
- DOI
- 10.1145/3658644.3670327
- Keywords
- ConsensusAsynchronyAsynchronous Common Subset
- Contact author(s)
-
souravd2 @ illinois edu
duansisi @ mail tsinghua edu cn
shengqi @ illinois edu
atsuki momose @ gmail com
renling @ illinois edu
victor @ shoup net - History
- 2024-06-30: revised
- 2024-05-03: received
- See all versions
- Short URL
- https://ia.cr/2024/677
- License
-
CC0
BibTeX
@misc{cryptoeprint:2024/677, author = {Sourav Das and Sisi Duan and Shengqi Liu and Atsuki Momose and Ling Ren and Victor Shoup}, title = {Asynchronous Consensus without Trusted Setup or Public-Key Cryptography}, howpublished = {Cryptology {ePrint} Archive, Paper 2024/677}, year = {2024}, doi = {10.1145/3658644.3670327}, url = {https://eprint.iacr.org/2024/677} }