| A Security Framework for Distributed Ledgers | 0 | 0.34 | 2021 |
| Accountability in a Permissioned Blockchain: Formal Analysis of Hyperledger Fabric | 0 | 0.34 | 2020 |
| Joint State Composition Theorems for Public-Key Encryption and Digital Signature Functionalities with Local Computation | 0 | 0.34 | 2020 |
| Practical Yet Composably Secure Cryptographic Protocols (Dagstuhl Seminar 19042). | 0 | 0.34 | 2019 |
| An Extensive Formal Security Analysis of the OpenID Financial-Grade API | 3 | 0.38 | 2019 |
| The Web SSO Standard OpenID Connect: In-depth Formal Security Analysis and Security Guidelines | 5 | 0.47 | 2017 |
| A Framework for Universally Composable Diffie-Hellman Key Exchange | 0 | 0.34 | 2017 |
| Universal Composition with Responsive Environments. | 4 | 0.42 | 2016 |
| Verifiability Notions for E-Voting Protocols. | 0 | 0.34 | 2016 |
| sElect: A Lightweight Verifiable Remote Voting System | 7 | 0.49 | 2016 |
| A Hybrid Approach for Proving Noninterference of Java Programs. | 12 | 0.48 | 2015 |
| Security In E-Voting | 0 | 0.34 | 2014 |
| Analyzing the BrowserID SSO System with Primary Identity Providers Using an Expressive Model of the Web. | 7 | 0.51 | 2014 |
| Extending and Applying a Framework for the Cryptographic Verification of Java Programs. | 74 | 1.48 | 2014 |
| The IITM Model: A Simple and Expressive Model for Universal Composability | 16 | 0.60 | 2013 |
| Ideal key derivation and encryption in simulation-based security | 4 | 0.48 | 2011 |
| What's in an Attribute? Consequences for the Least Common Subsumer | 0 | 0.34 | 2011 |
| Security and Rewriting (Dagstuhl Seminar 11332). | 0 | 0.34 | 2011 |
| Reducing Protocol Analysis with XOR to the XOR-Free Case in the Horn Theory Based Approach | 33 | 1.22 | 2011 |
| Composition theorems without pre-established session identifiers | 18 | 0.77 | 2011 |
| A Formal Definition of Online Abuse-Freeness | 2 | 0.39 | 2010 |
| Proving coercion-resistance of scantegrity II | 14 | 0.65 | 2010 |
| Deciding strategy properties of contract-signing protocols | 0 | 0.34 | 2010 |
| Universally Composable Symmetric Encryption | 10 | 0.53 | 2009 |
| Using ProVerif to Analyze Protocols with Diffie-Hellman Exponentiation | 39 | 1.24 | 2009 |
| Computational soundness for key exchange protocols with symmetric encryption | 12 | 0.56 | 2009 |
| Improving and Simplifying a Variant of Prêt à Voter | 1 | 0.35 | 2009 |
| On the Relationships between Notions of Simulation-Based Security | 17 | 0.70 | 2008 |
| Conditional reactive simulatability | 3 | 0.38 | 2008 |
| Joint State Theorems for Public-Key Encryption and Digital Signature Functionalities with Local Computation | 15 | 0.64 | 2008 |
| Joint workshop on foundations of computer security and automated reasoning for security protocol analysis (FCS-ARSPA ’06) | 0 | 0.34 | 2008 |
| Complexity results for security protocols with Diffie-Hellman exponentiation and commuting public key encryption | 7 | 0.45 | 2008 |
| Transducer-based analysis of cryptographic protocols | 2 | 0.37 | 2007 |
| On the automatic analysis of recursive security protocols with XOR | 13 | 0.63 | 2007 |
| A cryptographic model for branching time security properties: the case of contract signing protocols | 6 | 0.46 | 2007 |
| Selecting theories and nonce generation for recursive protocols | 6 | 0.42 | 2007 |
| On simulatability soundness and mapping soundness of symbolic cryptography | 7 | 0.52 | 2007 |
| Infinite State AMC-Model Checking for Cryptographic Protocols | 10 | 0.56 | 2007 |
| Implementing a Unification Algorithm for Protocol Analysis with XOR | 4 | 0.46 | 2006 |
| Computationally sound symbolic secrecy in the presence of hash functions | 30 | 1.25 | 2006 |
| A dolev-yao-based definition of abuse-free protocols | 12 | 0.72 | 2006 |
| Proceedings of the 2005 ACM workshop on Formal methods in security engineering, FMSE 2005, Fairfax, VA, USA, November 11, 2005 | 7 | 0.54 | 2005 |
| Constraint Solving for Contract-Signing Protocols | 10 | 0.55 | 2005 |
| Deciding the Security of Protocols with Commuting Public Key Encryption | 11 | 0.73 | 2005 |
| Structural Subsumption and Least Common Subsumers in a Description Logic with Existential and Number Restrictions | 7 | 0.57 | 2005 |
| Deciding properties of contract-signing protocols | 11 | 0.58 | 2005 |
| Automata-Based Analysis of Recursive Cryptographic Protocols | 16 | 0.76 | 2004 |
| Deciding the Security of Protocols with Diffie-Hellman Exponentiation and Products in Exponents | 70 | 3.12 | 2003 |
| An NP Decision Procedure for Protocol Insecurity with XOR | 114 | 4.61 | 2003 |
| Extensions to description logics | 19 | 1.39 | 2003 |
