Sciweavers

8 search results - page 1 / 2
» On the imbalance of the security problem space and its expec...
Sort
View
IMCS
2007
144views more  IMCS 2007»
13 years 4 months ago
On the imbalance of the security problem space and its expected consequences
Purpose – This paper aims to report on the results of an analysis of the computer security problem space, to suggest the areas with highest potential for making progress in the ...
Konstantin Beznosov, Olga Beznosova
ICALP
2003
Springer
13 years 9 months ago
Analysis of a Simple Evolutionary Algorithm for Minimization in Euclidean Spaces
Although evolutionary algorithms (EAs) are widely used in practical optimization, their theoretical analysis is still in its infancy. Up to now results on the (expected) runtime ar...
Jens Jägersküpper
CEC
2010
IEEE
13 years 5 months ago
Beyond No Free Lunch: Realistic algorithms for arbitrary problem classes
In this paper we present a simple and general new No Free Lunch-like result that applies to revisiting algorithms searching arbitrary problem sets. We begin by unifying the assumpt...
James A. R. Marshall, Thomas G. Hinton
CCS
2006
ACM
13 years 8 months ago
Secure information sharing enabled by Trusted Computing and PEI models
The central goal of secure information sharing is to "share but protect" where the motivation to "protect" is to safeguard the sensitive content from unauthori...
Ravi S. Sandhu, Kumar Ranganathan, Xinwen Zhang
IWSEC
2007
Springer
13 years 10 months ago
Run-Time Randomization to Mitigate Tampering
The problem of defending software against tampering by a malicious host is not expected to be solved soon. Rather than trying to defend against the first attack, randomization tri...
Bertrand Anckaert, Mariusz H. Jakubowski, Ramarath...