An Efficient ID-Based Multisignature Scheme Based on the High Residuosity Problem


The Transactions of the Korea Information Processing Society (1994 ~ 2000), Vol. 6, No. 3, pp. 664-671, Mar. 1999
10.3745/KIPSTE.1999.6.3.664,   PDF Download:

Abstract

Itakura and Nakamura proposed the first multisignature scheme based on the RSA signature scheme. But if many users sign on one paper, then their scheme has a reblocking problem. In 1991, Ohta and Okamoto proposed a multisignature scheme by using Fiat-Shamir signature scheme. But in this scheme, the group of signers must generate common random number in the first round, and in the second round, they sign the message with common random number. Also L. Harn proposed a multisignature scheme which is based on the E1Gamal's. In korea, S.D.Kim et al. at ICEIC'95 conference, proposed an efficient sequential multisignature scheme by using the modified Park-Won scheme. This scheme is not require an additional round to generate common random number, and has fixed signature length. In this paper, we analyze problem of Kim's multisignature scheme, and propose a new multisignature scheme based on R(th-) residuosity problem.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
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]
L. B. Young, P. T. Jin, W. D. Ho, "An Efficient ID-Based Multisignature Scheme Based on the High Residuosity Problem," The Transactions of the Korea Information Processing Society (1994 ~ 2000), vol. 6, no. 3, pp. 664-671, 1999. DOI: 10.3745/KIPSTE.1999.6.3.664.

[ACM Style]
Lee Bo Young, Park Taek Jin, and Won Dong Ho. 1999. An Efficient ID-Based Multisignature Scheme Based on the High Residuosity Problem. The Transactions of the Korea Information Processing Society (1994 ~ 2000), 6, 3, (1999), 664-671. DOI: 10.3745/KIPSTE.1999.6.3.664.