Chopsticks: fork-free two-round multi-signatures from non-interactive assumptions
From MaRDI portal
Publication:6083682
DOI10.1007/978-3-031-30589-4_21zbMath1528.94101OpenAlexW4365935025MaRDI QIDQ6083682
Publication date: 8 December 2023
Published in: Advances in Cryptology – EUROCRYPT 2023 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-30589-4_21
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Efficient signature generation by smart cards
- Compact multi-signatures for smaller blockchains
- 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
- Optimal Security Proofs for Signatures from Identification Schemes
- An Algebraic Framework for Diffie-Hellman Assumptions
- (Hierarchical) Identity-Based Encryption from Affine Message Authentication
- Tightly-Secure Signatures from Lossy Identification Schemes
- Sequential Aggregate Signatures and Multisignatures Without Random Oracles
- Threshold Signatures, Multisignatures and Blind Signatures Based on the Gap-Diffie-Hellman-Group Signature Scheme
- Efficient Non-interactive Proof Systems for Bilinear Groups
- Non-interactive Zaps and New Techniques for NIZK
- 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
- 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
This page was built for publication: Chopsticks: fork-free two-round multi-signatures from non-interactive assumptions