Paper 2022/1383
Sublinear-Round Broadcast without Trusted Setup against Dishonest Majority
Abstract
Byzantine broadcast is one of the fundamental problems in distributed computing. Many practical applications from secure multiparty computation to consensus mechanisms for blockchains require increasingly weaker trust assumptions, as well as scalability for an ever-growing number of users, which rules out existing solutions with linear number of rounds or trusted setup requirements. In this paper, we propose the first sublinear-round and trustless Byzantine broadcast protocol. Unlike previous sublinear-round protocols, our protocol does not assume the existence of a trusted dealer who honestly issues keys and common random strings to the parties.
Our protocol is based on a new cryptographic protocol called verifiable graded consensus, designed to act as an untrusted online setup, enabling
Note: A recent, extensive update of this work, which includes additional authors can be found in https://eprint.iacr.org/2024/770
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- Preprint.
- Keywords
- BroadcastConsensus protocolsGraded agreementRandom beacons
- Contact author(s)
-
aalexandru @ dualitytech com
lossjulian @ gmail com
charalampos papamanthou @ yale edu
tsimos @ umd edu - History
- 2024-06-04: last of 2 revisions
- 2022-10-13: received
- See all versions
- Short URL
- https://ia.cr/2022/1383
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2022/1383, author = {Andreea B. Alexandru and Julian Loss and Charalampos Papamanthou and Giorgos Tsimos}, title = {Sublinear-Round Broadcast without Trusted Setup against Dishonest Majority}, howpublished = {Cryptology {ePrint} Archive, Paper 2022/1383}, year = {2022}, url = {https://eprint.iacr.org/2022/1383} }