Fast batched asynchronous distributed key generation
From MaRDI portal
Recommendations
Cites work
- Asynchronous byzantine agreement protocols
- Bidiagonal Factorizations of Totally Nonnegative Matrices
- Binomial determinants, paths, and hook length formulae
- scientific article; zbMATH DE number 177618 (Why is no real title available?)
- scientific article; zbMATH DE number 1136347 (Why is no real title available?)
- scientific article; zbMATH DE number 2081084 (Why is no real title available?)
- Novel Polynomial Basis With Fast Fourier Transform and Its Application to Reed–Solomon Erasure Codes
- On MDS codes via Cauchy matrices
- Perfectly-Secure MPC with Linear Communication Complexity
- Robust Multiparty Computation with Linear Communication Complexity
- Secure distributed key generation for discrete-log based cryptosystems
- Threshold Signatures, Multisignatures and Blind Signatures Based on the Gap-Diffie-Hellman-Group Signature Scheme
Cited in
(10)- \textsf{Bingo}: adaptivity and asynchrony in verifiable secret sharing and distributed key generation
- Generalised asynchronous remote key generation for pairing-based cryptosystems
- SPRINT: high-throughput robust distributed Schnorr signatures
- Adaptively secure BLS threshold signatures from DDH and co-CDH
- Adaptively secure three-round threshold Schnorr signatures from DDH
- Glacius: threshold Schnorr signatures from DDH with full adaptive security
- Dazzle: improved adaptive threshold signatures from DDH
- HARTS: high-threshold, adaptively secure, and robust threshold Schnorr signatures
- Adaptively secure partially non-interactive threshold Schnorr signatures in the AGM
- Round-efficient adaptively secure threshold signatures with rewinding
This page was built for publication: Fast batched asynchronous distributed key generation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6637551)
