Paper 2004/005

Universal Undeniable Signatures

Huafei Zhu


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.

Available format(s)
Public-key cryptography
Publication info
Published elsewhere. new report
Contact author(s)
huafei @ i2r a-star edu sg
2004-01-09: received
Short URL
Creative Commons Attribution


      author = {Huafei Zhu},
      title = {Universal Undeniable Signatures},
      howpublished = {Cryptology ePrint Archive, Paper 2004/005},
      year = {2004},
      note = {\url{}},
      url = {}
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.