CLC number: TP309
On-line Access: 2024-08-27
Received: 2023-10-17
Revision Accepted: 2024-05-08
Crosschecked: 0000-00-00
Cited: 3
Clicked: 10049
XIE Qi, YU Xiu-yuan. Improvement of Laih and Yen's multisignature scheme[J]. Journal of Zhejiang University Science A, 2004, 5(9): 1155-1159.
@article{title="Improvement of Laih and Yen's multisignature scheme",
author="XIE Qi, YU Xiu-yuan",
journal="Journal of Zhejiang University Science A",
volume="5",
number="9",
pages="1155-1159",
year="2004",
publisher="Zhejiang University Press & Springer",
doi="10.1631/jzus.2004.1155"
}
%0 Journal Article
%T Improvement of Laih and Yen's multisignature scheme
%A XIE Qi
%A YU Xiu-yuan
%J Journal of Zhejiang University SCIENCE A
%V 5
%N 9
%P 1155-1159
%@ 1869-1951
%D 2004
%I Zhejiang University Press & Springer
%DOI 10.1631/jzus.2004.1155
TY - JOUR
T1 - Improvement of Laih and Yen's multisignature scheme
A1 - XIE Qi
A1 - YU Xiu-yuan
J0 - Journal of Zhejiang University Science A
VL - 5
IS - 9
SP - 1155
EP - 1159
%@ 1869-1951
Y1 - 2004
PB - Zhejiang University Press & Springer
ER -
DOI - 10.1631/jzus.2004.1155
Abstract: A new attack is proposed to show that a specified group of verifiers can cooperate to forge the signature for any message by secret key substitution due to the leaked secret key or by the group public key adjustment because of the renewed members. This paper presents the improvement scheme which overcomes the security weakness of Laih and Yen’s scheme.
[1] Harn, L., Kiesler, T., 1989. New scheme for digital multisignature. Electron. Lett., 25(15):1002-1003.
[2] He, W.H., 2002. Weakness in some multisignature for specified group of verifiers. Information Processing Letters, 83(2002):95-99.
[3] Itakura, K., Nakamura, K., 1983. A public-key cryptosystem suitable for digital multisignatures. NEC Res. Development, 71(1983):1-8.
[4] Laih, C.S., Yen, S.M., 1996. Multisignature for specified group of verifiers. J. Inform. Sci. Engrg., 12(1):143-152.
[5] Lin, C.C., Laih, C.S., 2000. Cryptanalysis of Nyberg-Rueppel’s message recovery scheme. IEEE Communication Letters, 4(7):231-232
[6] Nyberg, K., Rueppel, R.A., 1994. Message Recovery for Signature Schemes Based on the Discrete Logarithm Problem. EUROCRYPT’94, p.182-193.
[7] Ohta, K., Okamoto, T., 1991. A Digital Multisinature Scheme Based on the Fiat-Shamir Scheme. Proceedings ASIACRYPY’91, p.139-148.
Open peer comments: Debate/Discuss/Question/Opinion
<1>
Abhijit Nayak@Undergraduate<abhijit623@gmail.com>
2014-04-07 21:00:02
i want to read this paper
Yang Haomiao@University of Electronic Science and Technology of China<haomyang@uestc.edu.cn>
2011-06-09 11:24:22
My major is information security and Cryptography. I look forward to study the paper.