Paper 2001/011

New Zero-knowledge Undeniable Signatures - Forgery of Signature Equivalent to Factorisation

Wenbo Mao

Abstract

We propose a new zero-knowledge undeniable signature scheme which is based on the intractability of computing high-order even powers modulo a composite. The new scheme has a number of desirable properties: (i) forgery of a signature (including existential forgery) is proven to be equivalent to factorisation, (ii) perfect zero-knowledge, (iii) efficient protocols for signature verification and non-signature denial: both measured by $O(\log k)$ (multiplications) where $1/k$ bounds the probability of error. For a denial protocol, this performance is unprecedented.

Metadata
Available format(s)
PDF PS
Category
Public-key cryptography
Publication info
Published elsewhere. submitted
Keywords
Undeniable signaturesEfficient zero-knowledge protocols
Contact author(s)
wm @ hplb hpl hp com
History
2001-02-28: last of 3 revisions
2001-02-17: received
See all versions
Short URL
https://ia.cr/2001/011
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2001/011,
      author = {Wenbo Mao},
      title = {New Zero-knowledge Undeniable Signatures - Forgery of Signature Equivalent to Factorisation},
      howpublished = {Cryptology ePrint Archive, Paper 2001/011},
      year = {2001},
      note = {\url{https://eprint.iacr.org/2001/011}},
      url = {https://eprint.iacr.org/2001/011}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.