We study the problem of secure communication tolerating generalized mixed adversaries across an underlying completely asynchronous incomplete network. We explore the interplay between the minimal network connectivity required and the degree of security attainable, and completely characterize the network requirements for attaining perfect and unconditional (with negligible error) security. We al...

E cient ID based key sharing schemes are desired world widely for secure communica tions on Internet and other networks The Key Predistiribution Systems KPS are a large class of such key sharing schemes The remarkable property of KPS is that in order to share the key a participant should only input its partner s identi er to its secret KPS algorithm Although it has a lot of advantages in terms ...

We consider anonymous secure communication, where parties not only wish to conceal their communications from outside observers, but also wish to conceal the very fact that they are communicating. We consider the bus framework introduced by Beimel and Dolev [2], where messages are delivered by a bus traveling on a random walk. We generalize this idea to consider more than one bus. We show that i...

This report discusses the possibility of creating meaningful security metrics for communication systems. In particular, we examine security metrics from an axiomatic standpoint and prove that it is not possible to measure trust in an absolute sense. We do not conclude that it is impossible to create a secure communication system; rather we argue that it is impossible to detect the occurrence. W...

This paper deals with the design of a multiple secure communication system based on chaos. And its main idea is to use the left inversion theory. A simple example for a given 4D-chaotic system is presented to highlight the proposed method.

Implementing a security policy has to cope with the diversity of communication requirements and applications. We present a policy oriented approach from the observation of common problems and characteristics given in networked applications. The solution reduces the trust required into the security system to a single entity. This is done in an application independent manner by fooling the applic...

In this paper we proposed perfectly secure message transmission for reliable and secure communications in order to ensure that an adversary cannot obtain information (in the information theoretic sense) about messages. There are numerous studies about the interplay of network connectivity and perfectly secure message transmission under a Byzantine adversary capable of corrupting up to t players...

We derive the bounds of the mean queue length of an infinite phase size BMAP/M/1 queue which has anM/M/∞-type phase transition, and use them to evaluate the performance of secure group communication. Secure communication inside a groups on an open network is critical to enhance the internet capability. Extending the usual matrix analysis to the operator analysis, we derive a new estimation of t...

the contact between major settlements in the central plateau of iran, especially in desert areas, was not possible without having a secure communication system. in this regard, designing communication networks through constructing secure roads with halfway caravansarais in desert areas, usually without secure underground and surface water supply, needed special insights and provisions. iranians...