| Predicting Asymptotic Behavior of Network Covert Channels: Experimental Results | 0 | 0.34 | 2022 |
| CryptoSolve: Towards a Tool for the Symbolic Analysis of Cryptographic Algorithms. | 0 | 0.34 | 2022 |
| Algorithmic Problems in the Symbolic Approach to the Verification of Automatically Synthesized Cryptosystems | 1 | 0.39 | 2021 |
| NExtSteP: An Extensible Testbed for Network Covert Channels | 0 | 0.34 | 2020 |
| Protocol Analysis with Time | 0 | 0.34 | 2020 |
| Formal verification of the YubiKey and YubiHSM APIs in Maude-NPA. | 0 | 0.34 | 2018 |
| Modular Verification of Sequential Composition for Private Channels in Maude-NPA. | 0 | 0.34 | 2018 |
| Effective Sequential Protocol Composition in Maude-NPA. | 2 | 0.38 | 2016 |
| Strand spaces with choice via a process algebra semantics. | 2 | 0.36 | 2016 |
| Analysis of the PKCS#11 API Using the Maude-NPA Tool. | 1 | 0.34 | 2015 |
| On Unification Modulo One-Sided Distributivity: Algorithms, Variants and Asymmetry. | 0 | 0.34 | 2015 |
| A rewriting-based forwards semantics for Maude-NPA | 2 | 0.38 | 2014 |
| On Asymmetric Unification and the Combination Problem in Disjoint Theories. | 0 | 0.34 | 2014 |
| A Formal Definition of Protocol Indistinguishability and Its Verification Using Maude-NPA. | 12 | 0.52 | 2014 |
| Asymmetric unification: a new unification paradigm for cryptographic protocol analysis | 5 | 0.38 | 2013 |
| Effective Symbolic Protocol Analysis via Equational Irreducibility Conditions. | 9 | 0.67 | 2012 |
| Special Issue on Security and Rewriting Foreword | 0 | 0.34 | 2012 |
| Security and Trust Management - 7th International Workshop, STM 2011, Copenhagen, Denmark, June 27-28, 2011, Revised Selected Papers | 16 | 1.05 | 2012 |
| Formalizing Physical Security Procedures. | 2 | 0.40 | 2012 |
| Security and Rewriting (Dagstuhl Seminar 11332). | 0 | 0.34 | 2011 |
| Actor-network procedures: Modeling multi-factor authentication, device pairing, social interactions | 4 | 0.48 | 2011 |
| Protocol analysis in Maude-NPA using unification modulo homomorphic encryption | 2 | 0.35 | 2011 |
| Bayesian Authentication: Quantifying Security of the Hancke-Kuhn Protocol | 7 | 0.46 | 2010 |
| Reasoning about probabilistic security using task-PIOAs | 1 | 0.36 | 2010 |
| Sequential protocol composition in maude-NPA | 5 | 0.41 | 2010 |
| Protocol analysis modulo combination of theories: a case study in Maude-NPA | 6 | 0.41 | 2010 |
| Deriving Ephemeral Authentication Using Channel Axioms. | 4 | 0.41 | 2009 |
| State space reduction in the Maude-NRL Protocol Analyzer. | 11 | 0.53 | 2008 |
| Maude-NPA: Cryptographic Protocol Analysis Modulo Equational Properties | 85 | 1.83 | 2007 |
| Security and Privacy in Ad-hoc and Sensor Networks, 4th European Workshop, ESAS 2007, Cambridge, UK, July 2-3, 2007, Proceedings | 16 | 1.87 | 2007 |
| One Picture Is Worth a Dozen Connectives: A Fault-Tree Representation of NPATRL Security Requirements | 2 | 0.56 | 2007 |
| Equational Cryptographic Reasoning in the Maude-NRL Protocol Analyzer | 16 | 0.84 | 2007 |
| Deriving secrecy in key establishment protocols | 16 | 0.65 | 2006 |
| Towards More Efficient Distance Bounding Protocols for Use in Sensor Networks | 10 | 0.78 | 2006 |
| A rewriting-based inference system for the NRL Protocol analyzer and its meta-logical properties | 53 | 1.70 | 2006 |
| On the Relative Soundness of the Free Algebra Model for Public Key Encryption | 11 | 0.53 | 2005 |
| Preventing Wormhole Attacks On Wireless Ad Hoc Networks: A Graph Theoretic Approach | 51 | 2.61 | 2005 |
| A rewriting-based inference system for the NRL protocol analyzer: grammar generation | 13 | 0.85 | 2005 |
| An encapsulated authentication logic for reasoning about key distribution protocols | 27 | 1.02 | 2005 |
| Ordering from Satan's menu: a survey of requirements specification for formal analysis of cryptographic protocols | 6 | 0.41 | 2004 |
| Formal specification and analysis of the group domain of interpretation protocol using NPATRL and the NRL protocol analyzer | 23 | 1.13 | 2004 |
| What makes a cryptographic protocol secure? the evolution of requirements specification in formal cryptographic protocol analysis | 7 | 0.53 | 2003 |
| A procedure for verifying security against type confusion attacks | 15 | 0.69 | 2003 |
| Relating cryptography and formal methods: a panel | 0 | 0.34 | 2003 |
| What Makes a Cryptographic Protocol Secure? The Evolution of Requirements Specification in Formal Cryptographic Protocol Analysis | 0 | 0.34 | 2003 |
| Environmental requirements for authentication protocols | 11 | 0.75 | 2002 |
| Formalizing GDOI group key management requirements in NPATRL | 16 | 0.75 | 2001 |
| The MFPS XV Security Session | 0 | 0.34 | 1999 |
| Analysis of the Internet Key Exchange protocol using the NRL Protocol Analyzer | 83 | 4.64 | 1999 |
| A formal framework and evaluation method for network denial of service | 82 | 15.76 | 1999 |
