Chameleon Hashing Without Key Exposure
Chameleon Hashing Without Key Exposure
复制标题
DOI：
10.1007/978-3-540-30144-8_8
复制
发表时间：
2004-09
期刊：
影响因子：
--
通讯作者：
Xiaofeng Chen;Fangguo Zhang;Kwangjo Kim
中科院分区：
文献类型：
--
作者：
Xiaofeng Chen;Fangguo Zhang;Kwangjo Kim
Chameleon签名基于成熟的哈希和签名范式，其中acheleon哈希函数用于计算加密消息摘要。变色龙签名同时提供了签名消息的不可否认性和不可转移性，即，指定的接收者能够验证签名的有效性，但未经签名者同意，不能泄露签名信息的内容以说服任何第三方。初始变色龙签名的一个缺点是签名伪造导致签名者恢复接收者的陷门信息，即，私钥因此，签名者可以使用该信息来否认给予接收者的其他签名。这对收件人伪造签名形成了强烈的抑制，部分破坏了不可转让的概念。本文首先在差距Diffie-Hellman群中提出了一种新的变色龙散列方案来解决密钥暴露问题。我们可以证明，在计算困难-赫尔曼问题（CDHP）是棘手的假设下，接收者的陷门信息将永远不会被泄露。此外，我们使用所提出的变色龙散列方案设计了一个变色龙签名方案。
Chameleon signatures are based on well established hash-and-sign paradigm, where achameleon hash functionis used to compute the cryptographic message digest. Chameleon signatures simultaneously provide the properties of non-repudiation and non-transferability for the signed message,i.e., the designated recipient is capable of verifying the validity of the signature, but cannot disclose the contents of the signed information to convince any third party without the signer’s consent.One disadvantage of the initial chameleon signatures is that signature forgery results in the signer recovering the recipient’s trapdoor information,i.e., private key. Therefore, the signer can use this information to denyothersignatures given to the recipient. This creates a strong disincentive for the recipient to forge signatures, partially undermining the concept of non-transferability. In this paper, we first propose a novel chameleon hashing scheme in the gap Diffie-Hellman group to solve the problem of key exposure. We can prove that the recipient’s trapdoor information will never be compromised under the assumption of Computation Diffie-Hellman Problem (CDHP) is intractable. Moreover, we use the proposed chameleon hashing scheme to design a chameleon signature scheme.