Threshold and multi-signature schemes from linear hash functions
From MaRDI portal
(Redirected from Publication:6083683)
Recommendations
- Practical Threshold Signatures with Linear Secret Sharing Schemes
- Threshold signature scheme with threshold verification based on multivariate linear polynomial
- A directed threshold signature scheme based on linear polynomial
- Information Security and Cryptology
- The simplest multi-key linearly homomorphic signature scheme
- Efficient forward-secure threshold signatures
- scientific article; zbMATH DE number 1617944
- Threshold-directed signature scheme based on hybrid number theoretic problems
- Linearly homomorphic structure-preserving signatures and their applications
- Linearly Homomorphic Structure-Preserving Signatures and Their Applications
Cites work
- A digital multisignature scheme using bijective public-key cryptosystems
- A modular treatment of blind signatures from identification schemes
- Another look at ``provable security
- Another look at non-standard discrete log and Diffie-Hellman problems
- Better than advertised security for non-interactive threshold signatures
- Chain Reductions for Multi-signatures and the HBMS Scheme
- FROST: Flexible round-optimized Schnorr threshold signatures
- How to share a function securely
- How to share a secret
- scientific article; zbMATH DE number 1612520 (Why is no real title available?)
- scientific article; zbMATH DE number 1612524 (Why is no real title available?)
- scientific article; zbMATH DE number 1722676 (Why is no real title available?)
- scientific article; zbMATH DE number 1808277 (Why is no real title available?)
- scientific article; zbMATH DE number 4191111 (Why is no real title available?)
- scientific article; zbMATH DE number 176545 (Why is no real title available?)
- scientific article; zbMATH DE number 176567 (Why is no real title available?)
- scientific article; zbMATH DE number 1302840 (Why is no real title available?)
- scientific article; zbMATH DE number 708798 (Why is no real title available?)
- scientific article; zbMATH DE number 1107689 (Why is no real title available?)
- scientific article; zbMATH DE number 2081073 (Why is no real title available?)
- scientific article; zbMATH DE number 2081084 (Why is no real title available?)
- scientific article; zbMATH DE number 1775456 (Why is no real title available?)
- Identity-based aggregate and multi-signature schemes based on RSA
- Identity-Based Multi-signatures from RSA
- Lattice-based blind signatures, revisited
- MuSig2: simple two-round Schnorr multi-signatures
- New scheme for digital multisignatures
- On the (in)security of ROS
- Practical threshold signatures
- Robust and efficient sharing of RSA functions
- Secure distributed key generation for discrete-log based cryptosystems
- Simplified Threshold RSA with Adaptive and Proactive Security
- The algebraic group model and its applications
- The one-more-RSA-inversion problems and the security of Chaum's blind signature scheme
- Threshold RSA for Dynamic and Ad-Hoc Groups
- Threshold Signatures, Multisignatures and Blind Signatures Based on the Gap-Diffie-Hellman-Group Signature Scheme
- Threshold-optimal DSA/ECDSA signatures and an application to bitcoin wallet security
Cited in
(32)- Chopsticks: fork-free two-round multi-signatures from non-interactive assumptions
- \textsf{DualMS}: efficient lattice-based two-round multi-signature with trapdoor-free simulation
- Multi-signatures for ad-hoc and privacy-preserving group signing
- Twinkle: threshold signatures from DDH with full adaptive security
- Toothpicks: more efficient fork-free two-round multi-signatures
- Adaptively secure BLS threshold signatures from DDH and co-CDH
- Two-round threshold signature from algebraic one-more learning with errors
- Adaptively secure 5 round threshold signatures from \textsf{MLWE}/\textsf{MSIS} and \textsf{DL} with rewinding
- The algebraic one-more MISIS problem and applications to threshold signatures
- On the adaptive security of FROST
- T-Spoon: tightly secure two-round multi-signatures with key aggregation
- Glacius: threshold Schnorr signatures from DDH with full adaptive security
- Simplified adaptively secure threshold BLS signatures
- Two-round threshold signature from algebraic one-more learning with errors
- Intermundium-DL: assessing the resilience of current schemes to discrete-log-computation attacks on public parameters
- Dazzle: improved adaptive threshold signatures from DDH
- Privacy-preserving multi-signatures: generic techniques and constructions without pairings
- From one-time to two-round reusable multi-signatures without nested forking
- One-more unforgeability for multi- and threshold signatures
- Practical blind signatures in pairing-free groups
- Partially non-interactive two-round lattice-based threshold signatures
- HARTS: high-threshold, adaptively secure, and robust threshold Schnorr signatures
- Tightly secure non-interactive BLS multi-signatures
- Subset-optimized BLS multi-signature with key aggregation
- Security amplification of threshold signatures in the standard model
- Threshold signatures from one-way functions
- Earpicks: tightly secure two-round multi and threshold signatures
- Putting multi into multi-signatures: tight security for multiple signers
- Device-bound anonymous credentials with(out) trusted hardware
- An explicit high-moment forking lemma and its applications to the concrete security of multi-signatures
- Round-efficient adaptively secure threshold signatures with rewinding
- Tightly secure threshold signatures over pairing-free groups
This page was built for publication: Threshold and multi-signature schemes from linear hash functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6083683)
