Sciweavers

2304 search results - page 108 / 461
» On the Vulnerability of Large Graphs
Sort
View
DSN
2007
IEEE
16 years 13 days ago
Protecting Cryptographic Keys from Memory Disclosure Attacks
Cryptography has become an indispensable mechanism for securing systems, communications and applications. While offering strong protection, cryptography makes the assumption that ...
Keith Harrison, Shouhuai Xu
WCRE
2005
IEEE
15 years 11 months ago
Enhancing Security Using Legality Assertions
Buffer overflows have been the most common form of security vulnerability in the past decade. A number of techniques have been proposed to address such attacks. Some are limited t...
Lei Wang, James R. Cordy, Thomas R. Dean
161
Voted
IMC
2005
ACM
15 years 11 months ago
Perils of Transitive Trust in the Domain Name System
The Domain Name System, DNS, is based on nameserver delegations, which introduce complex and subtle dependencies between names and nameservers. In this paper, we present results f...
Venugopalan Ramasubramanian, Emin Gün Sirer
248
Voted
IAW
2003
IEEE
15 years 11 months ago
Insecure Programming: How Culpable is a Language's Syntax?
— Vulnerabilities in software stem from poorly written code. Inadvertent errors may creep in due to programmers not being aware of the security implications of their code. Writin...
Ramkumar Chinchani, Anusha Iyer, Bharat Jayaraman,...
SRDS
2003
IEEE
15 years 11 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