Browsing by Author "Ku, KL"

Now showing 1 - 7 of 7

A probability model for reconstructing secret sharing under the internet environment
(1999-06-01)
Lee, CY
;
Yeh, YS
;
Chen, DJ
;
Ku, KL
;
資訊科學與工程研究所
Internet technologies have ushered in a new era for computer-related communications. Use of the Internet for commercial applications and resource sharing has accelerated in recent years as well. Owing to such developments, Internet security has become a critical issue for both academic and commercial sectors. Several studies have focused on areas involving network security such as authentication, privacy, and integrity. In some applications, an important message can be divided into pieces and allocated at several different sites over the Internet for security access concern. For example, an important map that can be used to access a military base, a vital key that can be used to give a military order or command. To access such an important message, one must reconstruct the divided pieces from different sites under the given Internet environment. In this paper, we present a novel probability model for reconstructing secret sharing under the Internet. Also, how to assign the divided shares into different sites over the Internet is studied. Also proposed herein are algorithms to perform shares assignment and to evaluate the probability of reconstructing the divided pieces into the original secret. Illustrative examples and simulation results demonstrate the feasibility of the proposed approach. (C) 1999 Elsevier Science Inc. All rights reserved.
A share assignment method to maximize the probability of secret sharing reconstruction under the Internet
(1998)
Lee, CY
;
Yeh, YS
;
Chen, DJ
;
Ku, KL
;
資訊科學與工程研究所
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.
A share assignment method to maximize the probability of secret sharing reconstruction under the Internet
(2000-02-01)
Lee, CY
;
Yeh, YS
;
Chen, DJ
;
Ku, KL
;
資訊科學與工程研究所
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.
The distributed program reliability analysis on a star topology: Efficient algorithms and approximate solution
(1999-06-01)
Chang, MS
;
Chen, DJ
;
Lin, MS
;
Ku, KL
;
資訊科學與工程研究所
A distributed computing system consists of processing elements, communication links, memory units, data files, and programs. These resources are interconnected via a communication network and controlled by a distributed operating system. The distributed program reliability (DPR) in a distributed computing system is the probability that a program which runs on multiple processing elements and needs to retrieve data files from other processing elements will be executed successfully. This reliability varies according to 1) the topology of the distributed computing system, 2) the reliability of the communication edges, 3) the data files and programs distribution among processing elements, and 4) the data files required to execute a program. In this paper, we show that computing the distributed program reliability on a star distributed computing system is #P-complete. A polynomially solvable case is developed for computing the distributed program reliability when some additional file distribution is restricted on the star topology. We also propose a polynomial time algorithm for computing the distributed program reliability with approximate solutions when the star star topology has no the additional file distribution.
The distributed program reliability analysis on ring-type topologies
(2001-06-01)
Lin, MS
;
Chang, MS
;
Chen, DJ
;
Ku, KL
;
資訊科學與工程研究所
Distributed computing system (DCS) has become very popular for its high fault-tolerance, potential for parallel processing, and better reliability performance. One of the important issues in the design of the DCS is the reliability performance. Distributed program reliability (DPR) is addressed to obtain this reliability measure, In this paper, we propose a polynomial-time algorithm for computing the DPR of ring topology and show that solving the DPR problem on a ring of trees topology is NP-hard. (C) 2001 Elsevier Science Ltd. All rights reserved.
The distributed program reliability analysis on star topologies
(1998)
Chang, MS
;
Chen, DJ
;
Lin, MS
;
Ku, KL
;
資訊科學與工程研究所
In this paper, we show that computing the distributed program reliability on the star distributed computing systems is NP-hard We develop a polynomially solvable case to compute distributed program reliability when some additional file distribution is restricted on the star topology. We also propose a polynomial time algorithm for computing distributed program reliability with approximate solution when the star topology is nor satisfied with the additional file distribution.
The distributed program reliability analysis on star topologies
(2000-02-01)
Chang, MS
;
Chen, DJ
;
Lin, MS
;
Ku, KL
;
資訊科學與工程研究所
A distributed computing system consists of processing elements, communication links, memory units, data files, and programs. These resources are interconnected via a communication network and controlled by a distributed operating system. The distributed program reliability in a distributed computing system is the probability that a program which runs on multiple processing elements and needs to retrieve data files from other processing elements will be executed successfully. This reliability varies according to (1) the topology of the distributed computing system, (2) the reliability of the communication edges, (3) the data files and programs distribution among processing elements, and (4) the data files required to execute a program. In this paper, we show that computing the distributed program reliability on the star distributed computing systems is NP-hard. We also develop an efficiently solvable case to compute distributed program reliability when some additional file distribution is restricted on the star topology.