[Resource Topic] 2004/243: On the Key Exposure Problem in Chameleon Hashes

Welcome to the resource topic for 2004/243

Title:
On the Key Exposure Problem in Chameleon Hashes

Authors: Giuseppe Ateniese, Breno de Medeiros

Abstract:

Chameleon signatures were introduced by Krawczyk and Rabin, being non-interactive signature schemes that provide non-transferability. However, that first construction
employs a chameleon hash that suffers from a key exposure problem:
The non-transferability property requires willingness of the recipient in consequentially exposing a secret key, and therefore invalidating 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 assumptions. One of the
schemes is a novel construction that relies on a single trapdoor
and therefore may potentially be realized over a large set of cryptographic
groups (where the discrete logarithm is hard).

ePrint: https://eprint.iacr.org/2004/243

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .