Sciweavers

45 search results - page 1 / 9
» Transparent Runtime Randomization for Security
Sort
View
SRDS
2003
IEEE
13 years 9 months ago
Transparent Runtime Randomization for Security
A large class of security attacks exploit software implementation vulnerabilities such as unchecked buffers. This paper proposes Transparent Runtime Randomization (TRR), a general...
Jun Xu, Zbigniew Kalbarczyk, Ravishankar K. Iyer
OOPSLA
2010
Springer
13 years 3 months ago
Cross-language, type-safe, and transparent object sharing for co-located managed runtimes
As software becomes increasingly complex and difficult to analyze, it is more and more common for developers to use high-level, type-safe, object-oriented (OO) programming langua...
Michal Wegiel, Chandra Krintz
REFLECTION
2001
Springer
13 years 9 months ago
A Simple Security-Aware MOP for Java
This article investigates the security problems raised by the use of proxy-based runtime meta-object protocols (MOPs) for Java and provides an approach for making meta-level code t...
Denis Caromel, Fabrice Huet, Julien Vayssiè...
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...
NSPW
2003
ACM
13 years 9 months ago
SELF: a transparent security extension for ELF binaries
The ability to analyze and modify binaries is often very useful from a security viewpoint. Security operations one would like to perform on binaries include the ability to extract...
Daniel C. DuVarney, V. N. Venkatakrishnan, Sandeep...