Limits in the provable security of ECDSA signatures

DOI10.1007/978-3-031-48624-1_11MaRDI QIDQ6587956zbMATH OpenFDO

Authors Dominik Hartmann, Eike Kiltz

Publication date 15 August 2024

Full work available at URL https://doi.org/10.1007/978-3-031-48624-1_11

zbMATH Keywords

conversion functionECDSAmeta reductionsprogrammabilityrandom oracle model

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• scientific article; zbMATH DE number 1942415
• Generic groups, collision resistance, and ECDSA
• The random oracle model: a twenty-year retrospective
• The Security of DSA and ECDSA
• scientific article; zbMATH DE number 1951600

Cites work

• An analysis of the algebraic group model
• Bandwidth-efficient threshold EC-DSA
• Discrete-Log-Based Signatures May Not Be Equivalent to Discrete Log
• Fast secure two-party ECDSA signing
• Fast threshold ECDSA with honest majority
• Hidden Collisions on DSS
• scientific article; zbMATH DE number 1088937 (Why is no real title available?)
• scientific article; zbMATH DE number 1942415 (Why is no real title available?)
• scientific article; zbMATH DE number 1951600 (Why is no real title available?)
• scientific article; zbMATH DE number 1775406 (Why is no real title available?)
• scientific article; zbMATH DE number 1440063 (Why is no real title available?)
• On the one-per-message unforgeability of (EC)DSA and its variants
• On the security of ECDSA with additive key derivation and presignatures
• Optimal security proofs for signatures from identification schemes
• Public key signatures in the multi-user setting.
• Random oracles with(out) programmability
• Random-oracle uninstantiability from indistinguishability obfuscation
• The algebraic group model and its applications
• The insecurity of the digital signature algorithm with partially known nonces
• The One-More Discrete Logarithm Assumption in the Generic Group Model
• The one-more-RSA-inversion problems and the security of Chaum's blind signature scheme
• The Security of DSA and ECDSA
• Theory of Cryptography
• Threshold-optimal DSA/ECDSA signatures and an application to bitcoin wallet security
• To label, or not to label (in generic groups)
• Two-party ECDSA from hash proof systems and efficient instantiations

Cited in

(6)

• Concurrently secure blind Schnorr signatures
• Schnorr signatures are tightly secure in the ROM under a non-interactive assumption
• Joint security of encryption and signature in rucms: two keys are better, but one is also fine
• On the limits of non-interactive blind signatures
• On the buff security of ECDSA with key recovery
• Blind \textsf{ECDSA} from the \textsf{ECDSA} assumption

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)