Browsing by Subject "Security requirements"
Now showing items 1-7 of 7
-
Article
Current-state opacity formulations in probabilistic finite automata
(2014)A system is said to be current-state opaque if the entrance of the system state to a set of secret states remains opaque (uncertain) to an intruder - at least until the system leaves the set of secret states. This notion ...
-
Conference Object
Opacity verification in stochastic discrete event systems
(2010)Motivated by security and privacy considerations in applications of discrete event systems, various notions of opacity have been introduced. Specifically, a system is said to be current-state opaque if the entrance of the ...
-
Article
A survey on secure multipath routing protocols in WSNs
(2010)Routing protocols in wireless sensor networks (WSN) have been substantially investigated by researches. Most state-of-the-art surveys have focused on reviewing the different routing schemes that have been proposed for WSN ...
-
Conference Object
Using argumentation logic for firewall configuration management
(2009)Firewalls remain the main perimeter security protection for corporate networks. However, network size and complexity make firewall configuration and maintenance notoriously difficult. Tools are needed to analyse firewall ...
-
Article
Using argumentation logic for firewall policy specification and analysis
(2006)Firewalls are important perimeter security mechanisms that imple-ment an organisation's network security requirements and can be notoriously difficult to configure correctly. Given their widespread use, it is crucial that ...
-
Article
Verification of infinite-step opacity and complexity considerations
(2012)We describe and analyze the complexity of verifying the notion of infinite-step opacity in systems that are modeled as non-deterministic finite automata with partial observation on their transitions. Specifically, a system ...
-
Article
Verification of initial-state opacity in security applications of discrete event systems
(2013)In this paper, we formulate and analyze methodologies for verifying the notion of initial-state opacity in discrete event systems that are modeled as non-deterministic finite automata with partial observation on their ...