24 search results - page 3 / 5 » How to prevent type-flaw attacks on security protocols under... |
ESORICS
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We propose a general transformation that maps a cryptographic protocol that is secure in an extremely weak sense (essentially in a model where no adversary is present) in...
IWFM
2003
13 years 8 months ago
2003
Meadows recently proposed a formal cost-based framework for analysis of denial of service. It was showed how some principles that have already been used to make cryptographic prot...
ASIACRYPT
2009
Springer
14 years 1 months ago
2009
Springer
Computational puzzles are mildly difficult computational problems that require resources (processor cycles, memory, or both) to solve. Puzzles have found a variety of uses in secu...
SP
2009
IEEE
14 years 2 months ago
2009
IEEE
In this paper, we study the degree to which a genomic string, Q, leaks details about itself any time it engages in comparison protocols with a genomic querier, Bob, even if those ...
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...