Golden: lightweight non-interactive distributed key generation
From MaRDI portal
Cites work
- A threshold cryptosystem without a trusted party. (Extended abstract)
- A verifiable random function with short proofs and keys
- Advances in Cryptology - CRYPTO 2003
- Aggregatable distributed key generation
- Better than advertised security for non-interactive threshold signatures
- Bulletproofs for R1CS: bridging the completeness-soundness gap and a ZK extension
- Distributed pseudo-random functions and KDCs
- Exponent-VRFs and their applications
- Fiat-Shamir transformation of multi-round interactive proofs
- From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again
- FROST: Flexible round-optimized Schnorr threshold signatures
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Information-theoretically secure protocols and security under composition
- Non-interactive key exchange
- On the Evaluation of Powers and Monomials
- One round threshold discrete-log key generation without private channels
- Practical Schnorr threshold signatures without the algebraic group model
- Publicly verifiable secret sharing over class groups and applications to DKG and YOSO
- SCRAPE: scalable randomness attested by public entities
- Secure applications of Pedersen's distributed key generation protocol
- Secure distributed key generation for discrete-log based cryptosystems
- Threshold cryptosystems
- Threshold signatures, multisignatures and blind signatures based on the gap-Diffie-Hellman-group signature scheme
This page was built for publication: Golden: lightweight non-interactive distributed key generation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7443231)