A Share Assignment Method to Maximize the Probability of Secret Sharing Reconstruction under the Internet

Ching-Yun LEE
Yi-Shiung YEH
Deng-Jyi CHEN
Kuo-Lung KU

IEICE TRANSACTIONS on Information and Systems   Vol.E83-D    No.2    pp.190-199
Publication Date: 2000/02/25
Online ISSN: 
Print ISSN: 0916-8532
Type of Manuscript: PAPER
Category: Applications of Information Security Techniques
internet,  secret sharing,  graph theory,  spanning tree,  factoring,  network reduction,  probability,  

Full Text: PDF(868.1KB)>>
Buy this Article

The use of Internet for various business applications and resource sharing has grown tremendously over the last few years. Internet security has become an important issue for both academic and industrial sectors. Much related network security research has been conducted such as user authentication, data confidentiality, and data integrity. In some applications, a critical document can be divided into pieces and allocated in different locations over the Internet for security access concern. To access such an important document, one must reconstruct the divided pieces from different locations under the given Internet environment. In this paper, a probability model for reconstructing secret sharing and algorithms to perform share assignment are presented. Also, an evaluation algorithm to measure the probability of secret sharing reconstruction is proposed. Illustrative examples and simulation results are provided to demonstrate the applicability of our method.

open access publishing via