Aggregatable distributed key generation
From MaRDI portal
Publication:2056680
DOI10.1007/978-3-030-77870-5_6zbMath1479.94184OpenAlexW3151272651MaRDI QIDQ2056680
Kobi Gurkan, Alin Tomescu, Mary Maller, Gilad Stern, Philipp Jovanovic, Sarah Meiklejohn
Publication date: 8 December 2021
Full work available at URL: https://discovery.ucl.ac.uk/id/eprint/10131980/
Related Items (4)
Reaching consensus for asynchronous distributed key generation ⋮ \textsf{Bingo}: adaptivity and asynchrony in verifiable secret sharing and distributed key generation ⋮ Network-agnostic security comes (almost) for free in DKG and MPC ⋮ Aggregatable distributed key generation
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Constant-size structure-preserving signatures: generic constructions and simple assumptions
- Efficient selective identity-based encryption without random oracles
- Updatable and universal common reference strings with applications to zk-SNARKs
- Secure distributed key generation for discrete-log based cryptosystems
- Pairings for cryptographers
- Ouroboros: a provably secure proof-of-stake blockchain protocol
- On the impossibility of structure-preserving deterministic primitives
- Aggregatable distributed key generation
- Efficient fully structure-preserving signatures and shrinking commitments
- Efficient Unlinkable Sanitizable Signatures from Signatures with Re-randomizable Keys
- How to share a function securely
- How to Obtain Fully Structure-Preserving (Automorphic) Signatures from Structure-Preserving Ones
- How to share a secret
- Constant-Size Commitments to Polynomials and Their Applications
- The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
- Rerandomizable RCCA Encryption
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Threshold Signatures, Multisignatures and Blind Signatures Based on the Gap-Diffie-Hellman-Group Signature Scheme
- Efficient Noninteractive Proof Systems for Bilinear Groups
- Asymptotically Optimal Validated Asynchronous Byzantine Agreement
- HotStuff
- Distributed computing meets game theory
- Advances in Cryptology - EUROCRYPT 2004
- Fine-Tuning Groth-Sahai Proofs
- Public Key Cryptography - PKC 2005
- Unified, Minimal and Selectively Randomizable Structure-Preserving Signatures
- Theory of Cryptography
- On the (in)security of ROS
This page was built for publication: Aggregatable distributed key generation
