The Fox and the Hound: Comparing Fully Abstract and Robust Compilation

We prove a theorem relating fully abstract compilation (FAC) to robust compilation (preservation of satisfaction of arbitrary hyperproperties under adversarial contexts), showing that the former implies some variant of the latter, thus making the security guarantees of FAC more explicit. We illustrate our results with a simple example.