14 search results - page 2 / 3 » Computing Knowledge in Security Protocols under Convergent E... |
ENTCS
2006
13 years 4 months ago
2006
There are two main ways of defining secrecy of cryptographic protocols. The first version checks if the adversary can learn the value of a secret parameter. In the second version,...
IFIP
2010
Springer
12 years 11 months ago
2010
Springer
Abstract. We consider two standard notions in formal security protocol analysis: message deducibility and static equivalence under equational theories. We present polynomial-time a...
CCS
2005
ACM
13 years 10 months ago
2005
ACM
We provide an effective procedure for deciding the existence of off-line guessing attacks on security protocols, for a bounded number of sessions. The procedure consists of a co...
LICS
2007
IEEE
13 years 11 months ago
2007
IEEE
The combination of first-order epistemic logic and formal cryptography offers a potentially very powerful framework for security protocol verification. In this article, we addre...
CORR
2010
Springer
13 years 2 months ago
2010
Springer
We consider the problem of intruder deduction in security protocol analysis: that is, deciding whether a given message M can be deduced from a set of messages under the theory of ...