Consideration of Lightweight Chameleon Hash Function (2)

スポンサーリンク

概要

• 論文の詳細を見る

• Chameleon hash functions are trapdoor one-way hash functions, which prevent everyone except the holder of the trapdoor information from computing the collisions for a randomly given input. A lot of chameleon hash functions have been proposed so far. However, many existing chameleon hash functions have two drawbacks: (1) any chameleon hash function requires modulo operations with a large computational complexity; (2) anyone can calculate new collisions of most chameleon hash functions if a collision has already been generated once. In this paper, we construct a novel chameleon hash function using only hash function and XOR operation to solve the two problems listed above. Moreover, we propose an efficient k -times on-line/off-line signature scheme based on the proposed chameleon hash function. The proposed chameleon hash function is an improvement of SCIS2009.

• 一般社団法人情報処理学会の論文
• 2009-05-21

著者

• Kazumasa Omote

  Japan Advanced Institute Of Science And Technology (jaist)

関連論文

• A Dynamic Attribute-Based Group Signature Scheme and Its Application in an Anonymous Survey for the Collection of Attribute Statistics
• A Combinatorics Proliferation Model with Threshold for Malware Countermeasure
• Consideration of Lightweight Chameleon Hash Function (2)
• Consideration of Lightweight Chameleon Hash Function (2)
• Consideration of Lightweight Chameleon Hash Function (2)

スポンサーリンク