Better than advertised security for non-interactive threshold signatures
From MaRDI portal
Publication:6166964
Recommendations
Cites work
- scientific article; zbMATH DE number 1808277 (Why is no real title available?)
- scientific article; zbMATH DE number 176566 (Why is no real title available?)
- scientific article; zbMATH DE number 1962164 (Why is no real title available?)
- scientific article; zbMATH DE number 2081084 (Why is no real title available?)
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
- Advances in Cryptology – CRYPTO 2004
- Born and raised distributively
- FROST: Flexible round-optimized Schnorr threshold signatures
- How to share a function securely
- How to share a secret
- Practical threshold signatures
- Robust and efficient sharing of RSA functions.
- Robust threshold DSS signatures
- Secure distributed key generation for discrete-log based cryptosystems
- Securing threshold cryptosystems against chosen ciphertext attack
- Short signatures from the Weil pairing
- The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
- The algebraic group model and its applications
- The local forking lemma and its application to deterministic encryption
- The one-more-RSA-inversion problems and the security of Chaum's blind signature scheme
- Threshold Cryptosystems Based on Factoring
- Threshold Signatures, Multisignatures and Blind Signatures Based on the Gap-Diffie-Hellman-Group Signature Scheme
- Threshold and revocation cryptosystems via extractable hash proofs
- Threshold cryptosystems from threshold fully homomorphic encryption
- Threshold-optimal DSA/ECDSA signatures and an application to bitcoin wallet security
- Using level-1 homomorphic encryption to improve threshold DSA signatures for Bitcoin wallet security
Cited in
(13)- FROST: Flexible round-optimized Schnorr threshold signatures
- Threshold structure-preserving signatures
- Fully adaptive Schnorr threshold signatures
- Practical Schnorr threshold signatures without the algebraic group model
- Snowblind: a threshold blind signature in pairing-free groups
- Threshold structure-preserving signatures: strong and adaptive security under standard assumptions
- Threshold and multi-signature schemes from linear hash functions
- Concurrently secure blind Schnorr signatures
- Twinkle: threshold signatures from DDH with full adaptive security
- Threshold raccoon: practical threshold signatures from standard lattice assumptions
- Adaptively secure BLS threshold signatures from DDH and co-CDH
- Adaptively secure 5 round threshold signatures from \textsf{MLWE}/\textsf{MSIS} and \textsf{DL} with rewinding
- Two-round threshold signature from algebraic one-more learning with errors
This page was built for publication: Better than advertised security for non-interactive threshold signatures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6166964)