Sciweavers

2304 search results - page 186 / 461
» On the Vulnerability of Large Graphs
Sort
View
SP
2000
IEEE
105views Security Privacy» more  SP 2000»
15 years 11 months ago
Open Source in Security: Visiting the Bizarre
Although open-source software development has virtues, there is reason to believe that the approach would not have a significant effect on the security of today’s systems. The ...
Fred B. Schneider
DSN
2004
IEEE
15 years 10 months ago
Verifying Web Applications Using Bounded Model Checking
The authors describe the use of bounded model checking (BMC) for verifying Web application code. Vulnerable sections of code are patched automatically with runtime guards, allowin...
Yao-Wen Huang, Fang Yu, Christian Hang, Chung-Hung...
FAST
2008
15 years 9 months ago
Portably Solving File TOCTTOU Races with Hardness Amplification
The file-system API of contemporary systems makes programs vulnerable to TOCTTOU (time of check to time of use) race conditions. Existing solutions either help users to detect the...
Dan Tsafrir, Tomer Hertz, David Wagner, Dilma Da S...
CHI
2011
ACM
14 years 10 months ago
Security through a different kind of obscurity: evaluating distortion in graphical authentication schemes
While a large body of research on image-based authentication has focused on memorability, comparatively less attention has been paid to the new security challenges these schemes m...
Eiji Hayashi, Jason Hong, Nicolas Christin
AIMS
2007
Springer
16 years 22 days ago
IBGP Confederation Provisioning
This paper proposes an optimization method for the design of large scale confederation based BGP networks. We propose a graph based model and an associated metric to evaluate the r...
Mohamed Nassar, Radu State, Olivier Festor