Short Talk: Generalising secure compilation criteria
summary
Proposes a concrete framework that extends robust property preservation (RHP) and reduction/backtranslation (RHC) to cover probabilistic behaviors, cryptographic reductions, and computability-style recognizers by making behavior maps return quotients like computational indistinguishability classes; parameterizes the linking operator (arity, defender-first games) and preserves the RHP↔RHC correspondence used in existing layout-randomization and symbolic→computational compilers. Presents design tradeoffs, two concrete mapping ideas, and remaining open issues about splitting semantics from security.
AI-written summary · about
related talks
25mUniversal Composability is Secure Compilation
25mA Semantic Approach to Robust Property Preservation
26mEndangered by the Language But Saved by the Compiler: Robust Safety via Semantic(…)
12mFully Abstract and Robust Compilation and How to Reconcile the Two, Abstractly
25mComposing Secure Compilers
22mComputational-Bounded Robust Compilation and Universally Composable Security
20mLifting Compiler Security Properties to Stronger Attackers: the Speculation Cas...
14mNon-interference Preserving Optimising Compilation