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.
Author supplied keywords
Cite
CITATION STYLE
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.
