Descripción del proyecto
Compiladores seguros para lenguajes de programación realistas
Las cadenas de compilación actuales no son seguras, lo que provoca muchas vulnerabilidades graves en los sistemas informáticos. Sin embargo, la compilación segura sería difícil de conseguir con los mecanismos de protección de grano grueso que ofrecen las arquitecturas de «hardware» convencionales. Financiado por el Consejo Europeo de Investigación, el equipo del proyecto SECOMP pretende aprovechar las arquitecturas etiquetadas emergentes para desarrollar las primeras cadenas de compilación seguras y eficientes para lenguajes de programación realistas, como C y F*. Para alcanzar un nivel de seguridad sin precedentes y ofrecer un alto grado de confianza al respecto, el equipo definirá matemáticamente qué significa que las aplicaciones compartimentadas se compilen de forma segura. Además, verificará que las cadenas de compilación desarrolladas satisfagan esta definición formal de seguridad mediante una combinación de pruebas controladas automáticamente y pruebas basadas en las propiedades.
Objetivo
Severe low-level vulnerabilities abound in today’s computer systems, allowing cyber-attackers to remotely gain
full control. This happens in big part because our programming languages, compilers, and architectures were
designed in an era of scarce hardware resources and too often trade off security for efficiency. The semantics of
mainstream low-level languages like C is inherently insecure, and even for safer languages, establishing security
with respect to a high-level semantics does not guarantee the absence of low-level attacks. Secure compilation
using the coarse-grained protection mechanisms provided by mainstream hardware architectures would be too
inefficient for most practical scenarios. This project is aimed at leveraging emerging hardware capabilities
for fine-grained protection to build the first, efficient secure compilers for realistic programming languages,
both low-level (the C language) and high-level (ML and a dependently-typed variant). These compilers will
provide a secure semantics for all programs and will ensure that high-level abstractions cannot be violated
even when interacting with untrusted low-level code. To achieve this level of security without sacrificing
efficiency, our secure compilers will target a tagged architecture, which associates a metadata tag to each word
and efficiently propagates and checks tags according to software-defined rules. We will experimentally evaluate
and carefully optimize the efficiency of our secure compilers on realistic workloads and standard benchmark
suites. We will use property-based testing and formal verification to provide high confidence that our compilers
are indeed secure. Formally, we will construct machine-checked proofs of full abstraction with respect to
a secure high-level semantics. This strong property complements compiler correctness and ensures that no
machine-code attacker can do more harm to securely compiled components than a component in the secure
source language already could.
Ámbito científico
Palabras clave
Programa(s)
Régimen de financiación
ERC-STG - Starting GrantInstitución de acogida
80539 Munchen
Alemania