Generalized Abstract Non-interference: Abstract Secure Information-Flow Analysis for Automata

2005 ◽  
pp. 221-234 ◽  
Author(s):  
Roberto Giacobazzi ◽  
Isabella Mastroeni
Keyword(s):  
Information Flow ◽  
Flow Analysis ◽  
Information Flow Analysis ◽  
Secure Information

scholarly journals Bisimulation for Secure Information Flow Analysis of Multi-Threaded Programs

2019 ◽  
Vol 24 (2) ◽  
pp. 64 ◽  
Author(s):  
Ali A. Noroozi ◽  
Jaber Karimpour ◽  
Ayaz Isazadeh
Keyword(s):  
Model Checking ◽  
Information Flow ◽  
Flow Analysis ◽  
Operational Semantics ◽  
Kripke Model ◽  
Probabilistic Model Checking ◽  
Sensitive Information ◽  
Information Flow Analysis ◽  
Secure Information

Preserving the confidentiality of information is a growing concern in software development. Secure information flow is intended to maintain the confidentiality of sensitive information by preventing them from flowing to attackers. This paper discusses how to ensure confidentiality for multi-threaded programs through a property called observational determinism. Operational semantics of multi-threaded programs are modeled using Kripke structures. Observational determinism is formalized in terms of divergence weak low-bisimulation. Bisimulation is an equivalence relation associating executions that simulate each other. The new property is called bisimulation-based observational determinism. Furthermore, a model checking method is proposed to verify the new property and ensure that secure information flow holds in a multi-threaded program. The model checking method successively refines the Kripke model of the program until the quotient of the model with respect to divergence weak low-bisimulation is reached. Then, bisimulation-based observational determinism is checked on the quotient, which is a minimized model of the concrete Kripke model. The time complexity of the proposed method is polynomial in the size of the Kripke model. The proposed approach has been implemented on top of PRISM, a probabilistic model checking tool. Finally, a case study is discussed to show the applicability of the proposed approach.

scholarly journals Non-termination and secure information flow

2011 ◽  
Vol 21 (6) ◽  
pp. 1183-1205
Author(s):  
GEOFFREY SMITH ◽  
RAFAEL ALPÍZAR
Keyword(s):  
Information Flow ◽  
Thought Experiment ◽  
Flow Analysis ◽  
Fundamental Property ◽  
Fast Simulation ◽  
Information Flow Analysis ◽  
Probabilistic Simulation ◽  
Secure Information ◽  
Reachability Property ◽  
Probabilistic Programs

In secure information flow analysis, the classic Denning restrictions allow a program's termination to be affected by the values of its H variables, resulting in potential information leaks. In an effort to quantify such leaks, in this paper we study a simple imperative language with random assignments. As a thought experiment, we propose a ‘stripping’ operation on programs, which eliminates all ‘high computation’, and prove the fundamental property that stripping cannot decrease the probability of any low outcome. To prove this property, we first introduce a new notion of fast probabilistic simulation on Markov chains and show that it implies a key reachability property. Viewing the stripping function as a binary relation, we then prove that stripping is a fast simulation. As an application, we prove that, under the Denning restrictions, well-typed probabilistic programs are guaranteed to satisfy an approximate probabilistic non-interference property, provided that their probability of non-termination is small.

scholarly journals Secure Information Flow for IoT Applications

2019 ◽  
Author(s):  
Tri Minh Ngo
Keyword(s):  
Information Flow ◽  
Flow Analysis ◽  
Communication Channels ◽  
Error Correcting Codes ◽  
Memory Storage ◽  
Decoding Complexity ◽  
Information Flow Analysis ◽  
Iot Applications ◽  
Secure Information

This paper discusses how to ensure security, i.e., confidentiality and integrity properties, for data in IoT applications. While confidentiality could be assessed via information flow analysis, integrity is ensured by error-correcting codes. In addition to errors, many communication channels also cause erasures, i.e., the demodulator cannot decide which symbol the received waveform represents. The paper proposes a method that might correct both errors and erasures together. Our method is efficient in reducing memory storage as well as decoding complexity.

scholarly journals A permission-dependent type system for secure information flow analysis

2021 ◽  
pp. 1-68
Author(s):  
Zhiwu Xu ◽  
Hongxu Chen ◽  
Alwen Tiu ◽  
Yang Liu ◽  
Kunal Sareen
Keyword(s):  
Information Flow ◽  
Flow Analysis ◽  
Type System ◽  
Information Leakage ◽  
Inference Problem ◽  
Ordered Binary Decision Diagrams ◽  
Information Flow Analysis ◽  
Secure Information ◽  
Android Applications ◽  
Android Permission

We introduce a novel type system for enforcing secure information flow in an imperative language. Our work is motivated by the problem of statically checking potential information leakage in Android applications. To this end, we design a lightweight type system featuring Android permission model, where the permissions are statically assigned to applications and are used to enforce access control in the applications. We take inspiration from a type system by Banerjee and Naumann to allow security types to be dependent on the permissions of the applications. A novel feature of our type system is a typing rule for conditional branching induced by permission testing, which introduces a merging operator on security types, allowing more precise security policies to be enforced. The soundness of our type system is proved with respect to non-interference. A type inference algorithm is also presented for the underlying security type system, by reducing the inference problem to a constraint solving problem in the lattice of security types. In addition, a new way to represent our security types as reduced ordered binary decision diagrams is proposed.

Sign in / Sign up

Export Citation Format

Share Document