Online citations, reference lists, and bibliographies.

On The One-Per-Message Unforgeability Of (EC)DSA And Its Variants

Manuel Fersch, Eike Kiltz, Bertram Poettering
Published 2017 · Computer Science

Cite This
Download PDF
Analyze on Scholarcy
Share
The American signature standards DSA and ECDSA, as well as their Russian and Chinese counterparts GOST 34.10 and SM2, are of utmost importance in the current security landscape. The mentioned schemes are all rooted in the Elgamal signature scheme (1984) and use a hash function and a cyclic group as building blocks. Unfortunately, authoritative security guarantees for the schemes are still due: All existing positive results on their security use aggressive idealization approaches, like the generic group model, leading to debatable overall results.
This paper references
10.1007/3-540-36288-6_23
The Security of DSA and ECDSA
S. Vaudenay (2003)
10.17487/RFC7091
GOST R 34.10-2012: Digital Signature Algorithm
Vasily Dolmatov (2013)
10.1145/1374376.1374407
Trapdoors for hard lattices and new cryptographic constructions
C. Gentry (2008)
On Provable Security for Digital Signature Algorithms
D. Pointcheval (1996)
10.1007/3-540-69053-0_18
Lower Bounds for Discrete Logarithms and Related Problems
V. Shoup (1997)
10.1007/978-3-662-53890-6_15
From Identification to Signatures, Tightly: A Framework and Generic Transforms
M. Bellare (2016)
10.1007/3-540-68697-5_7
Hidden Collisions on DSS
S. Vaudenay (1996)
10.1023/A:1025436905711
The Insecurity of the Elliptic Curve Digital Signature Algorithm with Partially Known Nonces
P. Nguyen (2003)
10.1007/978-3-319-27152-1_7
Security of the SM2 Signature Scheme Against Generalized Key Substitution Attacks
Zhenfeng Zhang (2015)
10.1201/9781439821916
Handbook of Applied Cryptography
A. Menezes (1996)
10.1017/CBO9780511546570.004
Advances in Elliptic Curve Cryptography: On the Provable Security of ECDSA
D. Brown (2005)
10.1007/3-540-45708-9_7
Flaws in Applying Proof Methodologies to Signature Schemes
J. Stern (2002)
10.1007/978-3-540-28632-5_31
Attacking DSA Under a Repeated Bits Assumption
P. J. Leadbitter (2004)
One-Up Problem for (EC)DSA
D. L. Brown (2008)
10.1023/A:1011214926272
Lattice Attacks on Digital Signature Schemes
Nick Howgrave-Graham (2001)
10.1007/3-540-39568-7_2
A public key cryptosystem and a signature scheme based on discrete logarithms
T. Elgamal (1984)
Hidden collisions on DSS The security of DSA and ECDSA . In : Desmedt , Y . ( ed . ) PKC
M. Yung (2003)
10.1145/2976749.2978420
"Make Sure DSA Signing Exponentiations Really are Constant-Time"
Cesar Pereida García (2016)
10.1049/el:19941398
Design of generalised ElGamal type digital signature schemes based on discrete logarithm
L. Harn (1994)
FIPS PUB 186-4 Federal Information Processing Standards publication: Digital Signature Standard (DSS
C. F. Kerry (2013)
On the One-Per-Message Unforgeability of (EC)DSA and its Variants
M. Fersch (2017)
10.1145/2976749.2978413
On the Provable Security of (EC)DSA Signatures
Manuel Fersch (2016)
10.1049/el:19940336
New digital signature scheme based on discrete logarithm
K. Nyberg (1994)
10.1049/el:19900663
Improved digital signature scheme based on discrete exponentiation
G. Agnew (1990)
FIPS PUB 186-4 Federal Information Processing Standards publication: Digital Signature Standard (DSS) (2013), http://dx.doi
C. F. Kerry (2013)
10.1007/978-3-540-46588-1_19
Design Validations for Discrete Logarithm Based Signature Schemes
E. Brickell (2000)
10.1007/3-540-36492-7_1
Modifications of ECDSA
J. Malone-Lee (2002)
10.1145/2976749.2978353
ECDSA Key Extraction from Mobile Devices via Nonintrusive Physical Side Channels
Daniel Genkin (2016)
10.1007/s10623-003-6154-z
Generic Groups, Collision Resistance, and ECDSA
D. L. Brown (2002)
10.1007/s10207-015-0307-8
Double-authentication-preventing signatures
Bertram Poettering (2015)
10.1007/3-540-44598-6_14
On the Exact Security of Full Domain Hash
J. Coron (2000)



This paper is referenced by
Semantic Scholar Logo Some data provided by SemanticScholar