Toothpicks: more efficient fork-free two-round multi-signatures
From MaRDI portal
Publication:6636401
DOI10.1007/978-3-031-58716-0_16MaRDI QIDQ6636401
Publication date: 12 November 2024
Cites Work
- Title not available (Why is that?)
- Efficient signature generation by smart cards
- More efficient (almost) tightly secure structure-preserving signatures
- Compact multi-signatures for smaller blockchains
- The algebraic group model and its applications
- Practical and tightly-secure digital signatures and authenticated key exchange
- More efficient digital signatures with tight multi-user security
- Tighter proofs for the SIGMA and TLS 1.3 key exchange protocols
- Two-round trip Schnorr multi-signatures via delinearized witnesses
- MuSig2: simple two-round Schnorr multi-signatures
- Authenticated key exchange and signatures with tight security in the standard model
- 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
- Unbounded HIBE with tight security
- Two-pass authenticated key exchange with explicit authentication and tight security
- Tightly CCA-Secure Encryption Without Pairings
- Optimal Security Proofs for Signatures from Identification Schemes
- An Algebraic Framework for Diffie-Hellman Assumptions
- Fully, (Almost) Tightly Secure IBE and Dual System Groups
- (Hierarchical) Identity-Based Encryption from Affine Message Authentication
- Tightly-Secure Signatures from Lossy Identification Schemes
- Tightly Secure Signatures and Public-Key Encryption
- Tightly-Secure Signatures from Chameleon Hash Functions
- Towards Tightly Secure Lattice Short Signature and Id-Based Encryption
- Sequential Aggregate Signatures and Multisignatures Without Random Oracles
- Threshold Signatures, Multisignatures and Blind Signatures Based on the Gap-Diffie-Hellman-Group Signature Scheme
- Tightly-Secure Authenticated Key Exchange
- Adaptive Partitioning
- Advances in Cryptology – CRYPTO 2004
- On the Impossibility of Tight Cryptographic Reductions
- 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
- Lattice-based signatures with tight adaptive corruptions and more
Related Items (1)
This page was built for publication: Toothpicks: more efficient fork-free two-round multi-signatures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6636401)
