skip to main content
10.1145/3519270.3538461acmconferencesArticle/Chapter ViewAbstractPublication PagespodcConference Proceedingsconference-collections
extended-abstract

Brief Announcement: Asynchronous Randomness and Consensus without Trusted Setup

Published: 21 July 2022 Publication History
First page of PDF

Supplementary Material

MP4 File (S2-T5-BA.mp4)
Brief Announcement video presentation

References

[1]
Ittai Abraham, Philipp Jovanovic, Mary Maller, Sarah Meiklejohn, Gilad Stern, and Alin Tomescu. Reaching consensus for asynchronous distributed key generation. In Proceedings of PODC 2021, pages 363--373, 2021.
[2]
Gabriel Bracha. Asynchronous byzantine agreement protocols. Information and Computation, 75(2):130--143, 1987.
[3]
Christian Cachin, Rachid Guerraoui, and Luís Rodrigues. Introduction to reliable and secure distributed programming. Springer Science & Business Media, 2011.
[4]
Ran Canetti and Tal Rabin. Fast asynchronous byzantine agreement with optimal resilience. In Proceedings of STOC '93, pages 42--51, 1993.
[5]
Sourav Das, Zhuolun Xiang, and Ling Ren. Asynchronous data dissemination and its applications. In Proceedings of CCS '21, pages 2705--2721, 2021.
[6]
D. Dolev, N. A. Lynch, S. S. Pinter, E. W. Stark, and W. E. Weihl. Reaching approximate agreement in the presence of faults. JACM, 33(3):499--516, July 1986.
[7]
Michael J. Fischer, Nancy A. Lynch, and Michael S. Paterson. Impossibility of distributed consensus with one faulty process. JACM, 32(2):374--382, 1985.
[8]
Luciano Freitas, Petr Kuznetsov, and Andrei Tonkikh. Distributed randomness from approximate agreement. arXiv preprint arXiv:2205.11878, 2022.
[9]
Yingzi Gao, Yuan Lu, Zhenliang Lu, Qiang Tang, Jing Xu, and Zhenfeng Zhang. Efficient asynchronous byzantine agreement without private setups. arXiv preprint arXiv:2106.07831, 2021.
[10]
Kobi Gurkan, Philipp Jovanovic, Mary Maller, Sarah Meiklejohn, Gilad Stern, and Alin Tomescu. Aggregatable distributed key generation. In Annual International Conference on the Theory and Applications of Cryptographic Techniques, pages 147--176. Springer, 2021.
[11]
Achour Mostéfaoui, Hamouma Moumen, and Michel Raynal. Signature-free asynchronous binary byzantine consensus with t < n/3, o(n2) messages, and o(1) expected time. J. ACM, 62(4), sep 2015.
[12]
Gilad Stern and Ittai Abraham. Living with asynchrony: the gather protocol. https://tinyurl.com/2s63r3jz, 2021. Accessed: 2022-02--12.

Index Terms

  1. Brief Announcement: Asynchronous Randomness and Consensus without Trusted Setup

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    PODC'22: Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing
    July 2022
    509 pages
    ISBN:9781450392624
    DOI:10.1145/3519270
    Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the Owner/Author.

    Sponsors

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 21 July 2022

    Check for updates

    Author Tags

    1. Byzantine fault tolerance
    2. adaptive adversary
    3. asynchronous byzantine agreement
    4. consensus
    5. weak common coin

    Qualifiers

    • Extended-abstract

    Conference

    PODC '22
    Sponsor:

    Acceptance Rates

    Overall Acceptance Rate 740 of 2,477 submissions, 30%

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • 0
      Total Citations
    • 135
      Total Downloads
    • Downloads (Last 12 months)17
    • Downloads (Last 6 weeks)0
    Reflects downloads up to 17 Jan 2025

    Other Metrics

    Citations

    View Options

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Media

    Figures

    Other

    Tables

    Share

    Share

    Share this Publication link

    Share on social media