A method for identifying Web applications |
| |
Authors: | Mario Kozina Marin Golub Stjepan Groš |
| |
Affiliation: | 1. Department of Electronics, Microelectronics, Computer and Intelligent Systems, Faculty of Electrical Engineering and Computing, University of Zagreb, Unska 3, 10000, Zagreb, Croatia
|
| |
Abstract: | Web applications are ubiquitous in today’s businesses. The security of these applications is of utmost importance since security
breaches might negatively impact good reputation, and even result in bankruptcy. There are different methods of assessing
security of Web applications, mainly based on some automated method of scanning. One type of scan method feeds random data
to the application and monitors its behavior. The other type uses a database with predefined vulnerabilities that are checked
one by one until either a vulnerability is found, or it can be claimed that the application does not have any known vulnerabilities.
The important step in latter type of scan process is the identification of the application since in this case we are narrowing
number of checks and, as a consequence, the scan process is faster. This paper describes a method for Web application identification
based on a black box principle. Our method is based on the invariance of certain characteristics of Web applications. We experimentally
tested and confirmed the usefulness of this approach. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|