4 search results - page 1 / 1 » Decidability of Freshness, Undecidability of Revelation |
FOSSACS
2004
Springer
13 years 10 months ago
2004
Springer
JCS
2008
13 years 4 months ago
2008
The secrecy problem for security protocols is the problem to decide whether or not a given security protocol has leaky runs. In this paper, the (initial) secrecy problem for bound...
CSFW
2007
IEEE
13 years 11 months ago
2007
IEEE
In this paper we focus on tackling the insecurity problem of security protocols in the presence of an unbounded number of data such as nonces or session keys. First, we pinpoint f...
POPL
2012
ACM
12 years 11 days ago
2012
ACM
We show how to combine a general purpose type system for an existing language with support for programming with binders and contexts by refining the type system of ML with a rest...