New Zero-knowledge Undeniable Signatures

[摘要] 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. 16 Pages

[发布机构] HP Development Company

[学科分类] 计算机科学（综合）

[关键词] undeniable signatures;efficient zero-knowledge protocols