Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
On the Key Exposure Problem in Chameleon Hashes Giuseppe Ateniese
 

Summary: On the Key Exposure Problem in Chameleon Hashes
Giuseppe Ateniese
Department of Computer Science and
Information Security Institute
The Johns Hopkins University
Breno de Medeiros
Department of Computer Science
The Florida State University
ateniese@cs.jhu.edu, breno@cs.fsu.edu
Abstract
Chameleon signatures were introduced by Krawczyk and Rabin, being non-interactive sig-
nature schemes that provide non-transferability. However, that first construction employs a
chameleon hash that suffers from a key exposure problem: The non-transferability property re-
quires willingness of the recipient in consequentially exposing a secret key, and therefore inval-
idating all signatures issued to the same recipient's public key. To address this key-revocation
issue, and its attending problems of key redistribution, storage of state information, and greater
need for interaction, an identity-based scheme was proposed in [1], while a fully key-exposure
free construction, based on the elliptic curves with pairings, appeared later in [7].
Herein we provide several constructions of exposure-free chameleon hash functions based
on different cryptographic assumptions, such as the RSA and the discrete logarithm assump-

  

Source: Ateniese, Giuseppe - Department of Computer Science, Johns Hopkins University
International Association for Cryptologic Research (IACR) - Cryptology ePrint Archive

 

Collections: Computer Technologies and Information Sciences; Multidisciplinary Databases and Resources