Qualitative and quantitative information flow analysis for multi-threaded programs

Ngo, Minh

doi:10.3990/1.9789036536523

Cited by 6 publications

(6 citation statements)

References 109 publications

(227 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…To our knowledge, no other evaluations of BOD have been published and we cannot perform a quantitative comparison of our implementation to other algorithms. However, we compare our approach to a closely related work that has been done by Ngo [32]. Ngo discusses the SmithVolpano program as a case study for his work on observational determinism.…”

Section: Complexity Of the Algorithmmentioning

confidence: 99%

Bisimulation for Secure Information Flow Analysis of Multi-Threaded Programs

Noroozi

Karimpour

Isazadeh

2019

MCA

View full text Add to dashboard Cite

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.

show abstract

Section: Complexity Of the Algorithmmentioning

confidence: 99%

Bisimulation for Secure Information Flow Analysis of Multi-Threaded Programs

Noroozi

Karimpour

Isazadeh

2019

MCA

View full text Add to dashboard Cite

show abstract

“…Example. Consider the following program from [14]: Therefore, the divergence stutter bisimulation quotient of it is computed as depicted in Figure 2. Since the initial state s 0 of KS and the initial state st 0 of KST are not in the same equivalence class, the program is labelled as insecure.…”

Section: Verification Of Observational Determinismmentioning

confidence: 99%

Verifying Observational Determinism

Karimpour

Isazadeh

Noroozi

2015

ICT Systems Security and Privacy Protection

View full text Add to dashboard Cite

Part 1: PrivacyInternational audienceThis paper proposes an approach to verify information flow security of concurrent programs. It discusses a hyperproperty called observational determinism which aims to ensure secure information flow in concurrent programs, and proves how this hyperproperty can be verified by stutter equivalence checking. More precisely, it defines observational determinism in terms of stutter equivalence of all traces having the same low initial value and shows how stutter trace equivalence can be verified by computing a divergence stutter bisimulation quotient. The approach is illustrated by verifying a small example

show abstract

“…The problem is borrowed from [11] to show how an attacker can deduce secret information through probabilistic leaks. David Chaum first proposed this problem in 1988 as an example of anonymity and identity hiding [23].…”

Section: Case Studymentioning

confidence: 99%

“…Consequently, algorithmic verification has been favored recently, which is the application of rigorous, mathematically sound, and fully automatic techniques to the analysis of systems. These techniques are more flexible than type systems, and give a precise and efficient mechanism to verify a variety of security properties, without the need to prove soundness repeatedly [11].…”

Section: B Backgroundmentioning

confidence: 99%

“…DC-net is secure, since it does not leak the identity of the paying cryptographer (in case one of the cryptographers made arrangement to pay for the meal). Following Ngo [11], to make this protocol leak information, a slight change is done: coins are biased, i.e., with probability 0.6 it comes up heads, and with probability 0.4 it comes up tails. www.ijacsa.thesai.org…”

Section: Case Studymentioning

confidence: 99%

See 1 more Smart Citation

Verifying Weak Probabilistic Noninterference

Noroozi¹,

Karimpour²,

Isazadeh³

et al. 2017

ijacsa

View full text Add to dashboard Cite

Abstract-Weak probabilistic noninterference is a security property for enforcing confidentiality in multi-threaded programs. It aims to guarantee secure flow of information in the program and ensure that sensitive information does not leak to attackers. In this paper, the problem of verifying weak probabilistic noninterference by leveraging formal methods, in particular algorithmic verification, is discussed. Behavior of multi-threaded programs is modeled using probabilistic Kripke structures and formalize weak probabilistic noninterference in terms of these structures. Then, a verification algorithm is proposed to check weak probabilistic noninterference. The algorithm uses an abstraction technique to compute quotient space of the program with respect to an equivalence relation called weak probabilistic bisimulation and does a simple check to decide whether the security property is satisfied or not. The progress made is demonstrated by a real-world case study. It is expected that the proposed approach constitutes a significant step towards more widely applicable secure information flow analysis.

show abstract

Qualitative and quantitative information flow analysis for multi-threaded programs

Cited by 6 publications

References 109 publications

Bisimulation for Secure Information Flow Analysis of Multi-Threaded Programs

Bisimulation for Secure Information Flow Analysis of Multi-Threaded Programs

Verifying Observational Determinism

Verifying Weak Probabilistic Noninterference

Contact Info

Product

Resources

About