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

  • Authors:
  • Xiaofeng Chen;Haibo Tian;Fangguo Zhang;Yong Ding

  • Affiliations:
  • Key Laboratory of Computer Networks and Information Security, Ministry of Education, Xidian University, Xi'an, P.R. China;School of Information Science and Technology, Sun Yat-sen University, Guangzhou, P.R. China;School of Information Science and Technology, Sun Yat-sen University, Guangzhou, P.R. China;School of Mathematics and Computational Science, Guilin University of Electronic Technology, Guilin, P.R. China

  • Venue:
  • Inscrypt'10 Proceedings of the 6th international conference on Information security and cryptology
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

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 key exposure problem of chameleon hashing. 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 based on various assumptions are presented. In this paper, we present some security flaws of the key-exposure free chameleon hash scheme based on factoring [10]. Besides, we propose an improved chameleon hash scheme without key exposure based on factoring which enjoys all the desired security notions of chameleon hashing.