Hiding role assignment in mission‐critical collaborative systems

SUMMARY In a mission critical collaboration system, a group of roles are assigned to computer nodes connected by a communication network. Role assignment is mission-critical information and needs to be protected. In this paper, we develop methods to effectively and efficiently protect the information of role assignment from traffic analysis, a passive attack. To measure the system security, we introduce a metric of detection probability, defined as the probability that a role assignment can be discovered. A heuristic greedy algorithm is given to minimize the resource consumption while guaranteeing a low detection-probability level. Our performance evaluation shows that the algorithm proposed in this paper performs well in terms of execution time and resource usage compared to an exhaustive search algorithm. We also propose to use additional means (e.g. additional nodes) to further increase the security level of a system at the cost of a mild resource consumption increase. Copyright  2002 John Wiley & Sons, Ltd.

[1]  Richard E. Newman,et al.  Performance analysis of a method for high level prevention of traffic analysis , 1992, [1992] Proceedings Eighth Annual Computer Security Application Conference.

[2]  A. D. Keedwell,et al.  Latin Squares: New Developments in the Theory and Applications , 1991 .

[3]  Riccardo Bettati,et al.  Preventing traffic analysis for real-time communication networks , 1999, MILCOM 1999. IEEE Military Communications. Conference Proceedings (Cat. No.99CH36341).

[4]  Harrick M. Vin,et al.  Determining end-to-end delay bounds in heterogeneous networks , 1995, Multimedia Systems.

[5]  Wei Zhao,et al.  Guaranteeing end-to-end deadlines in ATM networks , 1995, Proceedings of 15th International Conference on Distributed Computing Systems.

[6]  Riccardo Bettati,et al.  Adaptive connection admission control for mission critical real-time communication networks , 1998, IEEE Military Communications Conference. Proceedings. MILCOM 98 (Cat. No.98CH36201).

[7]  Hui Zhang Providing end-to-end performance guarantees using non-work-conserving disciplines , 1995, Comput. Commun..

[8]  Rene L. Cruz,et al.  A calculus for network delay, Part I: Network elements in isolation , 1991, IEEE Trans. Inf. Theory.

[9]  Edward W. Knightly,et al.  Deterministic delay bounds for VBR video in packet-switching networks: fundamental limits and practical trade-offs , 1996, TNET.

[10]  Riccardo Bettati,et al.  IEEE TRANSACTIONS ON SYSTEMS , MAN , AND CYBERNETICS — PART A : SYSTEMS AND HUMANS , 2001 .

[11]  Richard E. Newman,et al.  Performance analysis of a method for high level prevention of traffic analysis using measurements from a campus network , 1994, Tenth Annual Computer Security Applications Conference.

[12]  Richard E. Newman,et al.  High level prevention of traffic analysis , 1991, Proceedings Seventh Annual Computer Security Applications Conference.

[13]  Wei Zhao,et al.  Stability in ATM networks , 1997, Proceedings of INFOCOM '97.

[14]  W. D. Cairns THE MATHEMATICAL ASSOCIATION OF AMERICA. , 1917, Science.

[15]  Kang G. Shin,et al.  On the ability of establishing real-time channels in point-to-point packet-switched networks , 1994, IEEE Trans. Commun..

[16]  Richard E. Newman,et al.  Transmission schedules to prevent traffic analysis , 1993, Proceedings of 9th Annual Computer Security Applications Conference.