International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Bingo: Adaptivity and Asynchrony in Verifiable Secret Sharing and Distributed Key Generation

Authors:
Ittai Abraham , Intel Labs
Philipp Jovanovic , UCL
Mary Maller , Ethereum Foundation and PQShield
Sarah Meiklejohn , Google / UCL
Gilad Stern , Hebrew University
Download:
DOI: 10.1007/978-3-031-38557-5_2 (login may be required)
Search ePrint
Search Google
Presentation: Slides
Conference: CRYPTO 2023
Abstract: We present Bingo, an adaptively secure and optimally resilient packed asynchronous verifiable secret sharing (PAVSS) protocol that allows a dealer to share f+1 secrets with a total communication complexity of O(λn^2) words, where λ is the security parameter and n is the number of parties. Using Bingo, we obtain an adaptively secure validated asynchronous Byzantine agreement (VABA) protocol that uses O(λn^3) expected words and constant expected time, which we in turn use to construct an adaptively secure high-threshold asynchronous distributed key generation (ADKG) protocol that uses O(λn^3) expected words and constant expected time. To the best of our knowledge, our ADKG is the first to allow for an adaptive adversary while matching the asymptotic complexity of the best known static ADKGs.
BibTeX
@inproceedings{crypto-2023-33219,
  title={Bingo: Adaptivity and Asynchrony in Verifiable Secret Sharing and Distributed Key Generation},
  publisher={Springer-Verlag},
  doi={10.1007/978-3-031-38557-5_2},
  author={Ittai Abraham and Philipp Jovanovic and Mary Maller and Sarah Meiklejohn and Gilad Stern},
  year=2023
}