Types vs. PDGs in Information Flow Analysis

Mantel, Heiko; Sudbrock, Henning

doi:10.1007/978-3-642-38197-3_8

Cited by 9 publications

(3 citation statements)

References 31 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Another class of approaches for information flow control are based on type systems [26,19]. They can have the same scalability and precision as SDG-based approaches [20], though most type systems have higher scalability but lower precision. They enforce secure information flow by assigning a security type (e.g., high or low) to the program variables and then checking whether the expressions in the program conform to the type system.…”

Section: Related Workmentioning

confidence: 99%

Using Theorem Provers to Increase the Precision of Dependence Analysis for Information Flow Control

Beckert

Bischof

Herda

et al. 2018

Formal Methods and Software Engineering

View full text Add to dashboard Cite

Information flow control (IFC) is a category of techniques for enforcing information flow properties. In this paper we present the Combined Approach, a novel IFC technique that combines a scalable system-dependence-graph-based (SDG-based) approach with a precise logic-based approach based on a theorem prover. The Combined Approach has an increased precision compared with the SDG-based approach on its own, without sacrificing its scalability. For every potential illegal information flow reported by the SDG-based approach, the Combined Approach automatically generates proof obligations that, if valid, prove that there is no program path for which the reported information flow can happen. These proof obligations are then relayed to the logic-based approach. We also show how the SDG-based approach can provide additional information to the theorem prover that helps decrease the verification effort. Moreover, we present a prototypical implementation of the Combined Approach that uses the tools JOANA and KeY as the SDG-based and logic-based approach respectively.

show abstract

Section: Related Workmentioning

confidence: 99%

Using Theorem Provers to Increase the Precision of Dependence Analysis for Information Flow Control

Beckert

Bischof

Herda

et al. 2018

Formal Methods and Software Engineering

View full text Add to dashboard Cite

show abstract

“…Observe that the preciseness of the dependence graph depends on how precisely we can identify the overlapping of databaseparts by various database operations (add, upd, del). Let us extend the definitions on dependence graphs from [21] to the case of DOPDG. Table 1 depicts the abstract syntax of database applications defined in [12], where e = e 1 , e 2 , .…”

Section: Database-oriented Program Dependence Graph (Dopdg)mentioning

confidence: 99%

Refining dependencies for information flow analysis of database applications

Alam

Halder

2016

IJTMCC

View full text Add to dashboard Cite

Preserving confidentiality of sensitive information in any computing system always remains a challenging issue. One such reason is improper coding of softwares which may lead to the disclosure of sensitive information to unauthorised users while propagating along the code during execution. Languagebased information flow security analysis has emerged as a promising technique to prove that program's executions do not leak sensitive information to untrusted users. In this paper, we propose information flow analysis of database applications. The main contributions of the paper are: 1) refinement of dependence graphs for database applications by removing false dependencies; 2) information-flow analysis of database applications using refined dependence graph. Our approach covers a more generic scenario where attackers are able to view only a part of the attribute-values according to the policy, and leads to a more precise semanticbased analysis which reduces false positives with respect to the literature. This paper is a revised and expanded version of a paper entitled 'Data-Centric Refinement of Information Flow Analysis of Database Applications' presented at SSCC '

show abstract

“…Механизмы проверки чаще всего реализуются на языковом уровне в виде отдельных видов статического (динамического) анализа. Особую популярность приобрели методы статического анализа информационных потоков на основе безопасных систем типов [9,10]. Они позволяют применить принцип безопасной композиции, что существенно в виду большого объема проверяемого кода промышленных приложений.…”

Section: Introductionunclassified

Analysis of information flow security using software implementing business logic based on stored database program blocks

Timakov

2024

Rossijskij tehnologičeskij žurnal

View full text Add to dashboard Cite

Objectives. Verification of software security is typically performed using dynamic and static analysis tools. The corresponding types of analysis do not usually consider the business logic of the software and do not rely on data access control policies. A modern approach to resolving this problem is to implement language-based information flow control. Despite a large amount of research, mechanisms for information flow control in software are not widely used in practice. This is because they are complex and impose increased demands on developers. The aim of the work is to transfer information flow control from the language level to the level of formal verification. This will enable the functions of controlling data integrity and confidentiality in software to be isolated into a separate task, which can be resolved by information security analysts.Methods. The research is based on general formal security methods for computer systems and formal verification methods. The algorithm developed by the author for checking security specifications and resolving security violations uses temporal logic of actions.Results. The technology is presented as a step-by-step approach to resolving specific tasks, including the following: designing a database (DB) for storing and processing sensitive information; analyzing dependencies and identifying relevant sets of program blocks in the DB; generating TLA+ specifications for the identified program blocks; labeling specifications according to global security policy rules and additional constraints; applying the specification verification algorithm, and resolving security violations while providing recommendations for software developers. The procedure also involves analyzing labeled data, in order to control the spread of verified program block output values in external software modules.Conclusions. The technology presented herein does not require developers to include redundant annotations describing security policy rules. The function of analyzing information flows with reference to predefined access restrictions is moved to a separate stage of the software development life cycle.

show abstract

Types vs. PDGs in Information Flow Analysis

Cited by 9 publications

References 31 publications

Using Theorem Provers to Increase the Precision of Dependence Analysis for Information Flow Control

Using Theorem Provers to Increase the Precision of Dependence Analysis for Information Flow Control

Refining dependencies for information flow analysis of database applications

Analysis of information flow security using software implementing business logic based on stored database program blocks

Contact Info

Product

Resources

About