## CryptoDB

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

Authors: Wenbo Mao URL: http://eprint.iacr.org/2001/011 Search ePrint Search Google 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.
##### BibTeX
@misc{eprint-2001-11423,
title={New Zero-knowledge Undeniable Signatures - Forgery of Signature Equivalent to Factorisation},
booktitle={IACR Eprint archive},
keywords={public-key cryptography / Undeniable signatures, Efficient zero-knowledge protocols},
url={http://eprint.iacr.org/2001/011},
note={submitted wm@hplb.hpl.hp.com 11381 received 15 Feb 2001, revised 15 Feb 2001, revised 19 Feb 2001, revised 28 Feb 2001, revised 28 Feb 2001},
author={Wenbo Mao},
year=2001
}