An efficient ID-based proxy signature scheme from pairings

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

Abstract

This paper proposes a new ID-based proxy signature scheme based on the bilinear pairings. The number of paring operation involved in the verification procedure of our scheme is only one, so our scheme is more efficient comparatively. The new scheme can be proved secure with the hardness assumption of the k-Bilinear Diffie-Hellman Inverse problem, in the random oracle model. © 2008 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Gu, C., & Zhu, Y. (2008). An efficient ID-based proxy signature scheme from pairings. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4990 LNCS, pp. 40–50). https://doi.org/10.1007/978-3-540-79499-8_5

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