A new algorithm for low-deterministic security

Giffhorn, Dennis; Snelting, Gregor

doi:10.1007/s10207-014-0257-6

Cited by 23 publications

(28 citation statements)

References 43 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…They have developed JOANA [21], an object sensitive and context sensitive tool for checking noninterference in Java bytecode [22], shown their techniques to be sound [59], and considered information flow in concurrent programs [17]. They also use path conditions to improve precision by ruling out impossible paths [54].…”

Section: Related Workmentioning

confidence: 99%

Exploring and enforcing security guarantees via program dependence graphs

et al. 2015

View full text Add to dashboard Cite

We present PIDGIN, a program analysis and understanding tool that enables the specification and enforcement of precise applicationspecific information security guarantees. PIDGIN also allows developers to interactively explore the information flows in their applications to develop policies and investigate counter-examples.PIDGIN combines program dependence graphs (PDGs), which precisely capture the information flows in a whole application, with a custom PDG query language. Queries express properties about the paths in the PDG; because paths in the PDG correspond to information flows in the application, queries can be used to specify global security policies.PIDGIN is scalable. Generating a PDG for a 330k line Java application takes 90 seconds, and checking a policy on that PDG takes under 14 seconds. The query language is expressive, supporting a large class of precise, application-specific security guarantees. Policies are separate from the code and do not interfere with testing or development, and can be used for security regression testing.We describe the design and implementation of PIDGIN and report on using it: (1) to explore information security guarantees in legacy programs; (2) to develop and modify security policies concurrently with application development; and (3) to develop policies based on known vulnerabilities.

show abstract

Section: Related Workmentioning

confidence: 99%

Exploring and enforcing security guarantees via program dependence graphs

et al. 2015

View full text Add to dashboard Cite

show abstract

“…Giffhorn and Snelting [14] use a PDG-based whole program analysis to enforce relaxed low-security observational determinism (RLSOD) in Java programs. RLSOD is similar to our security condition in that it allows low-nondeterminism as long as it does not depend on secrets.…”

Section: Scheduler-independent Approachesmentioning

confidence: 99%

Compositional Non-interference for Concurrent Programs via Separation and Framing

Karbyshev

Svendsen

Askarov

et al. 2018

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Reasoning about information flow in a concurrent setting is notoriously difficult due in part to timing channels that may leak sensitive information. In this paper, we present a compositional and flexible type-and-effect system that guarantees non-interference by disallowing potentially insecure races that can be exploited through internal timing attacks. In contrast to many previous approaches, which disallow all races on public variables, we use an explicit scheduler model to give a more permissive security definition and type system, which allows benign races on public variables. To achieve compositionality, we use the idea of resources from separation logic, both to locally specify and reason about whether accesses may be racy and to bound the security level of data that may be learned through scheduling.

show abstract

“…Following the algorithmic approach, Giffhorn et al [37] propose a verification method based on program dependence graphs to check observational determinism. A program dependence graph models information flow through a program, where nodes are program statements, and edges are data dependences or control dependences.…”

Section: Related Workmentioning

confidence: 99%

“…The following program, borrowed from [37,85], consists of three threads that read a private value PIN , and then compute a public value result. Via this case study, we show that due to the interaction between threads and the control of an appropriate scheduler, the confidentiality of a multi-threaded program might be violated.…”

Section: Case Study 1: a Possibilistic Modelmentioning

confidence: 99%

“…We provide two case studies to show the feasibility of our algorithmic approaches and the practical capability of the implementation. The first case study is a nondeterministic multi-threaded program, from [37,85], showing how the scheduling policy can be used to make a program execution leak secret information. The second case study is a probabilistic version of the dining cryptographer problem [23] showing how an attacker can derive secret information from the probabilistic outcomes.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Qualitative and quantitative information flow analysis for multi-threaded programs

Ngo¹

View full text Add to dashboard Cite

A new algorithm for low-deterministic security

Cited by 23 publications

References 43 publications

Exploring and enforcing security guarantees via program dependence graphs

Exploring and enforcing security guarantees via program dependence graphs

Compositional Non-interference for Concurrent Programs via Separation and Framing

Qualitative and quantitative information flow analysis for multi-threaded programs

Contact Info

Product

Resources

About