Abstract

This paper introduces a simple alternative to the hash-andsign paradigm called twinning. A twin signature is obtained by signing twice the same short message by a probabilistic signature scheme. Analysis of the concept in di#erent settings yields the following results: -- We prove that no generic algorithm can e#ciently forge a twin DSA signature. Although generic algorithms o#er 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.

Citations