Accepted Papers

• ---

• Information Flow Control for Distributed Trusted Execution Environments
• A. Gollamudi, S. Chong, O. Arden

• ---

• Using Information Flow to Design an ISA that Controls Timing Channels
• D. Zagieboylo, G. Suh, A. Myers

• ---

• Decidability of a Sound Set of Inference Rules for Computational Indistinguishability
• A. Koutsos

• ---

• Temporal safety for stack allocated memory on capability machines
• S. Tsampas, D. Devriese, F. Piessens

• ---

• Formalizing Constructive Cryptography using CryptHOL
• A. Lochbihler, S. Sefidgar, D. Basin, U. Maurer

• ---

• Beyond Labels: Permissiveness for Dynamic Information Flow Enforcement
• E. Kozyri, F. Schneider, A. Bedford, J. Desharnais, N. Tawbi

• ---

• Optimising Faceted Secure Multi-Execution
• M. Algehed, A. Russo, C. Flanagan

• ---

• How to wrap it up - A formally verified proposal for the use of authenticated wrapping in PKCS#11
• A. Dax, S. Tangermann, R. Künnemann, M. Backes

• ---

• Re-thinking untraceability in the CryptoNote-style blockchain
• J. Yu, M. Au, P. Esteves-Verissimo

• ---

• Resource-Bounded Intruders in Denial of Service Attacks
• A. Urquiza, M. AlTurki, M. Kanovich, T. Kirigin, V. Nigam, A. Scedrov, C. Talcott

• ---

• Symbolic methods in computational cryptography proofs
• G. Barthe, B. Grégoire, C. Jacomme, S. Kremer, P. Strub

• ---

• Journey Beyond Full Abstraction: Exploring Robust Property Preservation for Secure Compilation
• C. Abate, R. Blanco, D. Garg, C. Hritcu, M. Patrignani, J. Thibault

• ---

• Securing Cross-App Interactions in IoT Platforms
• M. Balliu, M. Merro, M. Pasqua

• ---

• Games for Security under Adaptive Adversaries
• T. Antonopoulos, T. Terauchi

• ---

• Time-dependent Decision-making and Decentralization in Proof-of-Work Cryptocurrencies
• Y. Zolotavkin, J. Garcia, J. Liu

• ---

• A Formal Approach to Secure Speculation
• K. Cheang, C. Rasmussen, S. Seshia, P. Subramanyan

• ---

• BeleniosVS: Secrecy and Verifiability against a Corrupted Voting Device
• V. Cortier, A. Filipiak, J. Lallemand

• ---

• Static enforcement of security in runtime systems
• M. Pedersen, A. Askarov

• ---

• Canonical Representations Of k-Safety-Hyperproperties
• B. Finkbeiner, L. Haas, H. Torfah

• ---

• Efficient attack-defense tree analysis using Pareto attribute domains
• B. Fila, W. Wideł

• ---

• Prime, Order Please! Revisiting Small Subgroup and Invalid Curve Attacks on Protocols using Diffie-Hellman
• C. Cremers, D. Jackson

• ---

• Automated Verification of Accountability in Security Protocols
• R. Künnemann, I. Esiyok, M. Backes

• ---

• Information-Flow Preservation in Compiler Optimisations
• A. Dang, F. Besson, T. Jensen

• ---

• Channel Design for Minimum Leakage: an Asymptotic Analysis
• A. Américo, M. Khouzani, P. Malacaria

• ---

• Timing Leaks and Coarse-Grained Clocks
• P. Vasilikos, F. Nielson, H. Nielson, B. Köpf

• ---

• Quantifying information flow in interactive systems
• D. Mestel

• ---

• EasyUC: Using EasyCrypt to Mechanize Proofs of Universally Composable Security
• R. Canetti, A. Stoughton, M. Varia

• ---

• Analysis of Deterministic Longest-Chain Protocols
• E. Shi

• ---

• On the Meaning and Purpose of Attack Trees
• H. Mantel, C. Probst

• ---

• Comparing Systems: Max-case Refinement Orders and Application to Differential Privacy
• K. Chatzikokolakis, N. Fernandes, C. Palamidessi