Provably secure identity-based undeniable signatures with selective and universal convertibility

10Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper, we present the first concrete example of identity-based undeniable signature with selective and universal convertibility, where the signer can release a selective proof to make a single undeniable signature publicly verifiable, or publish a universal proof to convert all his undeniable signatures into ordinary digital signatures. Furthermore, we also formalized the security models of identity-based convertible undeniable signatures. The new models capture more essence of the property "convertibility" of identity-based undeniable signatures, compared with other known security models. Our scheme can be regarded as an improvement of Libert and Quisquater's identity-based undeniable signature scheme published in CT-RSA 2004. The security of our scheme is formally proven in the random oracle model under some well-known complexity assumptions. Its unforgeability relies on the hardness of the Computational Diffie-Hellman problem, while the invisibility (and anonymity) is based on the hardness of Decisional Bilinear Diffie-Hellman problem. © 2008 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Wu, W., Mu, Y., Susilo, W., & Huang, X. (2008). Provably secure identity-based undeniable signatures with selective and universal convertibility. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4990 LNCS, pp. 25–39). https://doi.org/10.1007/978-3-540-79499-8_4

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