Sciweavers

751 search results - page 117 / 151
» The Distinguishing Chromatic Number
Sort
View
COCOA
2010
Springer
15 years 4 months ago
Bounds for Nonadaptive Group Tests to Estimate the Amount of Defectives
The classical and well-studied group testing problem is to find d defectives in a set of n elements by group tests, which tell us for any chosen subset whether it contains defectiv...
Peter Damaschke, Azam Sheikh Muhammad
TCC
2009
Springer
167views Cryptology» more  TCC 2009»
16 years 6 months ago
Simultaneous Hardcore Bits and Cryptography against Memory Attacks
This paper considers two questions in cryptography. Cryptography Secure Against Memory Attacks. A particularly devastating side-channel attack against cryptosystems, termed the &qu...
Adi Akavia, Shafi Goldwasser, Vinod Vaikuntanathan
ICC
2009
IEEE
115views Communications» more  ICC 2009»
16 years 28 days ago
Peer-to-Peer Application Recognition Based on Signaling Activity
—Because of the enormous growth in the number of peer-to-peer (P2P) applications in recent years, P2P traffic now constitutes a substantial proportion of Internet traffic. The ...
Chen-Chi Wu, Kuan-Ta Chen, Yu-Chun Chang, Chin-Lau...
ICDCS
2007
IEEE
16 years 15 days ago
Streaming Algorithms for Robust, Real-Time Detection of DDoS Attacks
Effective mechanisms for detecting and thwarting Distributed Denial-of-Service (DDoS) attacks are becoming increasingly important to the success of today’s Internet as a viable ...
Sumit Ganguly, Minos N. Garofalakis, Rajeev Rastog...
CRYPTO
2004
Springer
119views Cryptology» more  CRYPTO 2004»
15 years 11 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