Efficient On-Line Secret Sharing scheme based on One-way Hash Function


The Transactions of the Korea Information Processing Society (1994 ~ 2000), Vol. 7, No. 10, pp. 3128-3137, Oct. 2000
10.3745/KIPSTE.2000.7.10.3128,   PDF Download:

Abstract

Secret sharing scheme is a cryptographic protocol in which a dealer distributes shares of a secret among a set of participants such that only authorized set of participants can recover the secret at a later. Secret sharing is an important cryptographic primitive in management of secret information, secure multiparty protocol and group-oriented cryptography, etc. In this paper, we propose an efficient, on-line secret sharing scheme based on one-way hash function. This scheme provides the property to share multiple secrets and allows participants to be added/deleted dynamically, without having to redistribute new shares. Proposed scheme has advantage to detect cheating and identify of all cheater, regardless of then number. Furthermore, it is more efficient than previous schemes.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
S. J. Kim, D. H. Won, S. H. Oh, "Efficient On-Line Secret Sharing scheme based on One-way Hash Function," The Transactions of the Korea Information Processing Society (1994 ~ 2000), vol. 7, no. 10, pp. 3128-3137, 2000. DOI: 10.3745/KIPSTE.2000.7.10.3128.

[ACM Style]
Seung Joo Kim, Dong Ho Won, and Soo Hyun Oh. 2000. Efficient On-Line Secret Sharing scheme based on One-way Hash Function. The Transactions of the Korea Information Processing Society (1994 ~ 2000), 7, 10, (2000), 3128-3137. DOI: 10.3745/KIPSTE.2000.7.10.3128.