Sciweavers

54 search results - page 7 / 11
» Backtracking Algorithmic Complexity Attacks against a NIDS
Sort
View
IDEAL
2003
Springer
14 years 29 days ago
Detecting Distributed Denial of Service (DDoS) Attacks through Inductive Learning
As the complexity of Internet is scaled up, it is likely for the Internet resources to be exposed to Distributed Denial of Service (DDoS) flooding attacks on TCP-based Web servers....
Sanguk Noh, Cheolho Lee, Kyunghee Choi, Gihyun Jun...
FSE
2008
Springer
162views Cryptology» more  FSE 2008»
13 years 9 months ago
Collisions on SHA-0 in One Hour
At Crypto 2007, Joux and Peyrin showed that the boomerang attack, a classical tool in block cipher cryptanalysis, can also be very useful when analyzing hash functions. They applie...
Stéphane Manuel, Thomas Peyrin
COMCOM
2006
88views more  COMCOM 2006»
13 years 7 months ago
Using attack graphs for correlating, hypothesizing, and predicting intrusion alerts
To defend against multi-step intrusions in high-speed networks, efficient algorithms are needed to correlate isolated alerts into attack scenarios. Existing correlation methods us...
Lingyu Wang, Anyi Liu, Sushil Jajodia
PQCRYPTO
2010
187views Cryptology» more  PQCRYPTO 2010»
13 years 11 months ago
Information-Set Decoding for Linear Codes over Fq
The best known non-structural attacks against code-based cryptosystems are based on information-set decoding. Stern’s algorithm and its improvements are well optimized and the co...
Christiane Peters
IACR
2011
132views more  IACR 2011»
12 years 7 months ago
Tamper-Proof Circuits: How to Trade Leakage for Tamper-Resilience
Abstract. Tampering attacks are cryptanalytic attacks on the implementation of cryptographic algorithms (e.g., smart cards), where an adversary introduces faults with the hope that...
Sebastian Faust, Krzysztof Pietrzak, Daniele Ventu...