[AdM04] On the Key Exposure Problem in Chameleon Hashes
Authors: Giuseppe Ateniese, Breno de Medeiros | Venue: SCN 2004 | Source
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).
BibTeX
@Inproceedings{SCN:AtedMe04,
author = {Giuseppe Ateniese and Breno de Medeiros},
title = {On the Key Exposure Problem in Chameleon Hashes},
pages = {165--179},
editor = {Carlo Blundo and Stelvio Cimato},
booktitle = {SCN 04: 4th International Conference on Security in Communication Networks},
volume = {3352},
series = {Lecture Notes in Computer Science},
address = {Amalfi, Italy},
month = {sep~8--10},
publisher = {Springer Berlin Heidelberg, Germany},
year = {2005},
doi = {10.1007/978-3-540-30598-9_12},
}