Synchronous distributed key generation without broadcasts
From MaRDI portal
Cites work
- \textsf{Bingo}: adaptivity and asynchrony in verifiable secret sharing and distributed key generation
- A New Way to Achieve Round-Efficient Byzantine Agreement
- Aggregatable distributed key generation
- An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement
- Asymptotically free broadcast in constant expected time via packed VSS
- Asymptotically Optimal Validated Asynchronous Byzantine Agreement
- Authenticated Algorithms for Byzantine Agreement
- Computational verifiable secret sharing revisited
- Constant-Size Commitments to Polynomials and Their Applications
- Cryptographic Asynchronous Multi-party Computation with Optimal Resilience
- Dumbo-MVBA: Optimal Multi-Valued Validated Asynchronous Byzantine Agreement, Revisited
- Efficient player-optimal protocols for strong and differential consensus
- Gossiping for communication-efficient broadcast
- HotStuff
- scientific article; zbMATH DE number 176545 (Why is no real title available?)
- scientific article; zbMATH DE number 177618 (Why is no real title available?)
- scientific article; zbMATH DE number 1848309 (Why is no real title available?)
- scientific article; zbMATH DE number 1418290 (Why is no real title available?)
- Improved extension protocols for Byzantine broadcast and agreement
- Network-agnostic security comes (almost) for free in DKG and MPC
- On Expected Constant-Round Protocols for Byzantine Agreement
- On the size of pairing-based non-interactive arguments
- On Unconditionally Secure Robust Distributed Key Distribution Centers
- Optimal communication complexity of authenticated Byzantine agreement
- Optimally efficient multi-valued byzantine agreement
- Polynomial Codes Over Certain Finite Fields
- Practical threshold signatures
- Random oracles in constantipole
- Reaching consensus for asynchronous distributed key generation
- Resilient-optimal interactive consistency in constant time
- SCRAPE: scalable randomness attested by public entities
- Secure distributed key generation for discrete-log based cryptosystems
- Short signatures without random oracles and the SDH assumption in bilinear groups
- Synchronous Byzantine agreement with expected \(O(1)\) rounds, expected \(O(n^2)\) communication, and optimal resilience
- The algebraic group model and its applications
- Threshold Signatures, Multisignatures and Blind Signatures Based on the Gap-Diffie-Hellman-Group Signature Scheme
- Topics in Cryptology – CT-RSA 2005
This page was built for publication: Synchronous distributed key generation without broadcasts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7318596)
