| SoK: Verifiability Notions for E-Voting Protocols | 16 | 0.66 | 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 |
| Formal Analysis of Chaumian Mix Nets with Randomized Partial Checking | 10 | 0.55 | 2014 |
| Extending and Applying a Framework for the Cryptographic Verification of Java Programs. | 74 | 1.48 | 2014 |
| A Framework for the Cryptographic Verification of Java-Like Programs | 19 | 0.69 | 2012 |
| Clash Attacks on the Verifiability of E-Voting Systems | 30 | 0.99 | 2012 |
| Reducing Protocol Analysis with XOR to the XOR-Free Case in the Horn Theory Based Approach | 33 | 1.22 | 2011 |
| Verifiability, Privacy, and Coercion-Resistance: New Insights from a Case Study | 32 | 1.08 | 2011 |
| Accountability: definition and relationship to verifiability | 37 | 1.33 | 2010 |
| A Formal Definition of Online Abuse-Freeness | 2 | 0.39 | 2010 |
| Proving coercion-resistance of scantegrity II | 14 | 0.65 | 2010 |
| Using ProVerif to Analyze Protocols with Diffie-Hellman Exponentiation | 39 | 1.24 | 2009 |
| An Epistemic Approach to Coercion-Resistance for Electronic Voting Protocols | 42 | 1.20 | 2009 |
| Improving and Simplifying a Variant of Prêt à Voter | 1 | 0.35 | 2009 |
| A Game-Based Definition of Coercion-Resistance and Its Applications | 22 | 0.75 | 2009 |
| On the automatic analysis of recursive security protocols with XOR | 13 | 0.63 | 2007 |
| Infinite State AMC-Model Checking for Cryptographic Protocols | 10 | 0.56 | 2007 |
| Regular protocols and attacks with regular knowledge | 5 | 0.46 | 2005 |
| Selecting Theories and Recursive Protocols | 15 | 0.63 | 2005 |
| Optimal Complexity Bounds for Positive LTL Games | 2 | 0.47 | 2002 |
| Polymorphic directional types for logic programming | 4 | 0.37 | 2001 |
