227 search results - page 34 / 46 » On the Reachability Problem in Cryptographic Protocols |
102
click to vote
ISCAS
2003
IEEE
15 years 5 months ago
2003
IEEE
In this paper, we present a precise characterization of the existence of a convergent transfer subgraph in an edge colored directed acyclic graph. Based on the characterization, l...
174
Voted
LICS
2003
IEEE
15 years 5 months ago
2003
IEEE
Probability features increasingly often in software and hardware systems: it is used in distributed co-ordination and routing problems, to model fault-tolerance and performance, a...
108
Voted
FASE
2009
Springer
15 years 4 months ago
2009
Springer
Model checking tools based on the iterative refinement of predicate abstraction (e.g., Slam and Blast) often feature a specification language for expressing complex behavior rules....
95
Voted
TCC
2010
Springer
15 years 7 months ago
2010
Springer
A number of works have investigated using tamper-proof hardware tokens as tools to achieve a variety of cryptographic tasks. In particular, Goldreich and Ostrovsky considered the ...
108
click to vote
CRYPTO
2006
Springer
15 years 4 months ago
2006
Springer
We address the issue of encrypting data in local storage using a key that is derived from the user's password. The typical solution in use today is to derive the key from the...