Volume 7 - Issue 2
Identity-based key-exposure free chameleon hashing based on the RSA assumption
Abstract
Chameleon signatures are based on well established hash-and-sign paradigm, where a chameleon hash function is used to compute the cryptographic message digest. Chameleon signatures simultaneously provide the properties of non-repudiation and non-transferability for the signed message. However, the initial constructions of chameleon signatures suffer from the problem of key exposure of chameleon hashing (i.e., a collision of the chameleon hashing results in the signer recovering the recipient's private key), first addressed by Ateniese and de Mederious in 2004. This creates a strong disincentive for the recipient to forge signatures, partially undermining the concept of non-transferability. Recently, some specific constructions of key-exposure free chameleon hashing are presented in the setting of certificate-based systems. In this paper, we firstly propose an identity-based key-exposure free chameleon hashing based on the RSA assumption, which gives a positive answer for the open problem introduced by Ateniese and de Mederious in 2004.
Paper Details
PaperID: 79953750650
Author's Name: Zhan, Y., Chen, X., Tian, H., Wang, Y.
Volume: Volume 7
Issues: Issue 2
Keywords: Chameleon hashing, Gap Diffie-Hellman group, Key exposure, Signatures
Year: 2011
Month: February
Pages: 350 - 358