Gradually convertible undeniable signatures (Michels-Petersen-Horster convertible undeniable signatures revisited)

6Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

In 1990, Boyar, Chaum, Damgård and Pedersen introduced convertible undeniable signatures which limit the self-authenticating property of digital signatures but can be converted by the signer to ordinary signatures. Michels, Petersen and Horster presented, in 1996, an attack on the Elgamal-based seminal scheme of Boyar et al. and proposed a repaired version without formal security analysis. In this paper, we modify their protocol so that it becomes a generic one and it provides an advanced feature which permits the signer to universally convert achronously all signatures pertaining to a specific time period. We supply a formal security treatment of the modified scheme: we prove, in the generic group model, that the protocol is existentially unforgeable and anonymous under chosen message attacks, assuming new assumptions (though reasonable) on the underlying hash function. © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

El Aimani, L., & Vergnaud, D. (2007). Gradually convertible undeniable signatures (Michels-Petersen-Horster convertible undeniable signatures revisited). In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4521 LNCS, pp. 478–496). Springer Verlag. https://doi.org/10.1007/978-3-540-72738-5_31

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free