Sciweavers

176 search results - page 12 / 36
» Distinguishing Attacks on T-Functions
Sort
View
CSI
2008
68views more  CSI 2008»
13 years 7 months ago
Privacy and forensics investigation process: The ERPINA protocol
The rights of an Internet user acting anonymously conflicts with the rights of a Server victim identifying the malicious user. The ERPINA protocol, introduced in this paper, allow...
Giannakis Antoniou, Leon Sterling, Stefanos Gritza...
ICNP
2007
IEEE
14 years 2 months ago
A Poisoning-Resilient TCP Stack
— We treat the problem of large-scale TCP poisoning: an attacker, who is able to monitor TCP packet headers in the network, can deny service to all flows traversing the monitori...
Amit Mondal, Aleksandar Kuzmanovic
CRYPTO
2004
Springer
119views Cryptology» more  CRYPTO 2004»
14 years 1 months ago
Security of Random Feistel Schemes with 5 or More Rounds
We study cryptographic attacks on random Feistel schemes. We denote by m the number of plaintext/ciphertext pairs, and by k the number of rounds. In their famous paper [3], M. Luby...
Jacques Patarin
ASIACRYPT
2006
Springer
13 years 11 months ago
KFC - The Krazy Feistel Cipher
We introduce KFC, a block cipher based on a three round Feistel scheme. Each of the three round functions has an SPN-like structure for which we can either compute or bound the adv...
Thomas Baignères, Matthieu Finiasz
ICPADS
2005
IEEE
14 years 1 months ago
An Active Detecting Method Against SYN Flooding Attack
SYN flooding attacks are a common type of Distributed Denial-of-Service (DDoS) attack. Early detection is desirable but traditional passive detection methods are inaccurate in th...
Bin Xiao, Wei Chen, Yanxiang He, Edwin Hsing-Mean ...