Logo Logo
Hilfe
Hilfe
Switch Language to English

Murray, Toby ORCID logoORCID: https://orcid.org/0000-0002-8271-0289; Tiwari, Mukesh ORCID logoORCID: https://orcid.org/0000-0001-5373-9659; Ernst, Gidon ORCID logoORCID: https://orcid.org/0000-0002-3289-5764 und Naumann, David A. ORCID logoORCID: https://orcid.org/0000-0002-7634-6150 (2023): Assume but Verify: Deductive Verification of Leaked Information in Concurrent Applications. 30th ACM SIGSAC Conference on Computer and Communications Security (ACM CCS), Copenhagen, Denmark, 26. - 30. November 2023. Meng, Weizhi und Jensen, Christian D. (Hrsg.): In: Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security, New York: Association for Computing Machinery. S. 1746-1760

Volltext auf 'Open Access LMU' nicht verfügbar.

Abstract

We consider the problem of specifying and proving the security of non-trivial, concurrent programs that intentionally leak information. We present a method that decomposes the problem into (a) proving that the program only leaks information it has declassified via assume annotations already widely used in deductive program verification; and (b) auditing the declassifications against a declarative security policy. We show how condition (a) can be enforced by an extension of the existing program logic SecCSL, and how (b) can be checked by proving a set of simple entailments. Part of the challenge is to define respective semantic soundness criteria and to formally connect these to the logic rules and policy audit. We support our methodology in an auto-active program verifier, which we apply to verify the implementations of various case study programs against a range of declassification policies.

Dokument bearbeiten Dokument bearbeiten