One round threshold discrete-log key generation without private channels

DOI10.1007/3-540-44586-2_22MaRDI QIDQ2724603zbMATH OpenFDO

Authors Pierre-Alain Fouque, Jacques Stern

Publication date 11 September 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-44586-2_22

zbMATH Keywords

adaptive adversaryconcurrent adversarydiscrete-log keypublic key encryptionthreshold cryptosystems

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Secure distributed key generation for discrete-log based cryptosystems
• Secure applications of Pedersen's distributed key generation protocol
• Applied Cryptography and Network Security
• Secure distributed key generation for discrete-log based cryptosystems
• Advances in Cryptology - EUROCRYPT 2004

Cited in

(20)

• Distributed parameter generation for bilinear Diffie Hellman exponentiation and applications
• Threshold schemes from isogeny assumptions
• Aggregatable distributed key generation
• Guaranteed output in \(O(\sqrt{n})\) rounds for round-robin sampling protocols
• Practical non-interactive publicly verifiable secret sharing with thousands of parties
• Secure collision-free distributed key generation for discrete-logarithm-based threshold cryptosystems
• Secure applications of Pedersen's distributed key generation protocol
• scientific article; zbMATH DE number 1980978 (Why is no real title available?)
• Applied Cryptography and Network Security
• Publicly verifiable secret sharing over class groups and applications to DKG and YOSO
• Adaptively secure BLS threshold signatures from DDH and co-CDH
• Round-optimal, fully secure distributed key generation
• MDKG: module-lattice-based distributed key generation
• Efficiently-thresholdizable batched identity based encryption, with applications
• Distributed randomness using weighted VUFs
• Exponent-VRFs and their applications
• Distributing keys and random secrets with constant complexity
• DRAGON: decentralization at the cost of representation after arbitrary GrOupiNg and its applications to sub-cubic DKG and interactive consistency
• Guaranteed output in \(O(\sqrt{n})\) rounds for round-robin sampling protocols
• Privacy preserving link analysis on dynamic weighted graph

This page was built for publication: One round threshold discrete-log key generation without private channels

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2724603)