Name
Abstract | ||
|---|---|---|
This paper introduces a simple alternative to the hash-and-sign paradigm, from the security point of view but for signing short messages, called twinning. A twin signature is obtained by signing twice a short message by a signature scheme. Analysis of the concept in different settings yields the following results: We prove that no generic algorithm can efficiently forge a twin DSA signature. Although generic algorithms offer a less stringent form of security than computational reductions in the standard model, such successful proofs still produce positive evidence in favor of the correctness of the new paradigm.We prove in standard model an equivalence between the hardness of producing existential forgeries (even under adaptively chosen message attacks) of a twin version of a signature scheme proposed by Gennaro, Halevi and Rabin and the Flexible RSA Problem.We consequently regard twinning as an interesting alternative to hash functions for eradicating existential forgery in signature schemes. |
Year | DOI | Venue |
|---|---|---|
2001 | 10.1145/501983.501987 | ACM Conference on Computer and Communications Security |
Keywords | Field | DocType |
twin version,short message,twin dsa signature,signature scheme,twin signature,existential forgery,interesting alternative,hash-and-sign paradigm,standard model,generic algorithm,difference set,digital signatures,hash function,digital signature,provable security,discrete logarithm | ElGamal signature scheme,Computer science,Computer security,Merkle signature scheme,Ring signature,Theoretical computer science,Digital signature,RSA problem,Hash function,Blind signature,Schnorr signature | Conference |
ISBN | Citations | PageRank |
1-58113-385-5 | 24 | 1.09 |
References | Authors | |
12 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| David Naccache | 1 | 1920 | 213.34 |
| David Pointcheval | 2 | 781 | 33.25 |
| Jacques Stern | 3 | 24 | 1.09 |