Limits in the provable security of ECDSA signatures
From MaRDI portal
Publication:6587956
DOI10.1007/978-3-031-48624-1_11zbMATH Open1545.94083MaRDI QIDQ6587956
Publication date: 15 August 2024
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The one-more-RSA-inversion problems and the security of Chaum's blind signature scheme
- On the one-per-message unforgeability of (EC)DSA and its variants
- The algebraic group model and its applications
- The insecurity of the digital signature algorithm with partially known nonces
- Public key signatures in the multi-user setting.
- Bandwidth-efficient threshold EC-DSA
- Fast threshold ECDSA with honest majority
- On the security of ECDSA with additive key derivation and presignatures
- Two-party ECDSA from hash proof systems and efficient instantiations
- Threshold-Optimal DSA/ECDSA Signatures and an Application to Bitcoin Wallet Security
- Optimal Security Proofs for Signatures from Identification Schemes
- Random Oracles with(out) Programmability
- Hidden Collisions on DSS
- The Security of DSA and ECDSA
- Random-Oracle Uninstantiability from Indistinguishability Obfuscation
- Discrete-Log-Based Signatures May Not Be Equivalent to Discrete Log
- Theory of Cryptography
- Fast secure two-party ECDSA signing
- The One-More Discrete Logarithm Assumption in the Generic Group Model
- To label, or not to label (in generic groups)
- An analysis of the algebraic group model
Related Items (1)
This page was built for publication: Limits in the provable security of ECDSA signatures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6587956)
