Paper 2003/208

ID-Based Chameleon Hashes from Bilinear Pairings

Fangguo Zhang, Reihaneh Safavi-Naini, and Willy Susilo

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.

Note: Minor corrections.

Metadata
Available format(s)
PDF PS
Category
Public-key cryptography
Publication info
Published elsewhere. Unknown where it was published
Keywords
Chameleon signatureID-based cryptosystem
Contact author(s)
isdzhfg @ zsu edu cn
History
2004-04-29: last of 4 revisions
2003-10-01: received
See all versions
Short URL
https://ia.cr/2003/208
License
Creative Commons Attribution
CC BY

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},
      note = {\url{https://eprint.iacr.org/2003/208}},
      url = {https://eprint.iacr.org/2003/208}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.