Secure Convertible Undeniable Signature Scheme Using Extended Euclidean Algorithm without Random Oracles

• Shi-Jinn Horng,
• Shiang-Feng Tzeng,
• Pingzhi Fan,
• Xian Wang,
• Tianrui Li,
• Muhammad Khurram Khan,

Vol. 7, No. 6, June 25, 2013
10.3837/tiis.2013.06.010, Download Paper (Free):

• Convertible
• Extended euclidean algorithm
• Random Oracle
• undeniable signature.

Abstract

A convertible undeniable signature requires a verifier to interact with the signer to verify a signature and furthermore allows the signer to convert a valid one to publicly verifiable signature. In 2007, Yuen et al. proposed a convertible undeniable signature without random oracles in pairings. However, it is recently shown that Yuen et al.’s scheme is not invisible for the standard definition of invisibility. In this paper, we propose a new improvement by using extended Euclidean algorithm that can overcome the visibility attack. The proposed scheme has been evaluated based on computation and communication complexities and the performance comparisons of Yuen et al.’s scheme and various convertible undeniable signature schemes are provided. Moreover, it has been observed that the proposed algorithm reduces the computation and communication times significantly.

Statistics

Cite this article