Paper 2004/290
The Security of the FDH Variant of Chaum's Undeniable Signature Scheme
Wakaha Ogata, Kaoru Kurosawa, and Swee-Huay Heng
Abstract
In this paper, we first introduce a new kind of adversarial goal called {\em forge-and-impersonate} in undeniable signature schemes. Note that forgeability does not necessarily imply impersonation ability. We then classify the security of the FDH variant of Chaum's undeniable signature scheme according to three dimensions, the goal of adversaries, the attacks and the ZK level of confirmation and disavowal protocols. We finally relate each security to some well-known computational problem. In particular, we prove that the security of the FDH variant of Chaum's scheme with NIZK confirmation and disavowal protocols is equivalent to the CDH problem, as opposed to the GDH problem as claimed by Okamoto and Pointcheval.
Metadata
- Available format(s)
-
PDF
PS
- Category
- Public-key cryptography
- Publication info
- Published elsewhere. The proceedings version of this paper will be presented at PKC 2005
- Keywords
- Undeniable signaturesecurity analysis
- Contact author(s)
- shheng @ mmu edu my
- History
- 2005-02-25: revised
- 2004-11-05: received
- See all versions
- Short URL
- https://ia.cr/2004/290
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2004/290,
author = {Wakaha Ogata and Kaoru Kurosawa and Swee-Huay Heng},
title = {The Security of the FDH Variant of Chaum's Undeniable Signature Scheme},
howpublished = {Cryptology ePrint Archive, Paper 2004/290},
year = {2004},
note = {\url{https://eprint.iacr.org/2004/290}},
url = {https://eprint.iacr.org/2004/290}
}
