Strongly unforgeable signatures based on computational Diffie-Hellman

187Citations
Citations of this article
76Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

A signature system is said to be strongly unforgeable if the signature is existentially unforgeable and, given signatures on some message m, the adversary cannot produce a new signature on m. Strongly unforgeable signatures are used for constructing chosen-ciphertext secure systems and group signatures. Current efficient constructions in the standard model (i.e. without random oracles) depend on relatively strong assumptions such as Strong-RSA or Strong-Diffie-Hellman. We construct an efficient strongly unforgeable signature system based on the standard Computational Diffie-Hellman problem in bilinear groups. © International Association for Cryptologic Research 2006.

Cite

CITATION STYLE

APA

Boneh, D., Shen, E., & Waters, B. (2006). Strongly unforgeable signatures based on computational Diffie-Hellman. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3958 LNCS, pp. 229–240). https://doi.org/10.1007/11745853_15

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