完整後設資料紀錄
DC 欄位 | 值 | 語言 |
---|---|---|
dc.contributor.author | Lee, CY | en_US |
dc.contributor.author | Yeh, YS | en_US |
dc.contributor.author | Chen, DJ | en_US |
dc.contributor.author | Ku, KL | en_US |
dc.date.accessioned | 2014-12-08T15:27:20Z | - |
dc.date.available | 2014-12-08T15:27:20Z | - |
dc.date.issued | 1998 | en_US |
dc.identifier.isbn | 0-8186-8603-0 | en_US |
dc.identifier.uri | http://hdl.handle.net/11536/19595 | - |
dc.description.abstract | The use of Internet for various business applications and resource sharing has grown tremendously over the last few years. In some applications, an important document may be required to be divided into pieces and be allocated in different locations over the Internet for security access concern. For example, an important map that can be used to access a military base, an important key that can be used to give a military order or command. To access such an important document, one must reconstruct the divided pieces from different locations. In this paper, a probability model for reconstructing the secret sharing under the Internet is proposed. Also, how to assign the divided shares into different locations is studied. Particularly, algorithms to perform share assignment and to reconstruct the divided pieces into the original secret are proposed. | en_US |
dc.language.iso | en_US | en_US |
dc.title | A share assignment method to maximize the probability of secret sharing reconstruction under the Internet | en_US |
dc.type | Proceedings Paper | en_US |
dc.identifier.journal | 1998 INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED SYSTEMS, PROCEEDINGS | en_US |
dc.citation.spage | 469 | en_US |
dc.citation.epage | 477 | en_US |
dc.contributor.department | 資訊科學與工程研究所 | zh_TW |
dc.contributor.department | Institute of Computer Science and Engineering | en_US |
dc.identifier.wosnumber | WOS:000078318400058 | - |
顯示於類別: | 會議論文 |