Twinkle: threshold signatures from DDH with full adaptive security
From MaRDI portal
Publication:6636400
DOI10.1007/978-3-031-58716-0_15MaRDI QIDQ6636400
Renas Bacho, Chenzhi Zhu, Benedikt Wagner, Julian Loss, Stefano Tessaro
Publication date: 12 November 2024
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- FROST: Flexible round-optimized Schnorr threshold signatures
- Secure distributed key generation for discrete-log based cryptosystems
- Efficient signature generation by smart cards
- Threshold cryptosystems from threshold fully homomorphic encryption
- Tightly-secure signatures from five-move identification protocols
- Compact multi-signatures for smaller blockchains
- The algebraic group model and its applications
- Bandwidth-efficient threshold EC-DSA
- Fast threshold ECDSA with honest majority
- Two-round trip Schnorr multi-signatures via delinearized witnesses
- MuSig2: simple two-round Schnorr multi-signatures
- Short pairing-free blind signatures with exponential security
- A modular treatment of blind signatures from identification schemes
- Simple Schnorr multi-signatures with applications to bitcoin
- Efficient signature schemes with tight reductions to the Diffie-Hellman problems
- How to share a function securely
- Threshold-Optimal DSA/ECDSA Signatures and an Application to Bitcoin Wallet Security
- Optimal Security Proofs for Signatures from Identification Schemes
- An Algebraic Framework for Diffie-Hellman Assumptions
- How to Share a Lattice Trapdoor: Threshold Protocols for Signatures and (H)IBE
- Tightly-Secure Signatures from Lossy Identification Schemes
- Born and raised distributively
- Simplified Threshold RSA with Adaptive and Proactive Security
- Threshold Signatures, Multisignatures and Blind Signatures Based on the Gap-Diffie-Hellman-Group Signature Scheme
- An Efficient CDH-Based Signature Scheme with a Tight Security Reduction
- Threshold RSA for Dynamic and Ad-Hoc Groups
- Two-round \(n\)-out-of-\(n\) and multi-signatures and trapdoor commitment from lattices
- Boosting the Security of Blind Signature Schemes
- Chain Reductions for Multi-signatures and the HBMS Scheme
- Chopsticks: fork-free two-round multi-signatures from non-interactive assumptions
- Threshold and multi-signature schemes from linear hash functions
- MuSig-L: lattice-based multi-signature with single-round online phase
- PI-Cut-Choo and friends: compact blind signatures via parallel instance cut-and-choose and more
- Better than advertised security for non-interactive threshold signatures
- Fully adaptive Schnorr threshold signatures
- Snowblind: a threshold blind signature in pairing-free groups
- Practical Schnorr threshold signatures without the algebraic group model
- Round-optimal lattice-based threshold signatures, revisited
- Threshold structure-preserving signatures
Related Items (2)
Pairing-free blind signatures from CDH assumptions ⋮ Adaptively secure BLS threshold signatures from DDH and co-CDH
This page was built for publication: Twinkle: threshold signatures from DDH with full adaptive security
