Generic groups, collision resistance, and ECDSA
From MaRDI portal
Publication:2572964
Recommendations
Cites work
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
- Algebraic aspects of cryptography. With an appendix on hyperelliptic curves by Alfred J. Menezes, Yi-Hong Wu, and Robert J. Zuccherato
- Algorithms for black-box fields and their application to cryptography
- An efficient existentially unforgeable signature scheme and its applications
- Complexity of a determinate algorithm for the discrete logarithm
- Hidden Collisions on DSS
- scientific article; zbMATH DE number 1583771 (Why is no real title available?)
- scientific article; zbMATH DE number 1583798 (Why is no real title available?)
- scientific article; zbMATH DE number 1617923 (Why is no real title available?)
- scientific article; zbMATH DE number 1617924 (Why is no real title available?)
- scientific article; zbMATH DE number 438988 (Why is no real title available?)
- scientific article; zbMATH DE number 1303114 (Why is no real title available?)
- scientific article; zbMATH DE number 1303133 (Why is no real title available?)
- scientific article; zbMATH DE number 1304190 (Why is no real title available?)
- scientific article; zbMATH DE number 1088241 (Why is no real title available?)
- scientific article; zbMATH DE number 1942415 (Why is no real title available?)
- scientific article; zbMATH DE number 1759781 (Why is no real title available?)
- scientific article; zbMATH DE number 1775406 (Why is no real title available?)
- scientific article; zbMATH DE number 1406786 (Why is no real title available?)
- scientific article; zbMATH DE number 1440063 (Why is no real title available?)
- Key agreement protocols and their security analysis
- Lattice attacks on digital signature schemes
- Secure Hash-and-Sign Signatures Without the Random Oracle
- Security arguments for digital signatures and blind signatures
- Security of signature schemes in a multi-user setting
- The exact security of digital signatures -- how to sign with RSA and Rabin
- The insecurity of the digital signature algorithm with partially known nonces
- The Relationship Between Breaking the Diffie--Hellman Protocol and Computing Discrete Logarithms
Cited in
(23)- A synthetic indifferentiability analysis of some block-cipher-based hash functions
- Compact zero-knowledge proofs for threshold ECDSA with trustless setup
- On the security of ECDSA with additive key derivation and presignatures
- Some observations on the theory of cryptographic hash functions
- On the joint security of encryption and signature in EMV
- Provable security of digital signatures in the tamper-proof device model
- Hash function requirements for Schnorr signatures
- scientific article; zbMATH DE number 1942415 (Why is no real title available?)
- scientific article; zbMATH DE number 1951600 (Why is no real title available?)
- The Security of DSA and ECDSA
- The Exact Security of ECIES in the Generic Group Model
- On the Equivalence of Generic Group Models
- Machine-checked security proofs of cryptographic signature schemes
- Generic-Group Identity-Based Encryption: A Tight Impossibility Result
- Tweakable $$\mathcal {S}_{\text{ leeve }}$$: A Novel $$\mathcal {S}_{\text{ leeve }}$$ Construction Based on Tweakable Hash Functions
- Certificateless Public Key Signature Schemes from Standard Algorithms
- Limits in the provable security of ECDSA signatures
- Joint security of encryption and signature in rucms: two keys are better, but one is also fine
- The structured generic-group model
- On the buff security of ECDSA with key recovery
- Two-round 2PC ECDSA at the cost of 1 OLE: applications to embedded cryptocurrency wallets
- Blind \textsf{ECDSA} from the \textsf{ECDSA} assumption
- The random oracle model: a twenty-year retrospective
This page was built for publication: Generic groups, collision resistance, and ECDSA
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2572964)
