Sciweavers

1019 search results - page 6 / 204
» Cryptographic Design Vulnerabilities
Sort
View
SPW
2004
Springer
15 years 2 months ago
The Dancing Bear: A New Way of Composing Ciphers
This note presents a new way of composing cryptographic primitives which makes some novel combinations possible. For example, one can do threshold decryption using standard block c...
Ross Anderson
ISSRE
2005
IEEE
15 years 3 months ago
Automated Checking for Windows Host Vulnerabilities
Evaluation of computing system security requires knowledge of the vulnerabilities present in the system and of potential attacks against the system. Vulnerabilities can be classif...
Matin Tamizi, Matt Weinstein, Michel Cukier
CHES
2003
Springer
104views Cryptology» more  CHES 2003»
15 years 2 months ago
Power-Analysis Attacks on an FPGA - First Experimental Results
Field Programmable Gate Arrays (FPGAs) are becoming increasingly popular, especially for rapid prototyping. For implementations of cryptographic algorithms, not only the speed and ...
Siddika Berna Örs, Elisabeth Oswald, Bart Pre...
CHES
2010
Springer
159views Cryptology» more  CHES 2010»
14 years 10 months ago
Provably Secure Higher-Order Masking of AES
Implementations of cryptographic algorithms are vulnerable to Side Channel Analysis (SCA). To counteract it, masking schemes are usually involved which randomize key-dependent data...
Matthieu Rivain, Emmanuel Prouff
SP
2006
IEEE
132views Security Privacy» more  SP 2006»
15 years 3 months ago
Towards Automatic Generation of Vulnerability-Based Signatures
In this paper we explore the problem of creating vulnerability signatures. A vulnerability signature matches all exploits of a given vulnerability, even polymorphic or metamorphic...
David Brumley, James Newsome, Dawn Xiaodong Song, ...