860 search results - page 74 / 172 » Uncovering Attacks on Security Protocols |
SAC
2009
ACM
15 years 4 months ago
2009
ACM
The level of anonymity offered by low latency, interactive, anonymous networks is unknown. This paper implements correlation attacks on the deployed Tor network and a simulated T...
STOC
2005
ACM
15 years 10 months ago
2005
ACM
In the setting of secure multiparty computation, a set of parties wish to to jointly compute some function of their input (i.e., they wish to securely carry out some distributed t...
CSFW
2003
IEEE
15 years 3 months ago
2003
IEEE
We investigate a number of issues related to identity based authenticated key agreement protocols using the Weil or Tate pairings. These issues include how to make protocols effici...
107
click to vote
ADHOC
2007
14 years 10 months ago
2007
Abstract. Many ad hoc routing algorithms rely on broadcast flooding for location discovery or, more generally, for secure routing applications. Flooding is a robust algorithm but ...
ASIACRYPT
2009
Springer
15 years 4 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...