Abstract. We describe a method for enumerating all essentially different executions possible for a cryptographic protocol. We call them the shapes of the protocol. Naturally occur...
Shaddin F. Doghmi, Joshua D. Guttman, F. Javier Th...
Abstract. This paper presents history-dependent scheduling, a new technique for reducing the search space in the verification of cryptographic protocols. This technique allows the...
In this paper we develop a framework, based on strand spaces, for reasoning about cryptographic protocols and characterizing their executions. We define skeletons, homomorphisms,...
Shaddin F. Doghmi, Joshua D. Guttman, F. Javier Th...
Cryptographic protocols are useful for trust engineering in distributed transactions. Transactions require specific degrees of confidentiality and agreement between the principal...
Joshua D. Guttman, Jonathan C. Herzog, John D. Ram...
Abstract. We present an analysis that determines when it is possible to multiplex a pair of cryptographic protocols. We present a transformation that improves the coverage of this ...