Sciweavers

134 search results - page 13 / 27
» Attack for Flash MIX
Sort
View
FSE
2003
Springer
243views Cryptology» more  FSE 2003»
14 years 1 months ago
Optimal Key Ranking Procedures in a Statistical Cryptanalysis
Hypothesis tests have been used in the past as a tool in a cryptanalytic context. In this paper, we propose to use this paradigm and define a precise and sound statistical framewo...
Pascal Junod, Serge Vaudenay
IH
2005
Springer
14 years 2 months ago
Compulsion Resistant Anonymous Communications
We study the effect compulsion attacks, through which an adversary can request a decryption or key from an honest node, have on the security of mix based anonymous communication s...
George Danezis, Jolyon Clulow
WPES
2003
ACM
14 years 1 months ago
Reusable anonymous return channels
Mix networks are used to deliver messages anonymously to recipients, but do not straightforwardly allow the recipient of an anonymous message to reply to its sender. Yet the abili...
Philippe Golle, Markus Jakobsson
ASIACRYPT
2007
Springer
14 years 2 months ago
How to Build a Hash Function from Any Collision-Resistant Function
Recent collision-finding attacks against hash functions such as MD5 and SHA-1 motivate the use of provably collision-resistant (CR) functions in their place. Finding a collision ...
Thomas Ristenpart, Thomas Shrimpton
IEEEARES
2007
IEEE
14 years 2 months ago
Near Optimal Protection Strategies Against Targeted Attacks on the Core Node of a Network
The issue of information security has attracted increasing attention in recent years. In network attack and defense scenarios, attackers and defenders constantly change their resp...
Frank Yeong-Sung Lin, Po-Hao Tsang, Yi-Luen Lin