CryptoDB
Certificate-Based Signature Schemes without Pairings or Random Oracles
Authors: | |
---|---|
Download: | |
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. |
BibTeX
@misc{eprint-2008-17952, title={Certificate-Based Signature Schemes without Pairings or Random Oracles}, booktitle={IACR Eprint archive}, keywords={public-key cryptography /}, url={http://eprint.iacr.org/2008/275}, note={The extended abstract version of this paper will be published in ISC 2008. ksliu@i2r.a-star.edu.sg 14046 received 16 Jun 2008}, author={Joonsang Baek and Joseph K. Liu and Willy Susilo and Jianying Zhou}, year=2008 }