James Newsome
Bosch
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by James Newsome.
acm workshop on programming languages and analysis for security | 2009
James Newsome; Stephen McCamant; Dawn Song
The channel capacity of a program is a quantitative measure of the amount of control that the inputs to a program have over its outputs. Because it corresponds to worst-case assumptions about the probability distribution over those inputs, it is particularly appropriate for security applications where the inputs are under the control of an adversary. We introduce a family of complementary techniques for measuring channel capacity automatically using a decision procedure (SAT or #SAT solver), which give either exact or narrow probabilistic bounds.n We then apply these techniques to the problem of analyzing false positives produced by dynamic taint analysis used to detect control-flow hijacking in commodity software. Dynamic taint analysis is based on the principle that an attacker should not be able to control values such as function pointers and return addresses, but it uses a simple binary approximation of control that commonly leads to both false positive and false negative errors. Based on channel capacity, we propose a more refined quantitative measure of influence, which can effectively distinguish between true attacks and false positives. We use a practical implementation of our influence measuring techniques, integrated with a dynamic taint analysis operating on x86 binaries, to classify tainting warnings produced by vulnerable network servers, such as those attacked by the Blaster and SQL Slammer worms. Influence measurement correctly distinguishes real attacks from tainting false positives, a task that would otherwise need to be done manually.
Sigplan Notices | 2009
James Newsome; Stephen McCamant; Dawn Song
The channel capacity of a program is a quantitative measure of the amount of control that the inputs to a program have over its outputs. Because it corresponds to worst-case assumptions about the probability distribution over those inputs, it is particularly appropriate for security applications where the inputs are under the control of an adversary. We introduce a family of complementary techniques for measuring channel capacity automatically using a decision procedure (SAT or #SAT solver), which give either exact or narrow probabilistic bounds.n We then apply these techniques to the problem of analyzing false positives produced by dynamic taint analysis used to detect control-flow hijacking in commodity software. Dynamic taint analysis is based on the principle that an attacker should not be able to control values such as function pointers and return addresses, but it uses a simple binary approximation of control that commonly leads to both false positive and false negative errors. Based on channel capacity, we propose a more refined quantitative measure of influence, which can effectively distinguish between true attacks and false positives. We use a practical implementation of our influence measuring techniques, integrated with a dynamic taint analysis operating on x86 binaries, to classify tainting warnings produced by vulnerable network servers, such as those attacked by the Blaster and SQL Slammer worms. Influence measurement correctly distinguishes real attacks from tainting false positives, a task that would otherwise need to be done manually.
Archive | 2011
James Newsome; Robert Szerwinski; Jan Hayek
Archive | 2014
Jorge Guajardo Merchan; Emmanuel Kwame Owusu; Jonathan M. McCune; James Newsome; Amit Vasudevan; Adrian Perrig
Archive | 2013
James Newsome
Archive | 2010
Marc Smaak; Stephan van Tienen; James Newsome; Torsten Schuetze
Archive | 2010
James Newsome; Robert Szerwinski; Jan Hayek
Archive | 2014
Yanlin Li; Adrian Perrig; Jonathan M. McCune; James Newsome; Brandon S. Baker; Will Drewry
Archive | 2014
Jorge Guajardo Merchan; Emmanuel Owusu; Jonathan M. McCune; James Newsome; Adrian Perrig; Amit Vasudevan
Archive | 2012
Amit Vasudevan; Jonathan M. McCune; James Newsome