A categorical approach to secure compilation

04/07/2020
by   Stelios Tsampas, et al.
0

We introduce a novel approach to secure compilation based on maps of distributive laws. We demonstrate through four examples that the coherence criterion for maps of distributive laws can potentially be a viable alternative for compiler security instead of full abstraction, which is the preservation and reflection of contextual equivalence. To that end, we also make use of the well-behavedness properties of distributive laws to construct a categorical argument for the contextual connotations of bisimilarity.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/12/2018

Is the security of quantum cryptography guaranteed by the laws of physics?

It is often claimed that the security of quantum key distribution (QKD) ...
research
05/07/2022

Weakening and Iterating Laws using String Diagrams

Distributive laws are a standard way of combining two monads, providing ...
research
10/06/2018

When logic lays down the law

We analyse so-called computable laws, i.e., laws that can be enforced by...
research
02/05/2019

Integrating Amdahl-like Laws and Divisible Load Theory

Integrating Amdahl's and Amdahl-like laws with Divisible Load Theory pro...
research
09/04/2017

Distributive Laws for Monotone Specifications

Turi and Plotkin introduced an elegant approach to structural operationa...
research
07/12/2022

The d-separation criterion in Categorical Probability

The d-separation criterion detects the compatibility of a joint probabil...
research
01/15/2021

Secure Optimization Through Opaque Observations

Secure applications implement software protections against side-channel ...

Please sign up or login with your details

Forgot password? Click here to reset