A Graph-Based Chameleon Signature Scheme

Conference paper
Part of the Smart Innovation, Systems and Technologies book series (SIST, volume 44)


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.


Directed graphs Chameleon hashing Chameleon signature 


  1. 1.
    Ateniese, G., de Medeiros, B.: Identity-based chameleon hash and applications. In: Financial Cryptography, pp. 164–180. Springer (2004)Google Scholar
  2. 2.
    Ateniese, G., de Medeiros, B.: On the key exposure problem in chameleon hashes. In: Security in Communication Networks, pp. 165–179. Springer (2005)Google Scholar
  3. 3.
    Chaum, D., Van Antwerpen, H.: Undeniable signatures. In: Advances in Cryptology—CRYPTO’89 Proceedings, pp. 212–216. Springer (1990)Google Scholar
  4. 4.
    Chen, X., Zhang, F., Kim, K.: Chameleon hashing without key exposure. In: Information Security, pp. 87–98. Springer (2004)Google Scholar
  5. 5.
    Chen, X., Zhang, F., Tian, H., Wei, B., Kim, K.: Discrete logarithm based chameleon hashing and signatures without key exposure. Comput. Electr. Eng. 37(4), 614–623 (2011)CrossRefMATHGoogle Scholar
  6. 6.
    Gao, W., Li, F., Wang, X.: Chameleon hash without key exposure based on schnorr signature. Comput. Stand. Interfaces 31(2), 282–285 (2009)CrossRefGoogle Scholar
  7. 7.
    Gao, W., Wang, X.L., Xie, D.Q.: Chameleon hashes without key exposure based on factoring. J. Comput. Sci. Technol. 22(1), 109–113 (2007)CrossRefGoogle Scholar
  8. 8.
    Hevia, A., Micciancio, D.: The provable security of graph-based one-time signatures and extensions to algebraic signature schemes. In: Advances in Cryptology—ASIACRYPT, pp. 379–396. Springer (2002)Google Scholar
  9. 9.
    Krawczyk, H.M., Rabin, T.D.: Chameleon hashing and signatures (2000), US Patent 6,108,783Google Scholar
  10. 10.
    Pan, P., Wang, L., Yang, Y., Gan, Y., Wang, L., Xu, C.: Chameleon hash functions and one-time signature schemes from inner automorphism groups. Fundamenta Informaticae 126(1), 103–119 (2013)MathSciNetMATHGoogle Scholar

Copyright information

© Springer India 2016

Authors and Affiliations

  1. 1.PSG College of TechnologyCoimbatoreIndia

Personalised recommendations