An improvement on the Lin-Wu (t,n) threshold verifiable multi-secret sharing scheme

Ting-Yi  Chang, Min Shiang Hwang, Wei Pang Yang

Research output: Contribution to journalArticle

42 Citations (Scopus)

Abstract

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.

Original languageEnglish
Pages (from-to)169-178
Number of pages10
JournalApplied Mathematics and Computation
Volume163
Issue number1
DOIs
Publication statusPublished - 2005 Apr 5

Fingerprint

Secret Sharing Scheme
Factorization
Computational complexity
Composite materials
Digit
Discrete Logarithm
Efficient Solution
Modulo
Computational Complexity
Composite

All Science Journal Classification (ASJC) codes

  • Computational Mathematics
  • Applied Mathematics

Cite this

@article{d01cee8001024a239aec1fdd3a4b0d61,
title = "An improvement on the Lin-Wu (t,n) threshold verifiable multi-secret sharing scheme",
abstract = "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.",
author = "Ting-Yi  Chang and Hwang, {Min Shiang} and Yang, {Wei Pang}",
year = "2005",
month = "4",
day = "5",
doi = "10.1016/j.amc.2004.01.029",
language = "English",
volume = "163",
pages = "169--178",
journal = "Applied Mathematics and Computation",
issn = "0096-3003",
publisher = "Elsevier Inc.",
number = "1",

}

An improvement on the Lin-Wu (t,n) threshold verifiable multi-secret sharing scheme. / Chang, Ting-Yi ; Hwang, Min Shiang; Yang, Wei Pang.

In: Applied Mathematics and Computation, Vol. 163, No. 1, 05.04.2005, p. 169-178.

Research output: Contribution to journalArticle

TY - JOUR

T1 - An improvement on the Lin-Wu (t,n) threshold verifiable multi-secret sharing scheme

AU - Chang, Ting-Yi 

AU - Hwang, Min Shiang

AU - Yang, Wei Pang

PY - 2005/4/5

Y1 - 2005/4/5

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=12444344892&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=12444344892&partnerID=8YFLogxK

U2 - 10.1016/j.amc.2004.01.029

DO - 10.1016/j.amc.2004.01.029

M3 - Article

AN - SCOPUS:12444344892

VL - 163

SP - 169

EP - 178

JO - Applied Mathematics and Computation

JF - Applied Mathematics and Computation

SN - 0096-3003

IS - 1

ER -