Aggregatable distributed key generation
type: Item
instance of: scholarly article
title: Aggregatable distributed key generation
zbMATH Open document ID: 1479.94184
DOI: 10.1007/978-3-030-77870-5_6
author: Kobi Gurkan
author: Philipp Jovanovic
author: Mary Maller
author: Sarah Meiklejohn
author: Gilad Stern
author: Alin Tomescu
publication date: 2021-12-08T00:00:00Z
full work available at URL: https://discovery.ucl.ac.uk/id/eprint/10131980/
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 7440578
zbMATH Keywords: El-Gamal encryption
zbMATH Keywords: BLS signatures
MaRDI profile type: Publication
OpenAlex ID: W3151272651
cites work: On the impossibility of structure-preserving deterministic primitives
cites work: Constant-size structure-preserving signatures: generic constructions and simple assumptions
cites work: Efficient fully structure-preserving signatures and shrinking commitments
cites work: Unified, Minimal and Selectively Randomizable Structure-Preserving Signatures
cites work: Distributed computing meets game theory
cites work: Asymptotically Optimal Validated Asynchronous Byzantine Agreement
cites work: The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
cites work: On the (in)security of ROS
cites work: Threshold Signatures, Multisignatures and Blind Signatures Based on the Gap-Diffie-Hellman-Group Signature Scheme
cites work: Efficient selective identity-based encryption without random oracles
cites work: Q4474196
cites work: Q4941850
cites work: Advances in Cryptology - EUROCRYPT 2004
cites work: How to share a function securely
cites work: Public Key Cryptography - PKC 2005
cites work: Fine-Tuning Groth-Sahai Proofs
cites work: Efficient Unlinkable Sanitizable Signatures from Signatures with Re-randomizable Keys
cites work: Q2724603
cites work: Pairings for cryptographers
cites work: Secure distributed key generation for discrete-log based cryptosystems
cites work: Q4418550
cites work: Theory of Cryptography
cites work: Efficient Noninteractive Proof Systems for Bilinear Groups
cites work: Updatable and universal common reference strings with applications to zk-SNARKs
cites work: Constant-Size Commitments to Polynomials and Their Applications
cites work: Ouroboros: a provably secure proof-of-stake blockchain protocol
cites work: Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
cites work: Q4037497
cites work: Q4035712
cites work: Rerandomizable RCCA Encryption
cites work: Q3210171
cites work: How to share a secret
cites work: How to Obtain Fully Structure-Preserving (Automorphic) Signatures from Structure-Preserving Ones
cites work: HotStuff
cites work: SCRAPE: Scalable Randomness Attested by Public Entities
description: scientific article; zbMATH DE number 7440578