A Graph-Based Chameleon Signature Scheme

Ordinary digital signatures are universally verifiable but they are unsuitable for certain applications that are personally or commercially sensitive. Chameleon signature introduced by Krawczyk and Rabin is non interactive and prevents the receiver of a signed document from disclosing its contents to third parties. Most of the efficient chameleon signature schemes are based on some known hard problems such as integer factorization and discrete logarithm. In this paper, a chameleon signature scheme is proposed and to the best of our knowledge it is the first such scheme using graph theory. It is a collision-resistant scheme that also satisfies the security requirements such as message-hiding, key exposure freeness and semantic security.