Subset-optimized BLS multi-signature with key aggregation
From MaRDI portal
Cites work
- A generalized birthday problem
- A lattice-based provably secure multisignature scheme in quantum random oracle model
- An efficient lattice-based multisignature scheme with applications to bitcoins
- An improved low-density subset sum algorithm
- Chopsticks: fork-free two-round multi-signatures from non-interactive assumptions
- Compact multi-signatures for smaller blockchains
- Efficient cryptographic schemes provably as secure as subset sum
- scientific article; zbMATH DE number 4191111 (Why is no real title available?)
- scientific article; zbMATH DE number 697807 (Why is no real title available?)
- MuSig2: simple two-round Schnorr multi-signatures
- On the Lagarias-Odlyzko Algorithm for the Subset Sum Problem
- Plumo: an ultralight blockchain client
- Sequential Aggregate Signatures and Multisignatures Without Random Oracles
- Short signatures from the Weil pairing
- Solving low density knapsacks
- Solving low-density subset sum problems
- The algebraic group model and its applications
- The Power of Proofs-of-Possession: Securing Multiparty Signatures against Rogue-Key Attacks
- Threshold and multi-signature schemes from linear hash functions
- Threshold signatures, multisignatures and blind signatures based on the gap-Diffie-Hellman-group signature scheme
- Threshold structure-preserving signatures
This page was built for publication: Subset-optimized BLS multi-signature with key aggregation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6979733)