English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

The number and importance of web application increases fast. At the same time, the influence of vulnerabilities in web application grows as well. Automated tools are urgently needed because manual code reviews are inefficient and fallible. However, the time complexity of previous static code detection tools are O(n), which is not acceptable when processing a large quantity of web applications. We propose a novel method based on GPU to accelerate the detection of Web application vulnerabilities. More specifically, we decrease the time complexity of detecting XSS vulnerabilities based on dependence tree from O(n) to O(log(n)) and decrease the time complexity of detecting SQLI vulnerabilities based on automaton from O(n) to O(1). Experiment results show that the method based on GPU is much faster than traditional method based on CPU. KEYWORD: XSS, SQLI, Dependence Tree, Automaton, GPU 4th International Conference on Mechanical Materials and Manufacturing Engineering (MMME 2016) © 2016. The authors Published by Atlantis Press 329 Fig. 1 CPU and GPU methods to process dependence trees 3 DETECTION OF SQLI VULNERABILITIES BASED ON AUTOMATON Both methods on CPU and GPU to process automatons are demonstrated in figure 2. In the left part of the figure 2, the dashed arrows represent the visiting of single-thread method on CPU. Obviously, it visits each state of the automaton once, the time complexity of is O (n). In the right side of the figure 2, we assign a thread to each state of the automaton, and then all thread visits its corresponding state concurrently. Obviously, the multi-thread method of GPU has a constant time complexity which is O (1). Fig. 2 CPU and GPU methods to process automatons

Detection of Web Application Vulnerabilities Accelerated by GPU