Paper 2006/195
An Efficient ID-based Digital Signature with Message Recovery Based on Pairing
Raylin Tso, Chunxiang Gu, Takeshi Okamoto, and Eiji Okamoto
Abstract
Signature schemes with message recovery have been wildly investigated a decade ago in the literature, but the first ID-based signature with message recovery goes out into the world until 2005. In this paper, we first point out and revise one little but important problem which occurs in the previous ID-based signature with message recovery scheme. Then, by completely different setting, we propose a new ID-based signature scheme with message recovery. Our scheme is much more efficient than the previous scheme. In our scheme (as well as other signature schemes with message recovery), the message itself is not required to be transmitted together with the signature, it turns out to have the least data size of communication cost comparing with generic (not short) signature schemes. Although the communication overhead is still larger than Boneh et al. 's short signature (which is not ID-based), the computational cost of our scheme is more efficient than Boneh et al. 's scheme in the verification phase. We will also prove that the proposed scheme is provably secure in the random oracle model under CDH Assumption.
Metadata
- Available format(s)
-
PDF
PS
- Category
- Public-key cryptography
- Publication info
- Published elsewhere. Unknown where it was published
- Keywords
- CDH problemID-based signatureMessage recoveryPairing
- Contact author(s)
- raylin @ risk tsukuba ac jp
- History
- 2006-06-20: received
- Short URL
- https://ia.cr/2006/195
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2006/195,
author = {Raylin Tso and Chunxiang Gu and Takeshi Okamoto and Eiji Okamoto},
title = {An Efficient {ID}-based Digital Signature with Message Recovery Based on Pairing},
howpublished = {Cryptology {ePrint} Archive, Paper 2006/195},
year = {2006},
url = {https://eprint.iacr.org/2006/195}
}
