Fast batched asynchronous distributed key generation
From MaRDI portal
Publication:6637551
DOI10.1007/978-3-031-58740-5_13MaRDI QIDQ6637551
Publication date: 13 November 2024
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Secure distributed key generation for discrete-log based cryptosystems
- Binomial determinants, paths, and hook length formulae
- Asynchronous byzantine agreement protocols
- Novel Polynomial Basis With Fast Fourier Transform and Its Application to Reed–Solomon Erasure Codes
- On MDS codes via Cauchy matrices
- Bidiagonal Factorizations of Totally Nonnegative Matrices
- Threshold Signatures, Multisignatures and Blind Signatures Based on the Gap-Diffie-Hellman-Group Signature Scheme
- Perfectly-Secure MPC with Linear Communication Complexity
- Robust Multiparty Computation with Linear Communication Complexity
Related Items (1)
This page was built for publication: Fast batched asynchronous distributed key generation