This paper discusses the relationship between two frameworks: universal composability (UC) and robust compilation ( RC ). In cryptography, UC is a framework for the specification and analysis of cryptographic protocols with a strong compositionality guarantee: 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 paper formally proves the connection between UC and RC and then it explores the benefits of this connection (focussing on perfect, rather than computational UC). For this, this paper first identifies which conditions must programming languages fulfil in order to possibly attain UC-like composition. Then, it proves 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 UC. Our connection lays the groundwork towards a better and deeper understanding of both UC and RC , and the benefits we showcase from this connection provide evidence of scalable mechanised proofs for UC. In order to differentiate various sub-parts of the UC and RC frameworks, we use syntax highlighting to a degree that colourblind and black&amp;white readers can benefit from [78]. UC talks about ideal functionalities (typeset in a verbatim, emerald font) and protocol implementations (typeset in a sans-serif, orange font). RC deals with source languages (typeset in an italics, blue font) and target ones (typeset in a bold, red font). Elements that are common to each framework are typeset in a black, sans-serif font for UC and in a black, italicised font for RC to avoid repetition. For a better experience, please view this paper in colour.

Marco Patrignani

Robert Künnemann

Riad S. Wahby

Ethan Cecchetti

ACM Transactions on Programming Languages and Systems

ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS (TOPLAS) 是报告编程语言领域最新研究进展的主要期刊，以及协助编程任务的系统。论文的风格可以是理论性的，也可以是实验性的，但无论哪种情况，它们都必须包含创新和新颖的内容，以推动编程语言和系统的最新发展。我们还邀请严格比较现有方法的实验论文，以及教程和调查论文。 TOPLAS 的范围包括但不限于以下主题： 用于顺序和并行编程的语言设计 编程语言实现 编程语言语义 编译器和解释器 用于程序执行存储分配和垃圾收集的运行时系统 用于编写程序规范的语言和方法 语言安全可靠的程序测试和程序验证方法及方法

The ACM Transactions on Programming Languages and Systems (TOPLAS) is a leading journal that reports on the latest research advancements in the field of programming languages and the systems that support programming tasks. The journal welcomes both theoretical and experimental papers, provided they contain innovative and novel content that advances the state of programming languages and systems. We also invite experimental papers that rigorously compare existing methods, as well as tutorial and survey papers. The scope of TOPLAS includes, but is not limited to, the following topics: language design for sequential and parallel programming, implementation of programming languages, semantics of programming languages, compilers and interpreters, runtime systems for program execution, memory allocation and garbage collection, languages and methods for writing program specifications, language safety, reliable program testing, and program verification methods.

《ACM Transactions on Programming Languages and Systems》（TOPLAS）是编程语言领域最新研究成果的重要期刊，致力于支持编程任务的系统研究。该期刊接受理论性和实验性的论文，但无论是哪种类型，论文都必须包含创新和新颖的内容，以推动编程语言和系统的发展。我们还欢迎对现有方法进行严格比较的实验论文，以及教程和调查性论文。TOPLAS的研究范围包括但不限于以下主题：顺序和并行编程的语言设计、编程语言的实现、编程语言的语义、编译器和解释器、用于程序执行的存储分配和垃圾收集的运行时系统、用于编写程序规范的语言和方法、语言安全性、可靠的程序测试和程序验证的方法。

Category	Quartile
计算机科学	2
计算机科学, 计算机软件工程	2

Universal Composability is Robust Compilation

ivySCI AI Smartly Parses PDF, Answers Researchers' Questions, and Helps You Understand Papers in Seconds

Journal Info

Category	Quartile
COMPUTER SCIENCE, SOFTWARE ENGINEERING	3