Sciweavers

12183 search results - page 11 / 2437
» Computers under Attacks!
Sort
View
JCS
2011
72views more  JCS 2011»
13 years 4 months ago
Automatically deriving information-theoretic bounds for adaptive side-channel attacks
We present a model of adaptive attacks which we combine with information-theoretic metrics to quantify the information revealed to an adaptive adversary. This enables us to expres...
Boris Köpf, David A. Basin
ASIACRYPT
2003
Springer
14 years 1 months ago
An Efficient Public Key Trace and Revoke Scheme Secure against Adaptive Chosen Ciphertext Attack
We propose a new public key trace and revoke scheme secure against adaptive chosen ciphertext attack. Our scheme is more efficient than the DF scheme suggested by Y. Dodis and N. F...
Chong Hee Kim, Yong Ho Hwang, Pil Joong Lee
CCS
2011
ACM
12 years 9 months ago
Eliminating the hypervisor attack surface for a more secure cloud
Cloud computing is quickly becoming the platform of choice for many web services. Virtualization is the key underlying technology enabling cloud providers to host services for a l...
Jakub Szefer, Eric Keller, Ruby B. Lee, Jennifer R...
JALC
2006
61views more  JALC 2006»
13 years 9 months ago
Random Polynomial-Time Attacks and Dolev-Yao Models
In this paper we present an extension of Dolev-Yao models for security protocols with a notion of random polynomial-time (Las Vegas) computability. First we notice that Dolev-Yao ...
Mathieu Baudet
CORR
2010
Springer
151views Education» more  CORR 2010»
13 years 10 months ago
How to prevent type-flaw attacks on security protocols under algebraic properties
In this paper, we prove that type-tagging prevents type-flaw attacks on security protocols that use the Exclusive-OR operator as our main contribution. Our proof method is general ...
Sreekanth Malladi, Pascal Lafourcade