227 search results - page 9 / 46 » On the Reachability Problem in Cryptographic Protocols |
SCN
2004
Springer
14 years 25 days ago
2004
Springer
Abstract. In the past thirty years, cryptology has evolved from a secret art to a modern science. Weaker algorithms and algorithms with short keys are disappearing, political contr...
TCC
2010
Springer
14 years 4 months ago
2010
Springer
Abstract. We propose a semantically-secure public-key encryption scheme whose security is polynomialtime equivalent to the hardness of solving random instances of the subset sum pr...
CSFW
2004
IEEE
13 years 11 months ago
2004
IEEE
Recently we showed how to justify a Dolev-Yao type model of cryptography as used in virtually all automated protocol provers under active attacks and in arbitrary protocol environ...
CCS
2010
ACM
13 years 4 months ago
2010
ACM
We address the insecurity problem for cryptographic protocols, for an active intruder and a bounded number of sessions. The protocol steps are modeled as rigid Horn clauses, and t...
WIMOB
2008
IEEE
14 years 1 months ago
2008
IEEE
With Dynamic Home Agent Address Discovery (DHAAD), as specified in Mobile IPv6, a Mobile Node can discover the address of a suitable Home Agent on the home link. However, DHAAD suf...