Computationally Bounded Robust Compilation and Universally Composable Security. (arXiv:2401.15041v1 [cs.CR])

Universal Composability (UC) is the gold standard for cryptographic security,
but mechanizing proofs of UC is notoriously difficult. A recently-discovered
connection between UC and Robust Compilation (RC)$\unicode{x2014}$a novel
theory of secure compilation$\unicode{x2014}$provides a means to verify UC
proofs using tools that mechanize equality results. Unfortunately, the existing
methods apply only to perfect UC security, and real-world protocols relying on
cryptography are only computationally secure.

This paper addresses this gap by lifting the connection between UC and RC to
the computational …

arxiv composability cryptographic cryptographic security equality novel results security standard theory tools unicode verify