The Research of RSA-Based Undeniable Signature Method

In order to resolve the problem of the non-repudiation of digital signatures, this paper analyzes the RSA signature scheme and the undeniable signature scheme, based on this an improved undeniable signature algorithm and the confirmation protocol using the legitimacy of the signature verification key validation is proposed. Experiments show that the method can ensure non-repudiation of digital signatures to achieve a secure exchange of documents promising security technologies.

[1]  Hugo Krawczyk,et al.  RSA-Based Undeniable Signatures , 1997, Journal of Cryptology.

[2]  Hugo Krawczyk,et al.  RSA-Based Undeniable Signatures , 2007, Journal of Cryptology.

[3]  Michael Wiener,et al.  Advances in Cryptology — CRYPTO’ 99 , 1999 .

[4]  A. Selkirk.  XML and Security , 2001 .

[5]  Wang Hua-xian.  Principle of XML digital signatures and the implementation in EC , 2006 .

[6]  David Chaum,et al.  Zero-Knowledge Undeniable Signatures , 1991, EUROCRYPT.

[7]  Takeru Miyazaki.  An Improved Scheme of the Gennaro-Krawczyk-Rabin Undeniable Signature System Based on RSA , 2000, ICISC.

[8]  Mark Bartel,et al.  Xml-Signature Syntax and Processing , 2000 .

[9]  Blake Dournaee,et al.  XML Security , 2002 .

[10]  David Chaum,et al.  Undeniable Signatures , 1989, CRYPTO.

[11]  Ivan Bjerre Damgård,et al.  Advances in Cryptology — EUROCRYPT ’90 , 2001, Lecture Notes in Computer Science.

[12]  Yan Li,et al.  XML undeniable signatures , 2005, International Conference on Computational Intelligence for Modelling, Control and Automation and International Conference on Intelligent Agents, Web Technologies and Internet Commerce (CIMCA-IAWTIC'06).

[13]  Hugo Krawczyk,et al.  Robust and Efficient Sharing of RSA Functions , 1996, CRYPTO.

[14]  Neal Koblitz,et al.  Advances in Cryptology — CRYPTO ’96 , 2001, Lecture Notes in Computer Science.