標題: | A share assignment method to maximize the probability of secret sharing reconstruction under the Internet |
作者: | Lee, CY Yeh, YS Chen, DJ Ku, KL 資訊科學與工程研究所 Institute of Computer Science and Engineering |
關鍵字: | Internet;secret sharing;graph theory;spanning tree;factoring;network reduction;probability |
公開日期: | 1-二月-2000 |
摘要: | 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. |
URI: | http://hdl.handle.net/11536/30780 |
ISSN: | 0916-8532 |
期刊: | IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS |
Volume: | E83D |
Issue: | 2 |
起始頁: | 190 |
結束頁: | 199 |
顯示於類別: | 期刊論文 |