Fully adaptive Schnorr threshold signatures

DOI10.1007/978-3-031-38557-5_22OpenAlexW4385654497MaRDI QIDQ6186608

Elizabeth C. Crites, Chelsea Komlo, Mary Maller

Publication date: 2 February 2024

Published in: Advances in Cryptology – CRYPTO 2023 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-38557-5_22

zbMATH Keywords

adaptive securitythree-round threshold Schnorr signature scheme

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Born and raised distributively: fully distributed non-interactive adaptively-secure threshold signatures with short shares
• FROST: Flexible round-optimized Schnorr threshold signatures
• Secure distributed key generation for discrete-log based cryptosystems
• Efficient signature generation by smart cards
• The one-more-RSA-inversion problems and the security of Chaum's blind signature scheme
• Security arguments for digital signatures and blind signatures
• Compact multi-signatures for smaller blockchains
• The algebraic group model and its applications
• Robust threshold DSS signatures
• MuSig2: simple two-round Schnorr multi-signatures
• The local forking lemma and its application to deterministic encryption
• Simple Schnorr multi-signatures with applications to bitcoin
• How to share a secret
• Robust and Efficient Sharing of RSA Functions
• Simplified Threshold RSA with Adaptive and Proactive Security
• Another look at non-standard discrete log and Diffie-Hellman problems
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
• Threshold Signatures, Multisignatures and Blind Signatures Based on the Gap-Diffie-Hellman-Group Signature Scheme
• Separating succinct non-interactive arguments from all falsifiable assumptions
• Communication-Efficient Non-interactive Proofs of Knowledge with Online Extractors
• On the (in)security of ROS
• The One-More Discrete Logarithm Assumption in the Generic Group Model
• Algebraic adversaries in the universal composability framework
• Better than advertised security for non-interactive threshold signatures

This page was built for publication: Fully adaptive Schnorr threshold signatures