24. CSF 2011: Cernay-la-Ville, France

Proceedings of the 24th IEEE Computer Security Foundations Symposium, CSF 2011, Cernay-la-Ville, France, 27-29 June, 2011. IEEE Computer Society 2011, ISBN 978-1-61284-644-6

Security Protocol Verification I

François Dupressoir, Andrew D. Gordon, Jan Jürjens, David A. Naumann:
Guiding a General-Purpose C Verifier to Prove Cryptographic Protocols. 3-17
Simone Frau, Mohammad Torabi Dashti:
Integrated Specification and Verification of Security Protocols and Policies. 18-32
Myrto Arapinis, Eike Ritter, Mark Dermot Ryan:
StatVerif: Verification of Stateful Processes. 33-47

Security Protocol Verification II

Long Ngo, Colin Boyd, Juanma González Nieto:
Automated Proofs for Diffie-Hellman-Based Key Exchanges. 51-65
Stéphanie Delaune, Steve Kremer, Mark Dermot Ryan, Graham Steel:
Formal Analysis of Protocols Based on TPM State Registers. 66-80

Authorization and Security Policies

Michele Bugliesi, Stefano Calzavara, Fabienne Eigner, Matteo Maffei:
Resource-Aware Authorization Policies for Statically Typed Cryptographic Protocols. 83-98
David A. Basin, Samuel J. Burri, Günter Karjoth:
Obstruction-Free Authorization Enforcement: Aligning Security with Business Objectives. 99-113
Piotr Mardziel, Stephen Magill, Michael Hicks, Mudhakar Srivatsa:
Dynamic Enforcement of Knowledge-Based Security Policies. 114-128

Language-Based Security

Cole Schlesinger, Karthik Pattabiraman, Nikhil Swamy, David Walker, Benjamin G. Zorn:
Modular Protections against Non-control Data Attacks. 131-145
Scott Moore, Stephen Chong:
Static Analysis for Efficient Hybrid Information-Flow Control. 146-160
Radha Jagadeesan, Corin Pitcher, Julian Rathke, James Riely:
Local Memory via Layout Randomization. 161-174

Information Flow

Tom Chothia, Apratim Guha:
A Statistical Test for Information Leaks Using Continuous Mutual Information. 177-190
Gilles Barthe, Boris Köpf:
Information-Theoretic Bounds for Differentially Private Mechanisms. 191-204
Pavol Cerný, Krishnendu Chatterjee, Thomas A. Henzinger:
The Complexity of Quantitative Information Flow Problems. 205-217
Heiko Mantel, David Sands, Henning Sudbrock:
Assumptions and Guarantees for Compositional Noninterference. 218-232

Security Notions and Specifications

Thomas Groß, Sebastian Mödersheim:
Vertical Protocol Composition. 235-250
Dominique Unruh:
Termination-Insensitive Computational Indistinguishability (and Applications to Computational Soundness). 251-265
Steve Kremer, Graham Steel, Bogdan Warinschi:
Security for Key Management Interfaces. 266-280
James Cheney:
A Formal Framework for Provenance Security. 281-293

Privacy and Anonymity

Véronique Cortier, Ben Smyth:
Attacking and Fixing Helios: An Analysis of Ballot Secrecy. 297-311
Jeremiah Blocki, Nicolas Christin, Anupam Datta, Arunesh Sinha:
Regret Minimizing Audits: A Learning-Theoretic Basis for Privacy Protection. 312-327

Last update Sat May 25 02:38:50 2013 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page