关键词: 计算机工程, 信息安全, 不可否认签名, 证据不可分辨性, 不可伪造性, 不可扮演性

Abstract: A new RSAbased undeniable signature scheme was proposed which is more efficient because of its 3move confirmation and disavowal protocols. The scheme is convertable and can be converted into the conventional RSA digital signature scheme. The scheme was proved secure against the active and concurrent attacks in the random oracle model. The existential unforgeability of the proposed scheme is equivalent to the computational DiffieHellman problem and its witness indistinguishableness is equivalent to the decisional DiffieHellman problem. Its antiimpersonation ability is equivalent to the discrete logarithm problem.

Key words: computer engineering, information security, undeniable signature, witness indistinguishableness, unforgeability, antiimpersonation ability