\textsf{Bingo}: adaptivity and asynchrony in verifiable secret sharing and distributed key generation
From MaRDI portal
Publication:6186586
Recommendations
- Asynchronous computational VSS with reduced communication complexity
- Lightweight asynchronous verifiable secret sharing with optimal resilience
- Communication efficient perfectly secure VSS and MPC in asynchronous networks with optimal resilience
- Fast batched asynchronous distributed key generation
- Efficient statistical asynchronous verifiable secret sharing with optimal resilience
Cites work
- Aggregatable distributed key generation
- ALBATROSS: publicly AttestabLe BATched Randomness based On Secret Sharing
- An Efficient Framework for Unconditionally Secure Multiparty Computation
- Asymptotically free broadcast in constant expected time via packed VSS
- Asynchronous computational VSS with reduced communication complexity
- Asynchronous secure computation
- Constant-Size Commitments to Polynomials and Their Applications
- Efficient asynchronous verifiable secret sharing and multiparty computation
- Efficient perfectly secure computation with optimal resilience
- Efficient zero-knowledge arguments for arithmetic circuits in the discrete log setting
- Fast asynchronous Byzantine agreement with optimal resilience
- Fast Reed-Solomon interactive oracle proofs of proximity
- High-threshold AVSS with optimal communication complexity
- scientific article; zbMATH DE number 1304080 (Why is no real title available?)
- scientific article; zbMATH DE number 1418290 (Why is no real title available?)
- scientific article; zbMATH DE number 7650353 (Why is no real title available?)
- Modern computer algebra
- On communication-efficient asynchronous MPC with adaptive security
- On the security of ECDSA with additive key derivation and presignatures
- Random oracles in Constantinople: Practical asynchronous Byzantine agreement using cryptography
- SCRAPE: scalable randomness attested by public entities
- Secure distributed key generation for discrete-log based cryptosystems
- Short signatures from the Weil pairing
- Short signatures without random oracles and the SDH assumption in bilinear groups
- Snarky ceremonies
- The algebraic group model and its applications
- The one-more-RSA-inversion problems and the security of Chaum's blind signature scheme
- The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
Cited in
(11)- Lightweight asynchronous verifiable secret sharing with optimal resilience
- Linear-communication asynchronous complete secret sharing with optimal resilience
- Computationally efficient asynchronous MPC with linear communication and low additive overhead
- Asymptotically optimal adaptive asynchronous common coin and DKG with silent setup
- Bivariate proximity test-based asynchronous verifiable secret sharing
- DSKE: digital signatures with key extraction
- Verifiable secret sharing from symmetric key cryptography with improved optimistic complexity
- HARTS: high-threshold, adaptively secure, and robust threshold Schnorr signatures
- DRAGON: decentralization at the cost of representation after arbitrary GrOupiNg and its applications to sub-cubic DKG and interactive consistency
- Special soundness and binding properties: a framework for tightly secure zk-SNARKs
- Synchronous distributed key generation without broadcasts
This page was built for publication: \textsf{Bingo}: adaptivity and asynchrony in verifiable secret sharing and distributed key generation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6186586)
