• 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 23 matches

• 2009
• 
  Aslan Askarov, Andrei Sabelfeld:
  Tight Enforcement of Information-Release Policies for Dynamic Languages. CSF 2009: 43-59
• 
  Michael Backes, Martin P. Grochulla, Catalin Hritcu, Matteo Maffei:
  Achieving Security Despite Compromise Using Zero-knowledge. CSF 2009: 308-323
• 
  Moritz Y. Becker:
  Specification and Analysis of Dynamic Authorisation Policies. CSF 2009: 203-217
• 
  Karthikeyan Bhargavan, Ricardo Corin, Pierre-Malo Deniélou, Cédric Fournet, James J. Leifer:
  Cryptographic Protocol Synthesis and Verification for Multiparty Sessions. CSF 2009: 124-140
• 
  Christian Cachin, Nishanth Chandran:
  A Secure Cryptographic Token Interface. CSF 2009: 141-153
• 
  Sagar Chaki, Anupam Datta:
  ASPIER: An Automated Framework for Verifying Security Protocol Implementations. CSF 2009: 172-185
• 
  Richard M. Chang, Guofei Jiang, Franjo Ivancic, Sriram Sankaranarayanan, Vitaly Shmatikov:
  Inputs of Coma: Static Detection of Denial-of-Service Vulnerabilities. CSF 2009: 186-199
• 
  Najah Chridi, Mathieu Turuani, Michaël Rusinowitch:
  Decidable Analysis for a Class of Cryptographic Group Protocols with Unbounded Lists. CSF 2009: 277-289
• 
  Véronique Cortier, Stéphanie Delaune:
  A Method for Proving Observational Equivalence. CSF 2009: 266-276
• 
  Gilberto Filé, Roberto Vigo:
  Expressive Power of Definite Clauses for Verifying Authenticity. CSF 2009: 251-265
• 
  J. Nathan Foster, Benjamin C. Pierce, Steve Zdancewic:
  Updatable Security Views. CSF 2009: 60-74
• 
  Chris Hankin, Flemming Nielson, Hanne Riis Nielson:
  Advice from Belnap Policies. CSF 2009: 234-247
• 
  Aaron Johnson, Paul F. Syverson:
  More Anonymous Onion Routing Through Trust. CSF 2009: 3-12
• 
  Max I. Kanovich, Paul D. Rowe, Andre Scedrov:
  Policy Compliance in Collaborative Systems. CSF 2009: 218-233
• 
  Boris Köpf, Markus Dürmuth:
  A Provably Secure and Efficient Countermeasure against Timing Attacks. CSF 2009: 324-335
• 
  Ralf Küsters, Tomasz Truderung:
  Using ProVerif to Analyze Protocols with Diffie-Hellman Exponentiation. CSF 2009: 157-171
• 
  Ralf Küsters, Max Tuengerthal:
  Universally Composable Symmetric Encryption. CSF 2009: 293-307
• 
  Sergio Maffeis, Ankur Taly:
  Language-Based Isolation of Untrusted JavaScript. CSF 2009: 77-91
• 
  Sjouke Mauw, Sasa Radomirovic, Mohammad Torabi Dashti:
  Minimal Message Complexity of Asynchronous Multi-party Contract Signing. CSF 2009: 13-25
• 
  Phillip Rogaway, Till Stegers:
  Authentication without Elision: Partially Specified Protocols, Associated Data, and Cryptographic Models Described by Code. CSF 2009: 26-39
• 
  Alejandro Russo, Andrei Sabelfeld:
  Securing Timeout Instructions in Web Applications. CSF 2009: 92-106
• 
  Patrick Schaller, Benedikt Schmidt, David A. Basin, Srdjan Capkun:
  Modeling and Verifying Physical Properties of Security Protocols for Wireless Networks. CSF 2009: 109-123
• 
  Proceedings of the 22nd IEEE Computer Security Foundations Symposium, CSF 2009, Port Jefferson, New York, USA, July 8-10, 2009. IEEE Computer Society 2009, ISBN 978-0-7695-3712-2 [contents]