17 search results - page 1 / 4 » Searching for Shapes in Cryptographic Protocols |
TACAS
2007
Springer
13 years 11 months ago
2007
Springer
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...
VMCAI
2004
Springer
13 years 10 months ago
2004
Springer
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...
ENTCS
2007
13 years 4 months ago
2007
In this paper we develop a framework, based on strand spaces, for reasoning about cryptographic protocols and characterizing their executions. We define skeletons, homomorphisms,...
TGC
2005
Springer
13 years 10 months ago
2005
Springer
Cryptographic protocols are useful for trust engineering in distributed transactions. Transactions require specific degrees of confidentiality and agreement between the principal...
IFIP
2009
Springer
13 years 11 months ago
2009
Springer
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 ...