Interactive Bi-proof Systems and Undeniable Signature Schemes

Atsushi FUJIOKA  Tatsuaki OKAMOTO  Kazuo OHTA  

IEICE TRANSACTIONS on Information and Systems   Vol.E75-D   No.1   pp.102-109
Publication Date: 1992/01/25
Online ISSN: 
Print ISSN: 0916-8532
Type of Manuscript: Special Section PAPER (Special Section on Theoretical Foundations of Computing)
interactive proof system,  random self-reducibility,  minimum knowledgeness,  digital signature,  

Full Text: PDF(644.7KB)>>
Buy this Article

This paper proposes a new construction of the minimum knowledge undeniable signature scheme which solves a problem inherent in Chaum's scheme. We formulate a new proof system, the minimum knowledge interactive bi-proof system, and a pair of languages, the common witness problem, based on the random self-reducible problem. We show that any common witness problem has the minimum knowledge interactive bi-proof system. A practical construction for undeniable signature schemes is proposed based on such a proof system. These schemes provide signature confirmation and disavowal with the same protocol (or at the same time).