Journey Beyond Full Abstraction: Exploring Robust Property Preservation for Secure Compilation
| Autor: | Deepak Garg, Carmine Abate, Jérémy Thibault, Catalin Hritcu, Roberto Blanco, Marco Patrignani |
|---|---|
| Přispěvatelé: | Programming securely with cryptography (PROSECCO), Inria de Paris, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), Max Planck Institute for Software Systems (MPI-SWS), Stanford University, Helmholtz Center for Information Security [Saarbrücken] (CISPA), Programming securely with cryptography (PROSECCO ) |
| Jazyk: | angličtina |
| Rok vydání: | 2019 |
| Předmět: |
FOS: Computer and information sciences
Source code Computer Science - Cryptography and Security Property (programming) Computer science media_common.quotation_subject Writing Liveness Libraries 0102 computer and information sciences 02 engineering and technology [INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE] computer.software_genre 01 natural sciences [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR] 0202 electrical engineering electronic engineering information engineering Code (cryptography) Abstraction Observational equivalence Equivalence (measure theory) Safety Libraries Space exploration Cryptography Computer languages Writing media_common TRACE (psycholinguistics) Class (computer programming) [INFO.INFO-PL]Computer Science [cs]/Programming Languages [cs.PL] Computer Science - Programming Languages Space exploration Programming language [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO] 020207 software engineering 010201 computation theory & mathematics Cryptography Safety computer Cryptography and Security (cs.CR) Computer languages Programming Languages (cs.PL) |
| Zdroj: | 32nd IEEE Computer Security Foundations Symposium (CSF) 2019 IEEE 32nd Computer Security Foundations Symposium (CSF) CSF 2019-32nd IEEE Computer Security Foundations Symposium CSF 2019-32nd IEEE Computer Security Foundations Symposium, Jun 2019, Hoboken, United States. pp.256-271, ⟨10.1109/CSF.2019.00025⟩ CSF |
| DOI: | 10.1109/CSF.2019.00025 |
| Popis: | (CROPPED TO FIT IN ARXIV'S SILLY LIMIT. SEE PDF FOR COMPLETE ABSTRACT.) We are the first to thoroughly explore a large space of formal secure compilation criteria based on robust property preservation, i.e., the preservation of properties satisfied against arbitrary adversarial contexts. We study robustly preserving various classes of trace properties such as safety, of hyperproperties such as noninterference, and of relational hyperproperties such as trace equivalence. This leads to many new secure compilation criteria, some of which are easier to practically achieve and prove than full abstraction, and some of which provide strictly stronger security guarantees. For each of the studied criteria we propose an equivalent "property-free" characterization that clarifies which proof techniques apply. For relational properties and hyperproperties, which relate the behaviors of multiple programs, our formal definitions of the property classes themselves are novel. We order our criteria by their relative strength and show several collapses and separation results. Finally, we adapt existing proof techniques to show that even the strongest of our secure compilation criteria, the robust preservation of all relational hyperproperties, is achievable for a simple translation from a statically typed to a dynamically typed language. Long version of CSF'19 paper, including online appendix |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|