Better than advertised security for non-interactive threshold signatures
From MaRDI portal
Publication:6166964
DOI10.1007/978-3-031-15985-5_18zbMATH Open1517.94179OpenAlexW4312996893MaRDI QIDQ6166964FDOQ6166964
Authors: M. Bellare, Elizabeth C. Crites, Chelsea Komlo, Mary Maller, Stefano Tessaro, Chenzhi Zhu
Publication date: 7 July 2023
Published in: Advances in Cryptology – CRYPTO 2022 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-15985-5_18
Recommendations
Cites Work
- Short signatures from the Weil pairing
- How to share a secret
- Title not available (Why is that?)
- The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
- How to share a function securely
- Securing threshold cryptosystems against chosen ciphertext attack
- The one-more-RSA-inversion problems and the security of Chaum's blind signature scheme
- Robust threshold DSS signatures
- Threshold and revocation cryptosystems via extractable hash proofs
- Practical threshold signatures
- Threshold Cryptosystems Based on Factoring
- Threshold Signatures, Multisignatures and Blind Signatures Based on the Gap-Diffie-Hellman-Group Signature Scheme
- Title not available (Why is that?)
- Secure distributed key generation for discrete-log based cryptosystems
- Title not available (Why is that?)
- Advances in Cryptology – CRYPTO 2004
- Title not available (Why is that?)
- Robust and efficient sharing of RSA functions.
- The algebraic group model and its applications
- FROST: Flexible round-optimized Schnorr threshold signatures
- Born and raised distributively
- Threshold cryptosystems from threshold fully homomorphic encryption
- Using level-1 homomorphic encryption to improve threshold DSA signatures for Bitcoin wallet security
- Threshold-optimal DSA/ECDSA signatures and an application to bitcoin wallet security
- The local forking lemma and its application to deterministic encryption
Cited In (13)
- Threshold structure-preserving signatures
- FROST: Flexible round-optimized Schnorr threshold 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)