A Weakest Precondition Approach to Robustness
2010 (English)In: Lecture Notes in Computer Science, ISSN 0302-9743, E-ISSN 1611-3349, Vol. 6340, no PART 1, 261-297 p.Article in journal (Refereed) Published
With the increasing complexity of information management computer systems, security becomes a real concern. E-government, web-based financial transactions or military and health care information systems are only a few examples where large amount of information can reside on different hosts distributed worldwide. It is clear that any disclosure or corruption of confidential information in these contexts can result fatal. Information flow controls constitute an appealing and promising technology to protect both data confidentiality and data integrity. The certification of the security degree of a program that runs in untrusted environments still remains an open problem in the area of language-based security. Robustness asserts that an active attacker, who can modify program code in some fixed points (holes), is unable to disclose more private information than a passive attacker, who merely observes unclassified data. In this paper, we extend a method recently proposed for checking declassified non-interference in presence of passive attackers only, in order to check robustness by means of weakest precondition semantics. In particular, this semantics simulates the kind of analysis that can be performed by an attacker, i.e., from public output towards private input. The choice of semantics allows us to distinguish between different attacks models and to characterize the security of applications in different scenarios. Our results are sound to address confidentiality and integrity of software running in untrusted environments where different actors can distrust one another. For instance, a web server can be attacked by a third party in order to steal a session cookie or hijack clients to a fake web page.
Place, publisher, year, edition, pages
2010. Vol. 6340, no PART 1, 261-297 p.
abstract interpretation, active attackers, declassification, non-interference, program semantics, robustness, security
IdentifiersURN: urn:nbn:se:kth:diva-81050DOI: 10.1007/978-3-642-17499-5_11ScopusID: 2-s2.0-78650666141OAI: oai:DiVA.org:kth-81050DiVA: diva2:497084
QC 201202162012-02-102012-02-102014-09-08Bibliographically approved