Full metadata record
DC FieldValueLanguage
dc.contributor.authorLee, CYen_US
dc.contributor.authorYeh, YSen_US
dc.contributor.authorChen, DJen_US
dc.contributor.authorKu, KLen_US
dc.date.accessioned2014-12-08T15:27:20Z-
dc.date.available2014-12-08T15:27:20Z-
dc.date.issued1998en_US
dc.identifier.isbn0-8186-8603-0en_US
dc.identifier.urihttp://hdl.handle.net/11536/19595-
dc.description.abstractThe 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.isoen_USen_US
dc.titleA share assignment method to maximize the probability of secret sharing reconstruction under the Interneten_US
dc.typeProceedings Paperen_US
dc.identifier.journal1998 INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED SYSTEMS, PROCEEDINGSen_US
dc.citation.spage469en_US
dc.citation.epage477en_US
dc.contributor.department資訊科學與工程研究所zh_TW
dc.contributor.departmentInstitute of Computer Science and Engineeringen_US
dc.identifier.wosnumberWOS:000078318400058-
Appears in Collections:Conferences Paper