
Is the security of quantum cryptography guaranteed by the laws of physics?
It is often claimed that the security of quantum key distribution (QKD) ...
read it

When logic lays down the law
We analyse socalled computable laws, i.e., laws that can be enforced by...
read it

Integrating Amdahllike Laws and Divisible Load Theory
Integrating Amdahl's and Amdahllike laws with Divisible Load Theory pro...
read it

Distributive Laws for Monotone Specifications
Turi and Plotkin introduced an elegant approach to structural operationa...
read it

Interaction laws of monads and comonads
We introduce and study functorfunctor and monadcomonad interaction law...
read it

Secure Optimization Through Opaque Observations
Secure applications implement software protections against sidechannel ...
read it

Proving Type Class Laws for Haskell
Type classes in Haskell are used to implement adhoc polymorphism, i.e. ...
read it
A categorical approach to secure compilation
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 wellbehavedness properties of distributive laws to construct a categorical argument for the contextual connotations of bisimilarity.
READ FULL TEXT
Comments
There are no comments yet.