https://eprint.iacr.org/2024/677

What a lovely hat

Is it made out of tin foil?

IACR Logo
Cryptology ePrint Archive

  * Papers
        Updates from the last:
      + 7 days
      + 31 days
      + 6 months
      + 365 days
      + -------------------------------------------------------------
      + Listing by year
      + All papers
      + Compact view
      + -------------------------------------------------------------
      + How to cite
      + -------------------------------------------------------------
      + Harvesting metadata
  * Submissions
      + Submit a paper
      + Revise or withdraw a paper
      + Acceptance and publishing conditions
  * About
      + Goals and history
      + News
      + Statistics
      + Contact

Search Button
[                    ] Search
Advanced search

Paper 2024/677

Asynchronous Consensus without Trusted Setup or Public-Key
Cryptography

Sourav Das, University of Illinois Urbana-Champaign
Sisi Duan, Tsinghua University
Shengqi Liu, Southern University of Science and Technology
Atsuki Momose, University of Illinois Urbana-Champaign
Ling Ren, University of Illinois Urbana-Champaign
Victor Shoup, Offchain Labs

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 $O(\kappa n^3)$ total
communication and runs in expected $O(1)$ rounds. The fact that we
use only cryptographic hash functions also means that our protocol is
post-quantum secure. The minimal use of cryptography and the small
number of rounds make our protocol practical. We implement our
protocol and evaluate it in a geo-distributed setting with up to 128
machines. Our experimental evaluation shows that our protocol is more
efficient than the only other setup-free consensus protocol that has
been implemented to date. En route to our asynchronous consensus
protocols, we also introduce new primitives called asynchronous
secret key sharing and cover gather, which may be of independent
interest.

Metadata

Available format(s)
    [file-pdf]PDF
Category
    Cryptographic protocols
Publication info
    Preprint.
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-05-06: approved
    2024-05-03: received
    See all versions
Short URL
    https://ia.cr/2024/677
License
    No rights reserved
    CC0

BibTeX [copy-outli]Copy to clipboard

@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},
      note = {\url{https://eprint.iacr.org/2024/677}},
      url = {https://eprint.iacr.org/2024/677}
}

IACR Logo
Note: In order to protect the privacy of readers, eprint.iacr.org
does not use cookies or embedded third party content.