scispace - formally typeset
Open AccessProceedings Article

Finding security vulnerabilities in java applications with static analysis

Reads0
Chats0
TLDR
This paper proposes a static analysis technique for detecting many recently discovered application vulnerabilities such as SQL injections, cross-site scripting, and HTTP splitting attacks based on a scalable and precise points-to analysis.
Abstract
This paper proposes a static analysis technique for detecting many recently discovered application vulnerabilities such as SQL injections, cross-site scripting, and HTTP splitting attacks. These vulnerabilities stem from unchecked input, which is widely recognized as the most common source of security vulnerabilities in Web applications. We propose a static analysis approach based on a scalable and precise points-to analysis. In our system, user-provided specifications of vulnerabilities are automatically translated into static analyzers. Our approach finds all vulnerabilities matching a specification in the statically analyzed code. Results of our static analysis are presented to the user for assessment in an auditing interface integrated within Eclipse, a popular Java development environment. Our static analysis found 29 security vulnerabilities in nine large, popular open-source applications, with two of the vulnerabilities residing in widely-used Java libraries. In fact, all but one application in our benchmark suite had at least one vulnerability. Context sensitivity, combined with improved object naming, proved instrumental in keeping the number of false positives low. Our approach yielded very few false positives in our experiments: in fact, only one of our benchmarks suffered from false alarms.

read more

Content maybe subject to copyright    Report

Citations
More filters
Proceedings ArticleDOI

Information on Potential Vulnerabilities for New Requirements: Does It Help Writing Secure Code?

TL;DR: In this article, the authors present a human subject study to explore how information related to potential vulnerabilities influence developers on secure implementation of new requirements, and the results suggest that developers with limited professional experience could be a major beneficiary of the information on potential vulnerabilities.
Proceedings ArticleDOI

Data-centric security: role analysis and role typestates

TL;DR: The notion of an object "escaping" a role is introduced and a simple interprocedural static analysis is presented for computing the set of objects that may escape a role as part of consistency-based role assignment.
Book ChapterDOI

Defending Approach against Forceful Browsing in Web Applications

TL;DR: This paper proposes a new approach of locking the restricted or confidential pages with authentication page to prevent the unauthorised direct access of the restricted pages by the malicious user, then by keeping the confidential information secure.
Journal ArticleDOI

Prioritizing refactorings for security-critical code

TL;DR: In this article, the authors use the history of vulnerabilities and security bug reports along with a set of keywords to automatically identify a project's security-critical files based on its source code, bug reports, pull-request descriptions and commit messages.
References
More filters
Book

Principles of database and knowledge-base systems

TL;DR: This book goes into the details of database conception and use, it tells you everything on relational databases from theory to the actual used algorithms.
Proceedings Article

StackGuard: automatic adaptive detection and prevention of buffer-overflow attacks

TL;DR: StackGuard is described: a simple compiler technique that virtually eliminates buffer overflow vulnerabilities with only modest performance penalties, and a set of variations on the technique that trade-off between penetration resistance and performance.
Proceedings ArticleDOI

JFlow: practical mostly-static information flow control

TL;DR: The new language JFlow is described, an extension to the Java language that adds statically-checked information flow annotations and provides several new features that make information flow checking more flexible and convenient than in previous models.
Proceedings ArticleDOI

Points-to analysis in almost linear time

TL;DR: This is the asymptotically fastest non-trivial interprocedural points-to analysis algorithm yet described and is based on a non-standard type system for describing a universally valid storage shape graph for a program in linear space.
Related Papers (5)