Sciweavers

583 search results - page 20 / 117
» On the Complexity of Matsui's Attack
Sort
View
CSE
2009
IEEE
14 years 2 months ago
Modelling of Pseudonymity under Probabilistic Linkability Attacks
—This paper contributes to the field of measuring (un)linkability in communication systems; a subproblem of privacy protection. We propose an attacker state model for attacks on...
Martin Neubauer
EUROCRYPT
2011
Springer
12 years 10 months ago
Statistical Attack on RC4 - Distinguishing WPA
Abstract. In this paper we construct several tools for manipulating pools of biases in the analysis of RC4. Then, we show that optimized strategies can break WEP based on 4000 pack...
Pouyan Sepehrdad, Serge Vaudenay, Martin Vuagnoux
ISW
2004
Springer
14 years 20 days ago
A Model for the Semantics of Attack Signatures in Misuse Detection Systems
Misuse Detection systems identify evidence of attacks by searching for patterns of known attacks (signatures). A main problem in this context is the modeling and specification of a...
Michael Meier
JNSM
2008
93views more  JNSM 2008»
13 years 7 months ago
Optimal IDS Sensor Placement and Alert Prioritization Using Attack Graphs
We optimally place intrusion detection system (IDS) sensors and prioritize IDS alerts using attack graph analysis. We begin by predicting all possible ways of penetrating a networ...
Steven Noel, Sushil Jajodia
EUROCRYPT
2009
Springer
14 years 8 months ago
Cube Attacks on Tweakable Black Box Polynomials
Almost any cryptographic scheme can be described by tweakable polynomials over GF(2), which contain both secret variables (e.g., key bits) and public variables (e.g., plaintext bit...
Itai Dinur, Adi Shamir