International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Universal Undeniable Signatures

Authors:
Huafei Zhu
Download:
URL: http://eprint.iacr.org/2004/005
Search ePrint
Search Google
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.
BibTeX
@misc{eprint-2004-11981,
  title={Universal Undeniable Signatures},
  booktitle={IACR Eprint archive},
  keywords={public-key cryptography /},
  url={http://eprint.iacr.org/2004/005},
  note={new report huafei@i2r.a-star.edu.sg 12425 received 8 Jan 2004},
  author={Huafei Zhu},
  year=2004
}