Universal Composability Is Robust Compilation
ACM Transactions on Programming Languages and Systems · 31.12.2024 · 46 (4) · 1-64
DOI: 10.1145/3698234 ↗Kurz gefasst
Fachartikel in der Zeitschrift ACM Transactions on Programming Languages and Systems, online erschienen am 31.12.2024. Verfasst von Marco Patrignani und 3 weiteren Autor:innen. Die Arbeit wurde bisher 1-mal zitiert (Crossref) und nennt 93 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Office of Naval Research, German Federal Ministry of Education and Research.
Abstract (Originalsprache)
This article discusses the relationship between two frameworks: universal composability ( \(\mathsf{UC}\) ) and robust compilation ( RC ). In cryptography, \(\mathsf{UC}\) is a framework for the specification and analysis of cryptographic protocols with a strong compositionality guarantee: \(\mathsf{UC}\) protocols remain secure even when composed with other protocols. In programming language security, RC is a novel framework for determining secure compilation by proving whether compiled programs are as secure as their source-level counterparts no matter what target-level code they interact with. Presently, these disciplines are studied in isolation, though we argue that there is a deep connection between them and exploring this connection will benefit both research fields. This article formally proves the connection between \(\mathsf{UC}\) and RC and then it explores the benefits of this connection (focussing on perfect, rather than computational \(\mathsf{UC}\) ). For this, this article first identifies which conditions must programming languages fulfil in order to possibly attain \(\mathsf{UC}\) -like composition. Then, it proves \(\mathsf{UC}\) of both an existing and a new commitment protocol as a corollary of the related compilers attaining RC . Finally, it mechanises these proofs in DEEPSEC, obtaining symbolic guarantees that the protocol is indeed \(\mathsf{UC}\) . Our connection lays the groundwork towards a better and deeper understanding of both \(\mathsf{UC}\) and RC , and the benefits we showcase from this connection provide evidence of scalable mechanised proofs for \(\mathsf{UC}\) .
Förderung
- Office of Naval Research
- German Federal Ministry of Education and Research
Zitieren
APA
Patrignani, M., Künnemann, R., Wahby, R. S., & Cecchetti, E. (2024). Universal Composability Is Robust Compilation. ACM Transactions on Programming Languages and Systems, 46(4), 1-64. https://doi.org/10.1145/3698234
Vancouver
Patrignani M, Künnemann R, Wahby RS, Cecchetti E. Universal Composability Is Robust Compilation. ACM Transactions on Programming Languages and Systems. 2024;46(4):1-64. doi:10.1145/3698234
BibTeX
@article{Patrignani2024,
author = {Patrignani, Marco and Künnemann, Robert and Wahby, Riad S. and Cecchetti, Ethan},
title = {Universal Composability Is Robust Compilation},
journal = {ACM Transactions on Programming Languages and Systems},
year = {2024},
volume = {46},
number = {4},
pages = {1--64},
doi = {10.1145/3698234}
}
EUVIMED