\textsf{Bingo}: adaptivity and asynchrony in verifiable secret sharing and distributed key generation
From MaRDI portal
Publication:6186586
DOI10.1007/978-3-031-38557-5_2OpenAlexW4385654294MaRDI QIDQ6186586
Gilad Stern, Mary Maller, Sarah Meiklejohn, Philipp Jovanovic, Ittai Abraham
Publication date: 2 February 2024
Published in: Advances in Cryptology – CRYPTO 2023 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-38557-5_2
adaptively secure validated asynchronous Byzantine agreementpacked asynchronous verifiable secret sharing protocol
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Secure distributed key generation for discrete-log based cryptosystems
- The one-more-RSA-inversion problems and the security of Chaum's blind signature scheme
- Short signatures from the Weil pairing
- The algebraic group model and its applications
- Efficient asynchronous verifiable secret sharing and multiparty computation
- Aggregatable distributed key generation
- High-threshold AVSS with optimal communication complexity
- On the security of ECDSA with additive key derivation and presignatures
- Short signatures without random oracles and the SDH assumption in bilinear groups
- Random oracles in Constantinople: Practical asynchronous Byzantine agreement using cryptography
- ALBATROSS: publicly AttestabLe BATched Randomness based On Secret Sharing
- On communication-efficient asynchronous MPC with adaptive security
- Modern Computer Algebra
- An Efficient Framework for Unconditionally Secure Multiparty Computation
- Constant-Size Commitments to Polynomials and Their Applications
- The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
- Asynchronous Computational VSS with Reduced Communication Complexity
- Fast Reed-Solomon Interactive Oracle Proofs of Proximity
- Fast asynchronous Byzantine agreement with optimal resilience
- Asynchronous secure computation
- Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting
- Efficient perfectly secure computation with optimal resilience
- Reaching consensus for asynchronous distributed key generation
- Asymptotically free broadcast in constant expected time via packed VSS
- Snarky ceremonies
This page was built for publication: \textsf{Bingo}: adaptivity and asynchrony in verifiable secret sharing and distributed key generation
