Paper 2003/208 Original: eprint.iacr.org/2003/208 ↗
ID-Based Chameleon Hashes from Bilinear Pairings
Abstract
Chameleon hash function is a trapdoor one-way hash function. The ID-based chameleon hash function was first introduced by Ateniese and Medeiros \cite{AM03}. As discussed by \cite{AM03}, the general advantages of ID-based cryptography over conventional cryptography with respect to key distribution are even more pronounced in a chameleon hashing scheme, because the owner of a public key does not necessarily need to retrieve the associated secret key. In this paper, we propose two new ID-based Chameleon hashing schemes from bilinear pairings. Also we analyze their security and efficiency. Based on these ID-based chameleon hashes, ID-based chameleon signature schemes can be designed.
Metadata
- Available format(s)
PDF- Category
- Public-key cryptography
- Publication info
- Preprint.
- History
- 2004-04-29: last updated
- 2003-10-01: published
- Short URL
- https://ia.cr/2003/208
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2003/208,
author = {Fangguo Zhang and Reihaneh Safavi-Naini and Willy Susilo},
title = {ID-Based Chameleon Hashes from Bilinear Pairings},
howpublished = {Cryptology {ePrint} Archive, Paper 2003/208},
year = {2003},
url = {https://eprint.iacr.org/2003/208}
}