Grande Region Security and Reliability Day 2017

March 9, 2017 – University of Luxembourg

logo logo logo
9:00 – 9:30 Registration
9:30 – 9:35 Welcome
9:35 – 11:05 Session 1: Cryptography
Jose M. Lopez, Marjan Skrobot and Vincenzo Iovino.
On the Relation Between SIM and IND-RoR Security Models for PAKEs
Daniel Dinu, Alex Biryukov, Johann Großschädl, Dmitry Khovratovich, Yann Le Corre and Léo Perrin.
FELICS – Fair Evaluation of Lightweight Cryptographic Systems
Michael Backes, Amir Herzberg, Aniket Kate and Ivan Pryvalov.
Touch-or-Change: Multi-User Privacy and Integrity in Universally Re-randomizable Encryption
Daniel Dinu, Léo Perrin, Aleksei Udovenko, Vesselin Velichkov, Johann Großschädl and Alex Biryukov.
Design Strategies for ARX with Provable Bounds: SPARX and LAX.
Sjouke Mauw, Jorge Toro-Pozo and Rolando Trujillo-Rasua.
On the Optimality of Secure Distance Bounding
Gina Gallegos-Garcia, Vincenzo Iovino, Alfredo Rial, Peter Roenne and Peter Ryan.
(Universal) Unconditional Verifiability in E-Voting without Trusted Parties
11:05 – 11:30 Coffee break
11:30 – 12:30 Invited Talk
Dominique Unruh
Fiat-Shamir and the Quantum Forking Conjecture
Fiat-Shamir is a popular construction in classical cryptography for constructing signature schemes (and non-interactive proof systems). However, when considering security against quantum attackers, the security of Fiat-Shamir is largely unknown; all we know are negative results for various cases. In the present talk, we show progress towards a security proof for Fiat-Shamir. We introduce a new conjecture, the "Quantum Forking Conjecture" (QFC). The QFC is a problem in quantum query complexity. We show that if the QFC holds, then Fiat-Shamir is secure. This reduces a complex cryptographic question (involving quantum polynomial-time adversaries etc.) to a (hopefully simpler) query complexity problem.
12:30 – 14:00 Lunch
14:00 – 15:30 Session 2: Security Protocols and Privacy
Jannik Dreier, Charles Duménil, Steve Kremer and Ralf Sasse.
Beyond Subterm-Convergent Equational Theories in Automated Verification of Stateful Protocols
Véronique Cortier, Niklas Grimm, Joseph Lallemand and Matteo Maffei.
A Type System for Protocol Equivalence
Kushal Babel, Vincent Cheval and Steve Kremer.
On Communication Models When Verifying Equivalence Properties
Michael Backes, Manuel Gomez-Rodriguez, Praveen Manoharan and Bartlomiej Surma.
Reconciling Privacy and Utility in Continuous-Time Diffusion Networks
Michael Backes, Jannik Dreier, Steve Kremer and Robert Künnemann.
A Novel Approach for Reasoning about Liveness in Cryptographic Protocols and its Application to Fair Exchange
Marcos Cramer and Giovanni Casini.
Postulates for Revocation Schemes
15:30 – 16:00 Coffee break
16:00 – 17:30 Session 3: Software, System and Network Security
Michael Backes, Joerg Hoffmann, Robert Künnemann, Patrick Speicher and Marcel Steinmetz.
Simulated Penetration Testing and Mitigation Analysis
Marcus Völp, Jérémie Decouchant, Francisco Rocha, Vincent Rahli and Paulo Verissimo.
Towards more Secure and Available SGX Enclaves - Enclave-Side Preemption Control
Marten Oltrogge, Yasemin Acar, Michael Backes, Sascha Fahl and Christian Stransky.
When Laziness Snaps Back - The Impact of Code Generators on App (In)Security
Matthias Höschele, Alexander Kampmann and Andreas Zeller.
Mining Input Grammars for Massive Security Testing
Michael Backes, Sven Bugiel, Jie Huang and Oliver Schranz.
The ART of App Compartmentalization: Compiler-based Library Privilege Separation on Stock Android
Ivana Vukotic, Vincent Rahli, Marcus Voelp and Paulo Verissimo.
Formalizing Differential Dynamic Logic in Coq