Comments and improvements on key-exposure free chameleon hashing based on factoring

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6584 LNCS, Issue , 2011, Pages 415-426

  Chen, Xiaofeng ^a   Tian, Haibo ^b   Zhang, Fangguo ^b   Ding, Yong ^c  

^a XIDIAN UNIVERSITY   (China)

^b SUN YAT SEN UNIVERSITY   (China)

^c GUILIN UNIVERSITY OF ELECTRONIC TECHNOLOGY   (China)

Author keywords

Chameleon hashing; Factoring problem; Key exposure

Indexed keywords

CHAMELEON HASHING; CHAMELEON SIGNATURES; FACTORING PROBLEM; HASH SCHEME; KEY EXPOSURE; NON-REPUDIATION; NON-TRANSFERABILITY; SECURITY FLAWS; SECURITY NOTION; NON REPUDIATION;

CRYPTOGRAPHY; NETWORK SECURITY; SECURITY OF DATA;

ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS;

EID: 79960816826     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-21518-6_29     Document Type: Conference Paper

References (13)

1. Ateniese, G., de Medeiros, B.: Identity-based chameleon hash and applications. In: Juels, A. (ed.) FC 2004. LNCS, vol. 3110, pp. 164-180. Springer, Heidelberg (2004)
2. Ateniese, G., de Medeiros, B.: On the key exposure problem in chameleon hashes. In: Blundo, C., Cimato, S. (eds.) SCN 2004. LNCS, vol. 3352, pp. 165-179. Springer, Heidelberg (2005)
3. Bellare, M., Rogaway, P.: The Exact Security of Digital Signatures - How to Sign with RSA and Rabin. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol. 1070, pp. 399-416. Springer, Heidelberg (1996)
4. Chaum, D., van Antwerpen, H.: Undeniable signatures. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 212-216. Springer, Heidelberg (1990)
5. Cocks, C.: An identity based encryption scheme based on quadratic residues. In: Honary, B. (ed.) Cryptography and Coding 2001. LNCS, vol. 2260, pp. 360-363. Springer, Heidelberg (2001)
6. Chen, X., Zhang, F., Kim, K.: Chameleon hashing without key exposure. In: Zhang, K., Zheng, Y. (eds.) ISC 2004. LNCS, vol. 3225, pp. 87-98. Springer, Heidelberg (2004)
7. Chen, X., Zhang, F., Susilo, W., Mu, Y., Lee, H., Kim, K.: Key-exposure free chameleon hashing and signatures based on discrete logarithm systems, http://eprint.iacr.org/2009/035
8. Chen, X., Zhang, F., Susilo,W., Tian, H., Li, J., Kim, K.: Identity-based chameleon hash scheme without key exposure. In: Steinfeld, R., Hawkes, P. (eds.) ACISP 2010. LNCS, vol. 6168, pp. 200-215. Springer, Heidelberg (2010)
9. Fischlin, M., Fischlin, R.: The representation problem based on factoring. In: Preneel, B. (ed.) CT-RSA 2002. LNCS, vol. 2271, pp. 96-113. Springer, Heidelberg (2002)
10. Gao, W., Wang, X., Xie, D.: Chameleon hashes without key exposure based on factoring. Journal of Computer Science and Technology 22(1), 109-113 (2007)
11. Gao, W., Li, F., Wang, X.: Chameleon hash without key exposure based on Schnorr signature. Computer Standards and Interfaces 31, 282-285 (2009)
12. Kurosawa, K., Schmidt-Samoa, K.: New online/offline signature schemes without random oracles. In: Yung, M., Dodis, Y., Kiayias, A., Malkin, T. (eds.) PKC 2006. LNCS, vol. 3958, pp. 330-346. Springer, Heidelberg (2006)
13. Krawczyk, H., Rabin, T.: Chameleon hashing and signatures. In: Proc. of NDSS 2000, pp. 143-154 (2000)