Sciweavers

227 search results - page 34 / 46
» On the Reachability Problem in Cryptographic Protocols
Sort
View
ISCAS
2003
IEEE
124views Hardware» more  ISCAS 2003»
14 years 23 days ago
Convergent transfer subgraph characterization and computation
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...
Wing Ning Li
LICS
2003
IEEE
14 years 23 days ago
Model checking for probability and time: from theory to practice
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...
Marta Z. Kwiatkowska
FASE
2009
Springer
13 years 11 months ago
Enhanced Property Specification and Verification in BLAST
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....
Ondrej Sery
TCC
2010
Springer
188views Cryptology» more  TCC 2010»
14 years 2 months ago
Founding Cryptography on Tamper-Proof Hardware Tokens
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 ...
Vipul Goyal, Yuval Ishai, Amit Sahai, Ramarathnam ...
CRYPTO
2006
Springer
124views Cryptology» more  CRYPTO 2006»
13 years 11 months ago
Mitigating Dictionary Attacks on Password-Protected Local Storage
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...
Ran Canetti, Shai Halevi, Michael Steiner