An improved multi-stage secret sharing scheme based on the factorization problem

Ting Yi Chang, Min Shiang Hwang, Wei Pang Yang

Research output: Contribution to journalArticle

12 Citations (Scopus)

Abstract

Lee and Hwang proposed a multi-stage (t, n) secret sharing scheme which has fewer public values than pervious schemes. In their scheme, a group of participants share multiple secrets stage-by-stage, and only one secret share should been kept by each participant. However, in this article, we will show that multiple secrets cannot, in fact, be reconstructed stage-by-stage by the secret holder's determination and that the secret holder cannot determine the values of the secrets in Lee and Hwang's scheme. Moreover, their scheme belongs to the family of one-time-use schemes. At the same time, we shall also modify their scheme to improve the above weaknesses and show the improved scheme can be applied. The security of the proposed scheme is based on the factorization problem which provides higher security confidenc than using the hash function in Harn's and Chang et al.'s multi-stage secret sharing schemes.

Original languageEnglish
Pages (from-to)246-251
Number of pages6
JournalInformation Technology and Control
Volume40
Issue number3
DOIs
Publication statusPublished - 2011 Jan 1

Fingerprint

Hash functions
Factorization

All Science Journal Classification (ASJC) codes

  • Control and Systems Engineering
  • Computer Science Applications
  • Electrical and Electronic Engineering

Cite this

@article{a6e467c3626a42159c940020a6cce017,
title = "An improved multi-stage secret sharing scheme based on the factorization problem",
abstract = "Lee and Hwang proposed a multi-stage (t, n) secret sharing scheme which has fewer public values than pervious schemes. In their scheme, a group of participants share multiple secrets stage-by-stage, and only one secret share should been kept by each participant. However, in this article, we will show that multiple secrets cannot, in fact, be reconstructed stage-by-stage by the secret holder's determination and that the secret holder cannot determine the values of the secrets in Lee and Hwang's scheme. Moreover, their scheme belongs to the family of one-time-use schemes. At the same time, we shall also modify their scheme to improve the above weaknesses and show the improved scheme can be applied. The security of the proposed scheme is based on the factorization problem which provides higher security confidenc than using the hash function in Harn's and Chang et al.'s multi-stage secret sharing schemes.",
author = "Chang, {Ting Yi} and Hwang, {Min Shiang} and Yang, {Wei Pang}",
year = "2011",
month = "1",
day = "1",
doi = "10.5755/j01.itc.40.3.633",
language = "English",
volume = "40",
pages = "246--251",
journal = "Information Technology and Control",
issn = "1392-124X",
publisher = "Kauno Technologijos Universitetas",
number = "3",

}

An improved multi-stage secret sharing scheme based on the factorization problem. / Chang, Ting Yi; Hwang, Min Shiang; Yang, Wei Pang.

In: Information Technology and Control, Vol. 40, No. 3, 01.01.2011, p. 246-251.

Research output: Contribution to journalArticle

TY - JOUR

T1 - An improved multi-stage secret sharing scheme based on the factorization problem

AU - Chang, Ting Yi

AU - Hwang, Min Shiang

AU - Yang, Wei Pang

PY - 2011/1/1

Y1 - 2011/1/1

N2 - Lee and Hwang proposed a multi-stage (t, n) secret sharing scheme which has fewer public values than pervious schemes. In their scheme, a group of participants share multiple secrets stage-by-stage, and only one secret share should been kept by each participant. However, in this article, we will show that multiple secrets cannot, in fact, be reconstructed stage-by-stage by the secret holder's determination and that the secret holder cannot determine the values of the secrets in Lee and Hwang's scheme. Moreover, their scheme belongs to the family of one-time-use schemes. At the same time, we shall also modify their scheme to improve the above weaknesses and show the improved scheme can be applied. The security of the proposed scheme is based on the factorization problem which provides higher security confidenc than using the hash function in Harn's and Chang et al.'s multi-stage secret sharing schemes.

AB - Lee and Hwang proposed a multi-stage (t, n) secret sharing scheme which has fewer public values than pervious schemes. In their scheme, a group of participants share multiple secrets stage-by-stage, and only one secret share should been kept by each participant. However, in this article, we will show that multiple secrets cannot, in fact, be reconstructed stage-by-stage by the secret holder's determination and that the secret holder cannot determine the values of the secrets in Lee and Hwang's scheme. Moreover, their scheme belongs to the family of one-time-use schemes. At the same time, we shall also modify their scheme to improve the above weaknesses and show the improved scheme can be applied. The security of the proposed scheme is based on the factorization problem which provides higher security confidenc than using the hash function in Harn's and Chang et al.'s multi-stage secret sharing schemes.

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

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

U2 - 10.5755/j01.itc.40.3.633

DO - 10.5755/j01.itc.40.3.633

M3 - Article

AN - SCOPUS:80053376336

VL - 40

SP - 246

EP - 251

JO - Information Technology and Control

JF - Information Technology and Control

SN - 1392-124X

IS - 3

ER -