Homogeneous faults, colored edge graphs, and cover free families

Authors:
Yongge Wang;Yvo Desmedt
Affiliations:
University of North Carolina at Charlotte;University College London, UK
Venue:
ICITS'11 Proceedings of the 5th international conference on Information theoretic security
Year:
2011

Citing 4
Cited 0

Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Perfectly Secure Message Transmission Revisited

EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology
Radio networks with reliable communication

COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
A complete characterization of tolerable adversary structures for secure point-to-point transmissions without feedback

ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we use the concept of colored edge graphs to model homogeneous faults in networks. We then use this model to study the minimum connectivity (and design) requirements of networks for being robust against homogeneous faults within certain thresholds. In particular, necessary and sufficient conditions for most interesting cases are obtained. For example, we will study the following cases: (1) the number of colors (or the number of non-homogeneous network device types) is one more than the homogeneous fault threshold; (2) there is only one homogeneous fault (i.e., only one color could fail); and (3) the number of non-homogeneous network device types is less than five.