• case-insensitive prefix search: default
  e.g., sig matches "SIGIR" as well as "signal"
• exact word search: append dollar sign ($) to word
  e.g., graph$ matches "graph", but not "graphics"
• boolean and: separate words by space
  e.g., codd model
• boolean or: connect words by pipe symbol (|)
  e.g., graph|network

Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.

found 24 matches

• 2010
• 
  Martín Abadi, Gordon D. Plotkin:
  On Protection by Layout Randomization. CSF 2010: 337-351
• 
  Devdatta Akhawe, Adam Barth, Peifung E. Lam, John C. Mitchell, Dawn Song:
  Towards a Formal Foundation of Web Security. CSF 2010: 290-304
• 
  Myrto Arapinis, Tom Chothia, Eike Ritter, Mark Ryan:
  Analysing Unlinkability and Anonymity Using the Applied Pi Calculus. CSF 2010: 107-121
• 
  Mathilde Arnaud, Véronique Cortier, Stéphanie Delaune:
  Modeling and Verifying Ad Hoc Routing Protocols. CSF 2010: 59-74
• 
  Gilles Barthe, Daniel Hedin, Santiago Zanella Béguelin, Benjamin Grégoire, Sylvain Heraud:
  A Machine-Checked Formalization of Sigma-Protocols. CSF 2010: 246-260
• 
  Gilles Barthe, Alejandro Hevia, Zhengqin Luo, Tamara Rezk, Bogdan Warinschi:
  Robustness Guarantees for Anonymity. CSF 2010: 91-106
• 
  Lujo Bauer, Limin Jia, Divya Sharma:
  Constraining Credential Usage in Logic-Based Access Control. CSF 2010: 154-168
• 
  Moritz Y. Becker:
  Information Flow in Credential Systems. CSF 2010: 171-185
• 
  Mayla Brusò, Konstantinos Chatzikokolakis, Jerry den Hartog:
  Formal Verification of Privacy for RFID Systems. CSF 2010: 75-88
• 
  Stephen Chong:
  Required Information Release. CSF 2010: 215-227
• 
  Andrey Chudnov, David A. Naumann:
  Information Flow Monitor Inlining. CSF 2010: 200-214
• 
  Stefan Ciobaca, Véronique Cortier:
  Protocol Composition for Arbitrary Primitives. CSF 2010: 322-336
• 
  Michael R. Clarkson, Fred B. Schneider:
  Quantification of Integrity. CSF 2010: 28-43
• 
  Juan A. Garay, Aggelos Kiayias, Hong-Sheng Zhou:
  A Framework for the Sound Specification of Cryptographic Tasks. CSF 2010: 277-289
• 
  Boris Köpf, Andrey Rybalchenko:
  Approximation and Randomization for Quantitative Information-Flow Analysis. CSF 2010: 3-14
• 
  Boris Köpf, Geoffrey Smith:
  Vulnerability Bounds and Leakage Resilience of Blinded Cryptography under Timing Attacks. CSF 2010: 44-56
• 
  Ralf Küsters, Tomasz Truderung, Andreas Vogt:
  A Game-Based Definition of Coercion-Resistance and Its Applications. CSF 2010: 122-136
• 
  Adam J. Lee, Ting Yu:
  Towards Quantitative Analysis of Proofs of Authorization: Applications, Framework, and Techniques. CSF 2010: 139-153
• 
  Simon Meier, Cas Cremers, David A. Basin:
  Strong Invariants for the Efficient Construction of Machine-Checked Protocol Security Proofs. CSF 2010: 231-245
• 
  Alejandro Russo, Andrei Sabelfeld:
  Dynamic vs. Static Flow-Sensitive Security Analysis. CSF 2010: 186-199
• 
  Benedikt Schmidt, Patrick Schaller, David A. Basin:
  Impossibility Results for Secret Establishment. CSF 2010: 261-273
• 
  Alwen Tiu, Jeremy E. Dawson:
  Automating Open Bisimulation Checking for the Spi Calculus. CSF 2010: 307-321
• 
  Hirotoshi Yasuoka, Tachio Terauchi:
  Quantitative Information Flow - Verification Hardness and Possibilities. CSF 2010: 15-27
• 
  Proceedings of the 23rd IEEE Computer Security Foundations Symposium, CSF 2010, Edinburgh, United Kingdom, July 17-19, 2010. IEEE Computer Society 2010, ISBN 978-0-7695-4082-5 [contents]