Paper 2023/154
FIN: Practical Signature-Free Asynchronous Common Subset in Constant Time
Abstract
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 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
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- Published elsewhere. Minor revision. ACM CCS 2023
- DOI
- 10.1145/3576915.3616633
- Keywords
- Asynchronous common subsetACSBFTByzantine fault toleranceagreement on a subsetMVBAMPCADKG
- Contact author(s)
-
duansisi @ tsinghua edu cn
wangxin87 @ mail tsinghua edu cn
bchainzhang @ aliyun com - History
- 2024-07-11: last of 3 revisions
- 2023-02-09: received
- See all versions
- Short URL
- https://ia.cr/2023/154
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2023/154, author = {Sisi Duan and Xin Wang and Haibin Zhang}, title = {{FIN}: Practical Signature-Free Asynchronous Common Subset in Constant Time}, howpublished = {Cryptology {ePrint} Archive, Paper 2023/154}, year = {2023}, doi = {10.1145/3576915.3616633}, url = {https://eprint.iacr.org/2023/154} }