210 search results - page 17 / 42 » A Formal Theory of Key Conjuring |
TPHOL
2005
IEEE
14 years 29 days ago
2005
IEEE
The nominal approach to abstract syntax deals with the issues of bound names and α-equivalence by considering constructions and properties that are invariant with respect to permu...
CSFW
1997
IEEE
13 years 11 months ago
1997
IEEE
This paper presents a general approach for analysis and veri cation of authentication properties in the language of Communicating Sequential Processes (CSP). It is illustrated by ...
IPL
2006
13 years 7 months ago
2006
We present complexity results for the verification of security protocols. Since the perfect cryptography assumption is unrealistic for cryptographic primitives with visible algebr...
IPL
2006
13 years 7 months ago
2006
In this paper we investigate P systems whose compartments contain sets of symbolobjects rather than multisets of objects, as it is common in membrane computing. If the number of m...
MSS
2008
IEEE
13 years 7 months ago
2008
IEEE
The paper deals with combinatorial and stochastic structures of cubical token systems. A cubical token system is an instance of a token system, which in turn is an instance of a t...