Program
9:00-11:00 Session 1 (Chair: Sjouke Mauw)
On Formal Specification and Analysis of Security Policies
Cryptographic Protocols From Declarative Specifications
Analysing security requirements formally and flexibly based on suspicion
Dynamic privacy regulations in modal logic
Accountability: Definition and Relationship to Verifiability
Formal Verification of Consensus algorithms in a Proof Assistant
11:00-11:30 Coffee Break and Poster Session
11:30-12:30 Invited Talk (Chair: Michael Backes)
Cryptographic Hash Functions and the NIST SHA-3 Competition
12:30-13:30 Lunch Break
13:30-15:30 Session 2 (Chair: Michaël Rusinowitch)
Universally Composable Incoercibility
Ideal Key Derivation and Encryption in Simulation-based Security
A Signature Scheme for Distributed Executions based on Macro-Dataflow Analysis
Anonymous Webs of Trust
Computational Soundness of Protocol Implementations
Game-Based Verification of Multi-Party Contract Signing Protocols
15:30-16:00 Coffee Break and Poster Session
16:00-18:00 Session 3 (Chair: Ralf Küsters)
Untraceable RFID protocols are not trivially composable: Attacks on the revision of EC-RAC
Speaker Recognition in Encrypted Voice Streams
Architectural dependability evaluation with Arcade using XML
Automatic analysis of firewalls using tree automata
Analyzing Malware by Kernel Methods and Support Vector Machines
On the Optimisation of Adaptive Error Oracle Attacks
Posters
Fuzzing IPv6 and Game Theory
Discovering Fraud Behaviour in Call Detailed Records
Validating Implicit Induction Proofs Using Certified Proof Environments
Data Mining NetFlow Records