Sciweavers

27 search results - page 5 / 6
» Defending Against Attacks on Main Memory Persistence
Sort
View
ASIACRYPT
2009
Springer
14 years 2 months ago
Security Notions and Generic Constructions for Client Puzzles
Computational puzzles are mildly difficult computational problems that require resources (processor cycles, memory, or both) to solve. Puzzles have found a variety of uses in secu...
Liqun Chen, Paul Morrissey, Nigel P. Smart, Bogdan...
IEEESP
2007
98views more  IEEESP 2007»
13 years 7 months ago
Educating Students to Create Trustworthy Systems
igh level of abstraction and to provide broad oversight. In contrast, the goal of computer science security education is to provide the technicalexpertisetodevelopsecure software a...
Richard S. Swart, Robert F. Erbacher
ACSAC
2009
IEEE
14 years 2 months ago
Protecting Kernel Code and Data with a Virtualization-Aware Collaborative Operating System
Abstract—The traditional virtual machine usage model advocates placing security mechanisms in a trusted VM layer and letting the untrusted guest OS run unaware of the presence of...
Daniela Alvim Seabra de Oliveira, Shyhtsun Felix W...
INDOCRYPT
2005
Springer
14 years 1 months ago
On the Algebraic Immunity of Symmetric Boolean Functions
In this paper, we analyse the algebraic immunity of symmetric Boolean functions. We identify a set of lowest degree annihilators for symmetric functions and propose an efficient al...
An Braeken, Bart Preneel
CCS
2009
ACM
14 years 8 months ago
Hidden credential retrieval from a reusable password
We revisit the venerable question of access credentials management, which concerns the techniques that we, humans with limited memory, must employ to safeguard our various access ...
Xavier Boyen