Sciweavers

81 search results - page 1 / 17
» Sensitivity Analysis Attacks Against Randomized Detectors
Sort
View
ICIP
2007
IEEE
13 years 8 months ago
Sensitivity Analysis Attacks Against Randomized Detectors
Sensitivity analysis attacks present a serious threat to the security of popular spread spectrum watermarking schemes. Randomization of the detector is thought to increase the imm...
Maha El Choubassi, Pierre Moulin
MMSEC
2006
ACM
102views Multimedia» more  MMSEC 2006»
13 years 11 months ago
Zero-knowledge watermark detector robust to sensitivity attacks
Current zero-knowledge watermark detectors are based on a linear correlation between the asset features and a given secret sequence. This detection function is susceptible of bein...
Juan Ramón Troncoso-Pastoriza, Fernando P&e...
CHES
2010
Springer
172views Cryptology» more  CHES 2010»
13 years 6 months ago
Analysis and Improvement of the Random Delay Countermeasure of CHES 2009
Random delays are often inserted in embedded software to protect against side-channel and fault attacks. At CHES 2009 a new method for generation of random delays was described tha...
Jean-Sébastien Coron, Ilya Kizhvatov
SACRYPT
2007
Springer
141views Cryptology» more  SACRYPT 2007»
13 years 11 months ago
Analysis of Countermeasures Against Access Driven Cache Attacks on AES
Cache attacks on implementations of cryptographic algorithms have turned out to be very powerful. Progress in processor design, e.g., like hyperthreading, requires to adapt models ...
Johannes Blömer, Volker Krummel
GECCO
2010
Springer
155views Optimization» more  GECCO 2010»
13 years 9 months ago
Negative selection algorithms without generating detectors
Negative selection algorithms are immune-inspired classifiers that are trained on negative examples only. Classification is performed by generating detectors that match none of ...
Maciej Liskiewicz, Johannes Textor