An improvement on the Lin-Wu (t, n) threshold verifiable multi-secret sharing scheme
檔案
- 000227044000016.pdf (193.7 KB, Adobe PDF)
日期
2005-04-05
類型
系所
期刊名稱
APPLIED MATHEMATICS AND COMPUTATION
卷期與頁次
第 163 卷第 1 期,頁 169–178
ISSN
0096-3003
語言
英文
摘要
Lin and Wu [IEE Proc. Comput. Digit. Tech. 146 (1999) 264] have proposed an efficient (t, n) threshold verifiable multi-secret sharing (VMSS) scheme based on the factorization problem and the discrete logarithm modulo a large composite problem. In their scheme, the dealer can arbitrarily give any set Of multiple secrets to be shared, and only one reusable secret shadow is to be kept by every participant. On the other hand, they have claimed that their scheme can provide an efficient solution to the cheating problems between the dealer and any participant. However, He and Wu [IEE Proc. Comput. Digit. Tech. 148 (2001) 139] have shown that Lin and Wu's scheme is in fact insecure against a cheating participant. In this paper, we shall try to improve the security of Lin and Wu's scheme while providing more efficient performance than other VMSS schemes in terms Of computational complexity. (C) 2004 Elsevier Inc. All rights reserved.
所屬典藏
期刊論文引用此條目
Chang, T., Hwang, M., & Yang, W. (2005). An improvement on the Lin-Wu (t, n) threshold verifiable multi-secret sharing scheme. APPLIED MATHEMATICS AND COMPUTATION, 163(1), 169–178. https://doi.org/10.1016/j.amc.2004.01.029
引用文字依 APA 第 7 版格式自動產生,使用前請再核對。
分享
永久網址:https://ir.lib.nycu.edu.tw/handle/11536/13825