Abstract: A computer system is adapted to predict the likelihood, temporal (or developmental) state, possible location(s), rate of spread or “infectiousness”, etc. of a potential epidemic. A wide and diverse range of inputs and associated parameters are inputted into the system some of which may be statistically correlatable with certain hidden states including those which are temporally oriented disease stages of progression as well as other types of attributes. A Dynamic Bayesian Belief Network or other adaptive or machine learning method is used for the probabilistic analysis. The system statistically analyzes and reanalyzes the totality of all recently updated information (and within the context of all past information), as can efficiently be modeled by the Dynamic Bayesian Belief Network or other adaptive or machine learning method to provide updated predictions and to suggest a recommended reactive protocol to an epidemic.

Abstract: A system for exchanging data includes a communication system, a first and a second party connected to the communication system, wherein each party has personal data, and each party has a disclosure policy to control dissemination of its data, and a secure intermediate party connected to the communication system, wherein the secure intermediate party exchanges data between the first and second parties in accordance with their respective disclosure policies.

Abstract: A secure data interchange system enables information about bilateral and multilateral interactions between multiple persistent parties to be exchanged and leveraged within an environment that uses a combination of techniques to control access to information, release of information, and matching of information back to parties. Access to data records can be controlled using an associated price rule. A data owner can specify a price for different types and amounts of information access.

Abstract: An encryption scheme that uses steganography includes an encryption algorithm that encrypts messages by embedding them in a data stream in such a way that an adversary cannot get information about the messages. Since the embedding is the only computation required, this scheme is optimal in computational efficiency. However, since the size of the data stream is large, this scheme is most beneficial when the cost of bandwidth is less expensive than the cost of computation. The scheme embeds the message as specified by a pseudo random generator.

Abstract: We propose a multi user information theoretically secure scheme. Our scheme allows any two parties in a multi user system to exchange messages securely using encryption, and to sign messages. Our scheme achieves a significant saving in the number of total keys in the system and in the keys each user must store. The encryption, and signing algorithms proposed in the scheme are as efficient as possible. Our scheme is designed so that it is possible to easily and efficiently revoke and add membership of new users into the system. It is also designed so that authentication and security against man in the middle attacks can be added at low cost. In addition, we introduce a novel and efficient way to use steganography for key replenishment.

Abstract: Similarity between the distinct documents/programs is determined by comparing their respective control flow or other labeled transition graphs. The determination of similarity involves creating a combined measure of similarity based in part on a measure of local similarity between the graphs and in part on a measure of step similarity between the graphs. Local and step similarity are computed conventionally. A linear programming problem involving the local and step similarity measures is formulated and solved conventionally to yield an overall similarity score representing similarity of the graphs as wholes. The score is compared to a predetermined threshold and an alert is issued if the score exceeds the threshold. The alert allows for further action, such as further examination of a particular computer program if it is believed to be a possible virus in view of a high similarity score resulting from comparison to a known computer virus.

Abstract: We propose a multi user information theoretically secure scheme. Our scheme allows any two parties in a multi user system to exchange messages securely using encryption, and to sign messages. Our scheme achieves a significant saving in the number of total keys in the system and in the keys each user must store. The encryption, and signing algorithms proposed in the scheme are as efficient as possible. Our scheme is designed so that it is possible to easily and efficiently revoke and add membership of new users into the system. It is also designed so that authentication and security against man in the middle attacks can be added at low cost. In addition, we introduce a novel and efficient way to use steganography for key replenishment.

Abstract: We propose an encryption scheme which uses steganography. The encryption algorithm encrypts messages by embedding them in a data stream in such a way that an adversary cannot get information about the messages. Since the embedding is the only computation requires this scheme is optimal in computational efficiency. However, since the size of the data stream is large, this scheme is most beneficial when the cost of bandwidth is less expensive than the cost of computation. The scheme embeds the message as specified by a pseudo random generator. Therefore, the scheme's security is based on a new weak assumption base on the pseudo random generator which we introduce.