Abstract
In this paper, we construct a strongly unforgeable ID-based signature scheme without random oracles. The signature size of our scheme is smaller than that of other schemes based on varieties of the Diffie-Hellman problem or the discrete logarithm problem. The security of the scheme relies on the difficulty to solve three problems related to the Diffie-Hellman problem and a one-way isomorphism. © 2009 Springer Berlin Heidelberg.
Author supplied keywords
Cite
CITATION STYLE
Sato, C., Okamoto, T., & Okamoto, E. (2009). Strongly unforgeable ID-based signatures without random oracles. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5451 LNCS, pp. 35–46). https://doi.org/10.1007/978-3-642-00843-6_4
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
