Sciweavers

175 search results - page 27 / 35
» Improved Generalized Birthday Attack
Sort
View
CORR
2006
Springer
176views Education» more  CORR 2006»
13 years 7 months ago
On the Fingerprinting Capacity Under the Marking Assumption
Abstract--We address the maximum attainable rate of fingerprinting codes under the marking assumption, studying lower and upper bounds on the value of the rate for various sizes of...
N. Prasanth Anthapadmanabhan, Alexander Barg, Ilya...
PPDP
2010
Springer
13 years 5 months ago
Tabling for transaction logic
Transaction Logic is a logic for representing declarative and procedural knowledge in logic programming, databases, and AI. It has been successful in areas as diverse as workflows...
Paul Fodor, Michael Kifer
CCS
2003
ACM
14 years 1 months ago
Enhancing byte-level network intrusion detection signatures with context
Many network intrusion detection systems (NIDS) use byte sequences as signatures to detect malicious activity. While being highly efficient, they tend to suffer from a high false...
Robin Sommer, Vern Paxson
CONEXT
2009
ACM
13 years 8 months ago
ARES: an anti-jamming reinforcement system for 802.11 networks
Dense, unmanaged 802.11 deployments tempt saboteurs into launching jamming attacks by injecting malicious interference. Nowadays, jammers can be portable devices that transmit int...
Konstantinos Pelechrinis, Ioannis Broustis, Srikan...
HICSS
2003
IEEE
151views Biometrics» more  HICSS 2003»
14 years 1 months ago
A Simple GSPN for Modeling Common Mode Failures in Critical Infrastructures
It is now apparent that our nation’s infrastructures and essential utilities have been optimized for reliability in benign operating environments. As such, they are susceptible ...
Axel W. Krings, Paul W. Oman