Universal Composability is Secure Compilation

10/18/2019
by   Marco Patrignani, et al.
0

Universal composability is a framework for the specification and analysis of cryptographic protocols with a strong compositionality guarantee: UC protocols are secure even when composed with other protocols. Secure compilation tells whether compiled programs are as secure as their source-level counterparts, no matter what target-level code they interact with. These two disciplines are studied in isolation, but we believe there is a deeper connection between them with benefits from both worlds to reap. This paper outlines the connection between universal composability and robust compilation, the latest of secure compilation theories. We show how to read the universal composability theorem in terms of a robust compilation theorem and vice-versa. This, in turn, shows which elements of one theory corresponds to which element in the other theory. We believe this is the first step towards understanding how can secure compilation theories be used in universal composability settings and vice-versa.

READ FULL TEXT

page 1

page 2

page 3

research
03/21/2018

A Theorem for Secrecy in Tagged Protocols Using the Theory of Witness-Functions

In this paper, we enunciate the theorem of secrecy in tagged protocols u...
research
04/11/2019

Privacy protocols

Security protocols enable secure communication over insecure channels. P...
research
01/05/2018

Secrecy by Witness-Functions under Equational Theories

In this paper, we use the witness-functions to analyze cryptographic pro...
research
08/30/2018

On the Composability of Statistically Secure Random Oblivious Transfer

We show that stand-alone statistically secure random oblivious transfer ...
research
05/11/2021

A Variety Theorem for Relational Universal Algebra

We develop an analogue of universal algebra in which generating symbols ...
research
11/29/2017

UC Secure Issuer-Free Adaptive Oblivious Transfer with Hidden Access Policy

Privacy is a major concern in designing any cryptographic primitive when...
research
01/27/2023

The Produoidal Algebra of Process Decomposition

We introduce the normal produoidal category of monoidal contexts over an...

Please sign up or login with your details

Forgot password? Click here to reset