Universal Undeniable Signatures

Huafei Zhu

Paper 2004/005 Original: eprint.iacr.org/2004/005 ↗

Universal Undeniable Signatures

Huafei Zhu

Abstract

In this paper, we provide a new approach to study undeniable signatures by translating secure digital signatures to secure undeniable signatures so that the existing algorithms can be used. Our mechanism is that any verifier without trapdoor information cannot distinguish whether a message is encoded from Diffie-Hellamn resource $D$ or random resource $R$ while a signer with trapdoor information can distinguish efficiently a codeword which is computed from $D$ or $R$. We show how our mechanism can be efficiently achieved and provide proofs of security for our schemes in the standard complexity model. We also provide evidences to show that our approach can be applied to construct designated confirmer signatures, designated verifier signatures as well.

Metadata

Available format(s): PDF
Category: Public-key cryptography
Publication info: Preprint.
History: 2004-01-09: last updated; 2004-01-09: published
Short URL: https://ia.cr/2004/005
License: https://creativecommons.org/licenses/by/4.0/

BibTeX

@misc{cryptoeprint:2004/005,
      author = {Huafei Zhu},
      title = {Universal Undeniable Signatures},
      howpublished = {Cryptology {ePrint} Archive, Paper 2004/005},
      year = {2004},
      url = {https://eprint.iacr.org/2004/005}
}