The Experts below are selected from a list of 14982 Experts worldwide ranked by ideXlab platform
Jay Ramanathan - One of the best experts on this subject based on the ideXlab platform.
-
RED-Transaction and Goal-Model Based Analysis of Layered Security of Physical Spaces
2008 32nd Annual IEEE International Computer Software and Applications Conference, 2008Co-Authors: Rajiv Ramnath, Vasudha Gupta, Jay RamanathanAbstract:We propose a systems analysis framework based on goal modelling and transactions for improved decision-making about Security solution architectures - with a specific focus on Layered Security of physical spaces and assets. The framework assists in defining more complete Security strategies as well as analyzing tradeoffs between Security and other factors such as cost and privacy. Using the conceptual transaction or requirements-execution-delivery (or RED) Transaction model as the basis, we provide a dynamic virtual structure and methodology for Security analysis. The benefit is that the implemented Security can be optimized based on the value to the various stakeholders and to minimize the benefit to the attacker.
Anwitaman Datta - One of the best experts on this subject based on the ideXlab platform.
-
DMZtore: A dispersed Data Storage System with Decentralized Multi-factor Access Control (Demo)
2016 IEEE 36th International Conference on Distributed Computing Systems (ICDCS), 2016Co-Authors: Ertem Esiner, Shun Hanli Hanley, Anwitaman DattaAbstract:While many commercial systems as well as academic techniques for data outsourcing to and content confidentiality from untrusted data stores have been developed over the last decade, when it comes to multi-factor authentication based Layered Security, existing approaches typically rely on a logically centralized service. In this demo, we present DMZtore edge storage system that incorporates a decentralized multi-factor access control scheme [1] achieving Layered Security.
-
Layered Security for storage at the edge on decentralized multi factor access control
International Conference of Distributed Computing and Networking, 2016Co-Authors: Ertem Esiner, Anwitaman DattaAbstract:In this paper we propose a protocol that allows end-users in a decentralized setup (without requiring any trusted third party) to protect data shipped to remote servers using two factors - knowledge (passwords) and possession (a time based one time password generation for authentication) that is portable. The protocol also supports revocation and recreation of a new possession factor if the older possession factor is compromised, provided the legitimate owner still has a copy of the possession factor. Furthermore, akin to some other recent works, our approach naturally protects the outsourced data from the storage servers themselves, by application of encryption and dispersal of information across multiple servers. We also extend the basic protocol to demonstrate how collaboration can be supported even while the stored content is encrypted, and where each collaborator is still restrained from accessing the data through a multi-factor access mechanism. Such techniques achieving Layered Security is crucial to (opportunistically) harness storage resources from untrusted entities.
Sanpawat Kantabutra - One of the best experts on this subject based on the ideXlab platform.
-
the structure and topology of rooted weighted trees modeling Layered cyber Security systems
arXiv: Discrete Mathematics, 2016Co-Authors: Geir Agnarsson, Raymond Greenlaw, Sanpawat KantabutraAbstract:In this paper we consider a Layered-Security model in which the containers and their nestings are given in the form of a rooted tree $T$. A {\em cyber-Security model\/} is an ordered three-tuple $M = (T, C, P)$ where $C$ and $P$ are multisets of {\em penetration costs\/} for the containers and {\em target-acquisition values\/} for the prizes that are located within the containers, respectively, both of the same cardinality as the set of the non-root vertices of $T$. The problem that we study is to assign the penetration costs to the edges and the target-acquisition values to the vertices of the tree $T$ in such a way that minimizes the total prize that an attacker can acquire given a limited {\em budget}. For a given assignment of costs and target values we obtain a {\em Security system}, and we discuss three types of them: {\em improved}, {\em good}, and {\em optimal}. We show that in general it is not possible to develop an optimal Security system for a given cyber-Security model $M$. We define P- and C-models where the penetration costs and prizes, respectively, all have unit value. We show that if $T$ is a rooted tree such that any P- or C-model $M = (T,C,P)$ has an optimal Security system, then $T$ is one of the following types: (i) a rooted path, (ii) a rooted star, (iii) a rooted 3-caterpillar, or (iv) a rooted 4-spider. Conversely, if $T$ is one of these four types of trees, then we show that any P- or C-model $M = (T,C,P)$ does have an optimal Security system\@. Finally, we study a duality between P- and C-models that allows us to translate results for P-models into corresponding results for C-models and vice versa. The results obtained give us some mathematical insights into how Layered-Security defenses should be organized.
-
the complexity of cyber attacks in a new Layered Security model and the maximum weight rooted subtree problem
arXiv: Data Structures and Algorithms, 2015Co-Authors: Geir Agnarsson, Raymond Greenlaw, Sanpawat KantabutraAbstract:In our cyber Security model we define the concept of {\em penetration cost}, which is the cost that must be paid in order to break into the next layer of Security. Given a tree $T$ rooted at a vertex $r$, a {\em penetrating cost} edge function $c$ on $T$, a {\em target-acquisition} vertex function $p$ on $T$, the attacker's {\em budget} and the {\em game-over threshold} $B,G \in {\mathbb{Q}}^{+}$ respectively, we consider the problem of determining the existence of a rooted subtree $T'$ of $T$ within the attacker's budget (that is, the sum of the costs of the edges in $T'$ is less than or equal to $B$) with total acquisition value more than the game-over threshold (that is, the sum of the target values of the nodes in $T'$ is greater than or equal to $G$). We prove that the general version of this problem is intractable, but does admit a polynomial time approximation scheme. We also analyze the complexity of three restricted versions of the problems, where the penetration cost is the constant function, integer-valued, and rational-valued among a given fixed number of distinct values.
-
the complexity of cyber attacks in a new Layered Security model and the maximum weight rooted subtree problem
Annual Conference of the Global Innovation and Knowledge Academy, 2015Co-Authors: Geir Agnarsson, Raymond Greenlaw, Sanpawat KantabutraAbstract:This paper makes three contributions to cyber-Security research. First, we define a model for cyber-Security systems and the concept of a cyber-Security attack within the model’s framework. The model highlights the importance of game-over components—critical system components which if acquired will give an adversary the ability to defeat a system completely. The model is based on systems that use defense-in-depth/Layered-Security approaches, as many systems do. In the model we define the concept of penetration cost}, which is the cost that must be paid in order to break into the next layer of Security. Second, we define natural decision and optimization problems based on cyber-Security attacks in terms of doubly weighted trees, and analyze their complexity. More precisely, given a tree T rooted at a vertex r, a penetrating cost edge function c on T, a target-acquisition vertex function p on T, the attacker’s budget and the game-over threshold B ,G∈Q + respectively, we consider the problem of determining the existence of a rooted subtree T’ of T within the attacker’s budget (that is, the sum of the costs of the edges in T’ is less than or equal to B) with total acquisition value more than the game-over threshold (that is, the sum of the target values of the nodes in T’ is greater than or equal to G). We prove that the general version of this problem is intractable. We also analyze the complexity of three restricted versions of the problems, where the penetration cost is the constant function, integer-valued, and rational-valued among a given fixed number of distinct values. Using recursion and dynamic-programming techniques, we show that for constant penetration costs an optimal cyber-attack strategy can be found in polynomial time, and for integer-valued and rational-valued penetration costs optimal cyber-attack strategies can be found in pseudo-polynomial time. Third, we provide a list of open problems relating to the architectural design of cyber-Security systems and to the model.
Reginald Cooper - One of the best experts on this subject based on the ideXlab platform.
-
Cross-Layered Security Approach with Compromised Nodes Detection in Cooperative Sensor Networks
2016 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW), 2016Co-Authors: Wei Chen, Sushmitha Shetty, Dan Lo, Liang Hong, Reginald CooperAbstract:Cooperative MIMO communication is a promising technology which enables realistic solution for improving communication performance with MIMO technique in wireless networks that are composed of size and cost constrained devices. However, the Security problems inherent to cooperative communication also arise. Cryptography can ensure the confidentiality in the communication and routing between authorized participants, but it usually cannot prevent the attacks from compromised nodes which may corrupt communications by sending garbled signals. In this paper, we propose a cross-Layered approach to enhance the Security in query-based cooperative MIMO sensor networks. The approach combines efficient cryptographic technique implemented in upper layer with a novel information theory based compromised nodes detection algorithm in physical layer. In the detection algorithm, a cluster of K cooperative nodes are used to identify up to K - 1 active compromised nodes. When the compromised nodes are detected, the key revocation is performed to isolate the compromised nodes and reconfigure the cooperative MIMO sensor network. During this process, beamforming is used to avoid the information leaking. The proposed Security scheme can be easily modified and applied to cognitive radio networks. Simulation results show that the proposed algorithm for compromised nodes detection is effective and efficient, and the accuracy of received information is significantly improved.
Rajiv Ramnath - One of the best experts on this subject based on the ideXlab platform.
-
RED-Transaction and Goal-Model Based Analysis of Layered Security of Physical Spaces
2008 32nd Annual IEEE International Computer Software and Applications Conference, 2008Co-Authors: Rajiv Ramnath, Vasudha Gupta, Jay RamanathanAbstract:We propose a systems analysis framework based on goal modelling and transactions for improved decision-making about Security solution architectures - with a specific focus on Layered Security of physical spaces and assets. The framework assists in defining more complete Security strategies as well as analyzing tradeoffs between Security and other factors such as cost and privacy. Using the conceptual transaction or requirements-execution-delivery (or RED) Transaction model as the basis, we provide a dynamic virtual structure and methodology for Security analysis. The benefit is that the implemented Security can be optimized based on the value to the various stakeholders and to minimize the benefit to the attacker.