A Formulation of the Potential for Communication Condition using C2KA

  title={A Formulation of the Potential for Communication Condition using C2KA},
  author={Jason Jaskolka and Ridha Kh{\'e}dri},
  booktitle={International Symposium on Games, Automata, Logics and Formal Verification},
An integral part of safeguarding systems of communicating agents from covert channel communication is having the ability to identify when a covert channel may exist in a given system and which agents are more prone to covert channels than others. In this paper, we propose a formulation of one of the necessary conditions for the existence of covert channels: the potential for communication condition. Then, we discuss when the potential for communication is preserved after the modification of… 

Mitigating covert channels based on analysis of the potential for communication

Evaluating the Exploitability of Implicit Interactions in Distributed Systems

A new measure of exploitability for implicit interactions is developed to aid in evaluating the threat posed by the existence of such vulnerabilities in system designs for launching cyber-attacks, offering significant improvements to overall system resilience, dependability, and security.

Communicating Concurrent Kleene Algebra for Distributed Systems Specification

This work formalizes results about CKA and its application for distributed systems specification, and formalizes notions and properties related to the topology of distributed systems and the potential for communication via stimuli and via shared environments of agents, all within the algebraic setting of CKA.

An Approach for Identifying and Analyzing Implicit Interactions in Distributed Systems

The methods presented can help address the growing need for rigorous and practical methods and techniques for assuring the safe, secure, and reliable operation of distributed systems in critical domains.

Computer Security: ESORICS 2020 International Workshops, CyberICPS, SECPRE, and ADIoT, Guildford, UK, September 14–18, 2020, Revised Selected Papers

The notion of a dependency graph is introduced to specify the interrelation of the components and an automated mechanism to transfer these specifications to Markov Decision Processes, which allow us to automatically analyze such systems by using probabilistic model checkers.

Identifying Implicit Component Interactions in Distributed Cyber-Physical Systems

This research aims to advance the specification, design, and implementation of distributed cyber-physical systems with improved cybersecurity assurance by providing a new way of thinking about the problem of implicit interactions through the application of formal methods.



Foundations of Communicating Concurrent Kleene Algebra

This paper proposes a mathematical framework for communication and concurrency called Communicating Concurrent Kleene Algebra (C 2 KA), which supports the ability to work in either a state-based or event-based model for the specification of concurrent and communicating systems.

Behavior-Based Covert Channel in Cyberspace

A behavior-based covert channel, that takes advantages of behavior of an application, is presented along with a formal definition in the framework of finite state machines, which makes the detection of this type of covert channel much more dicult.

Covert Channel Capacity

  • J. Millen
  • Computer Science
    1987 IEEE Symposium on Security and Privacy
  • 1987
This paper establishes a connection between Shannon's theory of communication and information flow models, such as the Goguen-Meseguer model, that view a reference monitor as a state-transition automaton that takes the channel associated with a machine and a compromise policy as a measure of covert channel information rate.

Verification of Information Flow in Agent-Based Systems

The proposed technique allows classifying information into frames and articulating finer granularity policies that involve information, its elements, or its frames, and allows for information manipulation through several operations such as focusing and combining information.

Algebraic Information Theory For Binary Channels

Modeling, Analysis, and Detection of Information Leakage via Protocol-Based Covert Channels

A technique for detecting confidential information leakages via covert channels is proposed, based on relation algebra and offers tests for verifying the existence of an abstraction relation which relates the confidential information to the information that is observed to be sent on the communication channel.

A pump for rapid, reliable, secure communication

By adding random delays to the acknowledgment stream, it is shown how to further reduce the covert channel capacity even in the presence of cooperating Trojan horses in both the high and low systems.

Covert channel detection using Information Theory

An information theory based detection framework for covert channels is presented and it is shown that the usual notion of interference does not characterize the notion of deliberate information flow of covert channels and even an enhanced notion of “iterated multivalued interference” cannot capture flows with capacity lower than one bit of information per channel use.

A formal test for detecting information leakage via covert channels

The proposed technique is based on relational algebra and provides tests to verify the existence of a leakage of information via a monitored covert channel and provides computations which show how the information was leaked if a leakage exists.