An ID-based key-exposure free chameleon hashing under Schnorr signature
Abstract
An ID-based key exposure free chameleon hashing scheme under the Schnorr signature system is proposed in this paper. Gao et al [5] first proposed chameleon hashing based on schnorr signature. This scheme inherited the qualities of Schnorr scheme [7], but our proposed scheme used in schnorr scheme quality and our design based on ID-based system in chameleon hashing, because the owner of a public key does not necessarily need to retrieve the associated secret key. And I have been implementing the algorithm in Mathematica 7.0 and here are provided the steps of the algorithm and discusses the security and efficiency.
Copyright © 2016 Tejeshwari Thakur, Birendra Kumar Sharma. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Cite this article
T. Thakur, B. K. Sharma, An ID-based key-exposure free chameleon hashing under Schnorr signature, J. Math. Comput. Sci. 6 (2016), 281–289.
BibTeX
@article{Thakur2016,
author = {Thakur, Tejeshwari and Sharma, Birendra Kumar},
title = {An ID-based key-exposure free chameleon hashing under Schnorr signature},
journal = {J. Math. Comput. Sci.},
volume = {6},
year = {2016},
pages = {281--289},
doi = {}
}