Paper 2008/095

Strongly Unforgeable ID-based Signatures Without Random Oracles

Chifumi Sato, Takeshi Okamoto, and Eiji Okamoto

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.

Metadata
Available format(s)
PDF PS
Category
Cryptographic protocols
Publication info
Published elsewhere. An extended abstract of this paper appears in Proceedings of ISPEC 2009, LNCS 5451, pp.35-46, Springer-Verlag, 2009.
Keywords
Digital signaturesID-based signaturesStrong unforgeabilityStandard models
Contact author(s)
c-sato @ sbins co jp
History
2009-04-15: last of 2 revisions
2008-03-03: received
See all versions
Short URL
https://ia.cr/2008/095
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2008/095,
      author = {Chifumi Sato and Takeshi Okamoto and Eiji Okamoto},
      title = {Strongly Unforgeable ID-based Signatures Without Random Oracles},
      howpublished = {Cryptology ePrint Archive, Paper 2008/095},
      year = {2008},
      note = {\url{https://eprint.iacr.org/2008/095}},
      url = {https://eprint.iacr.org/2008/095}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.