Dynamic security.
Item
-
Title
-
Dynamic security.
-
Identifier
-
AAI9119620
-
identifier
-
9119620
-
Creator
-
Chung, Ilyong.
-
Contributor
-
Adviser: Michael Anshel
-
Date
-
1991
-
Language
-
English
-
Publisher
-
City University of New York.
-
Subject
-
Computer Science
-
Abstract
-
Data security can be divided into two categories--static security and dynamic security. Static security is the security of the data itself and dynamic security is the security of the route for the data transmitted. If the route is detected by an adversary, it is very likely that the data will be intercepted. Therefore, the route must be protected. To accomplish this, we select an intermediate node secretly and transmit the data using this intermediate node, instead of sending the data to the destination node using the shortest direct path. The above route consisting of two paths--a path from the source to the intermediate node and a path from that intermediate node to the destination--is called a secret route. Furthermore, if we use a number of secret routes from the source to the destination, data security is much stronger since we can transmit partial data rather than the entire data along a secret route. To employ the above idea, the data is dispersed into a number of pieces. In this thesis, the data is dispersed into n pieces using the technique of information dispersal called the dispersal algorithm using the FFT algorithm (DAF).;We choose the n-dimensional hypercube network as the network model for transmission of the data. Each piece is transmitted to the destination along its own secret route in the n-dimensional hypercube network. In order for all the pieces to reach the destination node in the minimum possible time, all the routes should be disjoint. We show how to construct a set of disjoint paths from the starting to intermediate nodes by employing the modified no same-entry matrix (MNSEM) and then show how to construct a set of disjoint paths from these intermediate nodes to the destination by employing the partial Hamiltonian circuit latin square (PHCLS). Later, this idea is extended to secret routing algorithm for the mixed radix number system (MRNS) network.
-
Type
-
dissertation
-
Source
-
PQT Legacy CUNY.xlsx
-
degree
-
Ph.D.
