E-mail

E-mail a Wiley Online Library Link

Seongan Lim, Juhee Lee and Youngjoo An Key exposure free chameleon hash schemes based on discrete logarithm problem Security and Communication Networks 6

Version of Record online: 13 AUG 2012 | DOI: 10.1002/sec.612

Thumbnail image of graphical abstract

The chameleon hash key pair (skCH, pkCH) of the verifier guarantees that the verifier is the only one who can compute a hash collision, which means a signature forgery. The algorithm UForge guarantees the non-transferability of the signature, and the algorithm IForge guarantees the message privacy of the signer. In this paper, we present a key(skCH) exposure free chameleon hash scheme based on discrete logarithm problem.

Complete the form below and we will send an e-mail message containing a link to the selected article on your behalf

Required = Required Field

SEARCH