Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/1554339.1554348acmconferencesArticle/Chapter ViewAbstractPublication PagespldiConference Proceedingsconference-collections
research-article

A weakest precondition approach to active attacks analysis

Published: 15 June 2009 Publication History

Abstract

Information flow controls can be used 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 language-based security. The notion of robustness asserts that an active attacker, who can modify program code in some fixed points (holes), is not able to disclose more private information than a passive attacker, who merely observes public 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 the weakest precondition semantics. In particular, this semantics simulates the kind of analysis that can be performed by an attacker, i.e., from the public output towards the private input. The choice of the semantics lets us distinguish between different attacks models. In this paper, we also introduce relative robustness that is a relaxed notion of robustness for restricted classes of attacks.

References

[1]
A. Banerjee, R. Giacobazzi, and I. Mastroeni. What you lose is what you leak: Information leakage in declassifivation policies. In Proc. of the 23th Internat. Symp. on Mathematical Foundations of Programming Semantics (MFPS '07), volume 1514 of Electronic Notes in Theoretical Computer Science, Amsterdam, 2007. Elsevier.
[2]
S. Chong and A. C. Myers. Decentralized robustness. In Proc. the IEEE Computer Security Foundations Workshop (CSFW-19), pages 242--256, Washington, DC, USA, 2006. IEEE Computer Society.
[3]
E. S. Cohen. Information transmission in sequential programs. In DeMillo et al., editor, Foundations of Secure Computation, pages 297--335, New York, 1978. Academic Press.
[4]
P. Cousot and R. Cousot. Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Proc. of Conf. Record of the 4th ACM Symp. on Principles of Programming Languages (POPL '77), pages 238--252, New York, 1977. ACM Press.
[5]
P. Cousot and R. Cousot. Systematic design of program analysis frameworks. In Proc. of Conf. Record of the 6th ACM Symp. on Principles of Programming Languages (POPL '79), pages 269--282, New York, 1979. ACM Press.
[6]
E. W. Dijkstra. A discipline of programming. Series in automatic computation. Prentice-Hall, 1976.
[7]
E. W. Dijkstra. Guarded commands, nondeterminism and formal derivation of programs. Comm. of The ACM, 18(8):453--457, 1975.
[8]
J. A. Goguen and J. Meseguer. Security policies and security models. In Proc. IEEE Symp. on Security and Privacy, pages 11--20, Los Alamitos, Calif., 1982. IEEE Comp. Soc. Press.
[9]
I. Mastroeni and A. Banerjee. Modelling declassification policies using abstract domain completeness. Technical Report RR 61/2008, Department of Computer Science, University of Verona, May 2008.
[10]
A. C. Myers and B. Liskov. Protecting privacy using the decentralized label model. ACM Trans. Softw. Eng. Methodol., 9(4): 410--442, 2000.
[11]
A. C. Myers, A. Sabelfeld, and S. Zdancewic. Enforcing robust declassification. In Proc. IEEE Symp. on Security and Privacy, pages 21--34, Los Alamitos, Calif., 2004. IEEE Comp. Soc. Press.
[12]
A. Sabelfeld and A. C. Myers. Language-based information-flow security. IEEE J. on selected ares in communications, 21(1): 5--19, 2003.
[13]
A. Sabelfeld and D. Sands. Declassification: Dimensions and principles. J. of Computer Security, 2007.
[14]
G. Winskel. The formal semantics of programming languages: an introduction. MIT press, Cambridge, Mass., 1993.
[15]
S. Zdancewic and A. C. Myers. Robust declassification. In Proc. of the IEEE Computer Security Foundations Workshop, pages 15--23, Los Alamitos, Calif., 2001. IEEE Comp. Soc. Press.

Cited By

View all
  • (2024)Security Properties through the Lens of Modal Logic2024 IEEE 37th Computer Security Foundations Symposium (CSF)10.1109/CSF61375.2024.00009(340-355)Online publication date: 8-Jul-2024
  • (2022)Dynamic Policies Revisited2022 IEEE 7th European Symposium on Security and Privacy (EuroS&P)10.1109/EuroSP53844.2022.00035(448-466)Online publication date: Jun-2022
  • (2021)Language Support for Secure Software Development with Enclaves2021 IEEE 34th Computer Security Foundations Symposium (CSF)10.1109/CSF51468.2021.00037(1-16)Online publication date: Jun-2021
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
PLAS '09: Proceedings of the ACM SIGPLAN Fourth Workshop on Programming Languages and Analysis for Security
June 2009
130 pages
ISBN:9781605586458
DOI:10.1145/1554339
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 15 June 2009

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. active attackers
  2. declassification
  3. non-interference
  4. program semantics
  5. robustness

Qualifiers

  • Research-article

Conference

PLDI '09
Sponsor:

Acceptance Rates

PLAS '09 Paper Acceptance Rate 8 of 19 submissions, 42%;
Overall Acceptance Rate 43 of 77 submissions, 56%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)10
  • Downloads (Last 6 weeks)0
Reflects downloads up to 09 Jan 2025

Other Metrics

Citations

Cited By

View all
  • (2024)Security Properties through the Lens of Modal Logic2024 IEEE 37th Computer Security Foundations Symposium (CSF)10.1109/CSF61375.2024.00009(340-355)Online publication date: 8-Jul-2024
  • (2022)Dynamic Policies Revisited2022 IEEE 7th European Symposium on Security and Privacy (EuroS&P)10.1109/EuroSP53844.2022.00035(448-466)Online publication date: Jun-2022
  • (2021)Language Support for Secure Software Development with Enclaves2021 IEEE 34th Computer Security Foundations Symposium (CSF)10.1109/CSF51468.2021.00037(1-16)Online publication date: Jun-2021
  • (2021)Backwards-directed information flow analysis for concurrent programs2021 IEEE 34th Computer Security Foundations Symposium (CSF)10.1109/CSF51468.2021.00017(1-16)Online publication date: Jun-2021
  • (2014)Hybrid side-channel/machine-learning attacks on PUFsProceedings of the conference on Design, Automation & Test in Europe10.5555/2616606.2617100(1-6)Online publication date: 24-Mar-2014
  • (2011)Attacker Control and Impact for Confidentiality and IntegrityLogical Methods in Computer Science10.2168/LMCS-7(3:17)20117:3Online publication date: 26-Sep-2011
  • (2010)A weakest precondition approach to robustnessTransactions on computational science X10.5555/1985581.1985592(261-297)Online publication date: 1-Jan-2010
  • (2010)A Weakest Precondition Approach to RobustnessTransactions on Computational Science X10.1007/978-3-642-17499-5_11(261-297)Online publication date: 2010
  • (2010)A semantic framework for declassification and endorsementProceedings of the 19th European conference on Programming Languages and Systems10.1007/978-3-642-11957-6_5(64-84)Online publication date: 20-Mar-2010

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media