A unified approach to secret sharing schemes with low distribution cost

Hung Yu Chien, Jinn Ke Jan, Yuh-Min Tseng

Research output: Contribution to journalArticle

8 Citations (Scopus)

Abstract

In secret sharing schemes, the secret holder has to distribute secret shares to each participant before distributing the secrets. To distribute or redistribute shares is a very costly process with respect to both time and resources. Unlike previous works, where different approaches are proposed for different scenarios, we propose a unified approach for both threshold-based schemes and generalized group-oriented cryptosystems. This unified implementation has the following merits: (1) With a unified approach, the implementation requires much less overhead than its counterparts when various secret sharing problems are simultaneously involved; (2) The Secret Holder (SD) does not need to redistribute new secret shares after the secret reconstruction; (3) The SD can, dynamically and efficiently, determine the capacities (weight) of each user on recovering the secrets, and the threshold values of the secrets; (4) To dynamically adjust the capacities of users, the SD does not need to refresh the shadow of each user and each user just memorizes one secret shadow.

Original languageEnglish
Pages (from-to)723-733
Number of pages11
JournalJournal of the Chinese Institute of Engineers, Transactions of the Chinese Institute of Engineers,Series A/Chung-kuo Kung Ch'eng Hsuch K'an
Volume25
Issue number6
DOIs
Publication statusPublished - 2002 Jan 1

Fingerprint

Cryptography
Costs

All Science Journal Classification (ASJC) codes

  • Engineering(all)

Cite this

@article{7e97e134539e47fe87e0a990cec88e4e,
title = "A unified approach to secret sharing schemes with low distribution cost",
abstract = "In secret sharing schemes, the secret holder has to distribute secret shares to each participant before distributing the secrets. To distribute or redistribute shares is a very costly process with respect to both time and resources. Unlike previous works, where different approaches are proposed for different scenarios, we propose a unified approach for both threshold-based schemes and generalized group-oriented cryptosystems. This unified implementation has the following merits: (1) With a unified approach, the implementation requires much less overhead than its counterparts when various secret sharing problems are simultaneously involved; (2) The Secret Holder (SD) does not need to redistribute new secret shares after the secret reconstruction; (3) The SD can, dynamically and efficiently, determine the capacities (weight) of each user on recovering the secrets, and the threshold values of the secrets; (4) To dynamically adjust the capacities of users, the SD does not need to refresh the shadow of each user and each user just memorizes one secret shadow.",
author = "Chien, {Hung Yu} and Jan, {Jinn Ke} and Yuh-Min Tseng",
year = "2002",
month = "1",
day = "1",
doi = "10.1080/02533839.2002.9670746",
language = "English",
volume = "25",
pages = "723--733",
journal = "Chung-kuo Kung Ch'eng Hsueh K'an/Journal of the Chinese Institute of Engineers",
issn = "0253-3839",
publisher = "Chinese Institute of Engineers",
number = "6",

}

TY - JOUR

T1 - A unified approach to secret sharing schemes with low distribution cost

AU - Chien, Hung Yu

AU - Jan, Jinn Ke

AU - Tseng, Yuh-Min

PY - 2002/1/1

Y1 - 2002/1/1

N2 - In secret sharing schemes, the secret holder has to distribute secret shares to each participant before distributing the secrets. To distribute or redistribute shares is a very costly process with respect to both time and resources. Unlike previous works, where different approaches are proposed for different scenarios, we propose a unified approach for both threshold-based schemes and generalized group-oriented cryptosystems. This unified implementation has the following merits: (1) With a unified approach, the implementation requires much less overhead than its counterparts when various secret sharing problems are simultaneously involved; (2) The Secret Holder (SD) does not need to redistribute new secret shares after the secret reconstruction; (3) The SD can, dynamically and efficiently, determine the capacities (weight) of each user on recovering the secrets, and the threshold values of the secrets; (4) To dynamically adjust the capacities of users, the SD does not need to refresh the shadow of each user and each user just memorizes one secret shadow.

AB - In secret sharing schemes, the secret holder has to distribute secret shares to each participant before distributing the secrets. To distribute or redistribute shares is a very costly process with respect to both time and resources. Unlike previous works, where different approaches are proposed for different scenarios, we propose a unified approach for both threshold-based schemes and generalized group-oriented cryptosystems. This unified implementation has the following merits: (1) With a unified approach, the implementation requires much less overhead than its counterparts when various secret sharing problems are simultaneously involved; (2) The Secret Holder (SD) does not need to redistribute new secret shares after the secret reconstruction; (3) The SD can, dynamically and efficiently, determine the capacities (weight) of each user on recovering the secrets, and the threshold values of the secrets; (4) To dynamically adjust the capacities of users, the SD does not need to refresh the shadow of each user and each user just memorizes one secret shadow.

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

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

U2 - 10.1080/02533839.2002.9670746

DO - 10.1080/02533839.2002.9670746

M3 - Article

AN - SCOPUS:0036853884

VL - 25

SP - 723

EP - 733

JO - Chung-kuo Kung Ch'eng Hsueh K'an/Journal of the Chinese Institute of Engineers

JF - Chung-kuo Kung Ch'eng Hsueh K'an/Journal of the Chinese Institute of Engineers

SN - 0253-3839

IS - 6

ER -