[Resource Topic] 2004/005: Universal Undeniable Signatures

Welcome to the resource topic for 2004/005

Universal Undeniable Signatures

Authors: 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.

ePrint: https://eprint.iacr.org/2004/005

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .