The Transactions of the Korea Information Processing Society (한국정보처리학회논문지)
- Volume 6 Issue 3
- /
- Pages.664-671
- /
- 1999
- /
- 1226-9190(pISSN)
An Efficient ID-Based Multisignature Scheme Based on the High Residuosity Problem
고차잉여류 문제에 기반을 둔 다중서명 방식
- Published : 1999.03.01
Abstract
Itakura and Nakamura proposed the first multisignature scheme based on 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 multsignature scheme which is based on the ElGamal'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
Keywords