Strongly Unforgeable ID-Based Signatures without Random Oracles

In this paper, we construct a strongly unforgeable ID-based signature scheme without random oracles.4 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.

• Type: Conference
• Year: 2009
• Where: ISPEC
• Authors: Chifumi Sato, Takeshi Okamoto, Eiji Okamoto
• Keywords: Discrete Logarithm Problem, Diffie–Hellman Problem, ID-based Signature Scheme, ISPEC 2009, Security Privacy