• KSII Transactions on Internet and Information Systems
    Monthly Online Journal (eISSN: 1976-7277)

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


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

Show / Hide Statistics

Statistics (Cumulative Counts from December 1st, 2015)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article

[IEEE Style]
S. Horng, S. Tzeng, P. Fan, X. Wang, T. Li and M. K. Khan, "Secure Convertible Undeniable Signature Scheme Using Extended Euclidean Algorithm without Random Oracles," KSII Transactions on Internet and Information Systems, vol. 7, no. 6, pp. 1512-1532, 2013. DOI: 10.3837/tiis.2013.06.010.

[ACM Style]
Shi-Jinn Horng, Shiang-Feng Tzeng, Pingzhi Fan, Xian Wang, Tianrui Li, and Muhammad Khurram Khan. 2013. Secure Convertible Undeniable Signature Scheme Using Extended Euclidean Algorithm without Random Oracles. KSII Transactions on Internet and Information Systems, 7, 6, (2013), 1512-1532. DOI: 10.3837/tiis.2013.06.010.