Paper 2008/275

Certificate-Based Signature Schemes without Pairings or Random Oracles

Joseph K. Liu, Joonsang Baek, Willy Susilo, and Jianying Zhou

Abstract

In this paper, we propose two new certificate-based signature (CBS) schemes with new features and advantages. The first one is very efficient as it does not require any pairing computation and its security can be proven using Discrete Logarithm assumption in the random oracle model. We also propose another scheme whose security can be proven in the standard model without random oracles. To the best of our knowledge, these are the \emph{first} CBS schemes in the literature that have such kind of features.

Metadata
Available format(s)
PDF
Category
Public-key cryptography
Publication info
Published elsewhere. The extended abstract version of this paper will be published in ISC 2008.
Contact author(s)
ksliu @ i2r a-star edu sg
History
2008-06-18: received
Short URL
https://ia.cr/2008/275
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2008/275,
      author = {Joseph K.  Liu and Joonsang Baek and Willy Susilo and Jianying Zhou},
      title = {Certificate-Based Signature Schemes without Pairings or Random Oracles},
      howpublished = {Cryptology ePrint Archive, Paper 2008/275},
      year = {2008},
      note = {\url{https://eprint.iacr.org/2008/275}},
      url = {https://eprint.iacr.org/2008/275}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.