%0 Conference Proceedings
%T Secure Multi-Execution through Static Program Transformation
%+ Institute IMDEA Software [Madrid]
%+ FUTURE HEALTH DEPARTMENT [KU Leuven] (KU-IBBT)
%+ Distributed Systems and Computer Networks (DistriNet)
%A Barthe, Gilles
%A Crespo, Juan, Manuel
%A Devriese, Dominique
%A Piessens, Frank
%A Rivas, Exequiel
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 14th International Conference on Formal Methods for Open Object-Based Distributed Systems (FMOODS) / 32nd International Conference on Formal Techniques for Networked and Distributed Systems (FORTE)
%C Stockholm, Sweden
%Y Holger Giese
%Y Grigore Rosu
%I Springer
%3 Formal Techniques for Distributed Systems
%V LNCS-7273
%P 186-202
%8 2012-06-13
%D 2012
%R 10.1007/978-3-642-30793-5_12
%Z Computer Science [cs]
%Z Computer Science [cs]/Networking and Internet Architecture [cs.NI]Conference papers
%X Secure multi-execution (SME) is a dynamic technique to ensure secure information flow. In a nutshell, SME enforces security by running one execution of the program per security level, and by reinterpreting input/output operations w.r.t. their associated security level. SME is sound, in the sense that the execution of a program under SME is non-interfering, and precise, in the sense that for programs that are non-interfering in the usual sense, the semantics of a program under SME coincides with its standard semantics. A further virtue of SME is that its core idea is language-independent; it can be applied to a broad range of languages. A downside of SME is the fact that existing implementation techniques require modifications to the runtime environment, e.g. the browser for Web applications. In this article, we develop an alternative approach where the effect of SME is achieved through program transformation, without modifications to the runtime, thus supporting server-side deployment on the web. We show on an exemplary language with input/output and dynamic code evaluation (modeled after JavaScript’s eval) that our transformation is sound and precise. The crux of the proof is a simulation between the execution of the transformed program and the SME execution of the original program. This proof has been machine-checked using the Agda proof assistant. We also report on prototype implementations for a small fragment of Python and a substantial subset of JavaScript.
%G English
%Z TC 6
%Z WG 6.1
%2 https://inria.hal.science/hal-01528736/document
%2 https://inria.hal.science/hal-01528736/file/978-3-642-30793-5_12_Chapter.pdf
%L hal-01528736
%U https://inria.hal.science/hal-01528736
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-WG
%~ IFIP-TC6
%~ IFIP-WG6-1
%~ IFIP-FORTE
%~ IFIP-FMOODS
%~ IFIP-LNCS-7273