- About this Journal
- Abstracting and Indexing
- Aims and Scope
- Annual Issues
- Article Processing Charges
- Articles in Press
- Author Guidelines
- Bibliographic Information
- Citations to this Journal
- Contact Information
- Editorial Board
- Editorial Workflow
- Free eTOC Alerts
- Publication Ethics
- Reviewers Acknowledgment
- Submit a Manuscript
- Subscription Information
- Table of Contents
The Scientific World Journal
Volume 2013 (2013), Article ID 946768, 10 pages
Vulnerability Assessment of IPv6 Websites to SQL Injection and Other Application Level Attacks
Department of Electrical Engineering, National Chung Cheng University, Chia-Yi 62102, Taiwan
Received 14 October 2013; Accepted 2 December 2013
Academic Editors: S. K. Bhatia and A. K. Misra
Copyright © 2013 Ying-Chiang Cho and Jen-Yi Pan. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Given the proliferation of internet connected devices, IPv6 has been proposed to replace IPv4. Aside from providing a larger address space which can be assigned to internet enabled devices, it has been suggested that the IPv6 protocol offers increased security due to the fact that with the large number of addresses available, standard IP scanning attacks will no longer become feasible. However, given the interest in attacking organizations rather than individual devices, most initial points of entry onto an organization's network and their attendant devices are visible and reachable through web crawling techniques, and, therefore, attacks on the visible application layer may offer ways to compromise the overall network. In this evaluation, we provide a straightforward implementation of a web crawler in conjunction with a benign black box penetration testing system and analyze the ease at which SQL injection attacks can be carried out.
IPv6 was developed by Engineering Task Force  to solve the issue of insufficient number of addresses provided by the IPv4 protocol . With the proliferation of internet enabled devise, the limits of IPv4 have been reached. IPv6 is composed of 128 bits, generating a total of 3.4 × 1038 addresses, which is 7.9 × 1028 times the address space of IPv4. Because of this greatly increased address space, most normal “war-dialing” type attacks [3, 4] are not feasible, and thus IPv6 offers an increased level of security versus IPv4. Therefore, most information security research with regard to IPv6 focuses mainly on the discussion of IP layer [5, 6] seeking to show that the underlying protocol is resistant to attack. However, this research ignores the overall nature of the Internet; that is, devices are inherently interconnected, and that once a vulnerable device can be identified linking information exists that allows one to identify other devices on the network. Therefore, it is trivial to traverse the links to attack the device of interest.
More specifically, most attacks are against organization rather than individual devices. Most of these organizations are connected to the internet in such a way where they can be searched via publically available search engines or a hyperlink structure can be traversed to reach them. After the initial web server or database has been identified and breached, other devices belonging to the organization can then be identified and compromised in turn, with the increased address space of IPv6 not making a difference. Thus, the increased address space provided by IPv6 does not offer any practical barriers to finding targets to attack.
To demonstrate this vulnerability, we will utilize the keyword search of publically available search engines such as Google, Bing, and Yahoo in conjunction with a web crawler with a black box penetration testing kit [7–9] to show how this can be done in principle.
2. Algorithm Principle
Briefly, the overall component of this system is a web crawler [10, 11] that takes an initial website, traverses the links on the front page, and tries to identify vulnerable links that can be exploited. This system also has a secondary component which utilizes search engines such as Google, Bing, and Yahoo to search for specific URLs that might be vulnerable to injection.
2.1. Web Crawling Algorithm
An effective web crawler needs to implement four key elements, a selection policy, a revisitation policy, a politeness policy, and parallelization scheme [12–15]. Briefly, the selection policy defines which sites that one will visit and includes aspects such as whether a link has been previously visited. A revisitation policy defines how often a link should be refreshed in order to detect changes. Politeness reflects the scheme by which a server is not overloaded with requests, and finally the parallelization scheme defines how the process can be parallelized for efficient searching.
The typical web crawler works via breadth first search , in which a frontier of unvisited links is first presented. These nodes are traversed, and a new frontier of unvisited sites is found after which the process repeats. One complication, however, is that to mark a site as visited, we normally rely upon a hashing protocol that functions on a canonical web address rather than just storing the address in its entirety. The overall process is given in Figure 1. However, one complication that needs to be addressed is that malicious websites or “spider traps” can be crafted so that web crawlers are trapped in an infinite loop . Therefore, the hashing strategy must also take into account some of the content associated with the page.
2.2. Dynamic Analysis
Dynamic analysis identifies security problems by directly interacting with a functioning website. In other words, dynamic analysis relies on simulating user interactions with web pages, including interactions designed with potentially malicious intent. Because dynamic analysis uses a real website to find vulnerabilities in real time, found vulnerabilities are much more likely to be real than with static analysis, which has problems with detecting false positives [18, 19]. Black box testing determines whether a web application has a vulnerability by inputting testing data to the application and analyzing its response , as opposed to white box testing which focuses on source code parsing and analysis. White box testing tends to have lower efficiency because it does not factor in the dynamic interplay between the web server, application server, and database server . Therefore, it is more common to use black box testing to more holistically analyze web application’s vulnerability . Penetration testing is a method to estimate the security of computer system or internet security by actively simulating attacks [22, 23]. This method analyzes all possible security weakness in the system, so the testing result is very valuable and convincing. The end product is not simply potential vulnerabilities but verified vulnerabilities and exploits. Honest testing result can form a bridge between developer and information security communities [24, 25].
2.3. Testing for SQL Injection
SQL injection [26–28] takes advantage of the process of web applications accessing databases with queries based on improperly validated user input. The website security mining system finds SQL injection attacks which can bypass firewall and identity authorization to control the database . SQL injection can penetrate any type of database that relies on SQL, regardless of whether the underlying web application is written in ASP, PHP, or JSP as long as the program has a severe yet common logic error. Although there are well-known techniques to combat SQL injection attacks [30, 31], they are still quite common, and, therefore, there has been much interest in developing methods to inspect web applications and detect these vulnerabilities [29, 32, 33].
2.4. Testing for Brute Force
A complete dictionary file is important to our research. The web crawler we designed will detect the pages with weak password , and hence the detection ability [35, 36] will be decided on quality of the dictionary file. In particular in case of crawling database form, ineffective dictionary file causes slow crawling while insufficient dictionary file fails to determine whether the webpage’s password detected reaches the information security standards [37, 38]. With thousands of real experiments, our system refers to many related literatures [9, 39–43] and web vulnerability scanners practically applied. We provide function of adjustable parameters to handle different environment through flexible adjustment (for instance, Http versus FTP, whether complying with protocol of robots.txt, priority of attacks facing numerous database, the depth of crawling a webpage and whether detecting broken links, etc.). However, we do not focus on these issues here.
2.5. The Security Issues from IPv4 to IPv6
There are three techniques to transform IPv4 to IPv6 addresses which are dual stack, tunneling, and translation . Most of the security research with respect to IPv6 has focused upon these translation layers as well as in the authentication and encryption of the individual data packets [45–48]. The primary concern that security researchers have tried to address is the problem of incorrect redirection and spoofing. However, it should be noted that the majority of attacks against the current IPv4 infrastructure do not occur at the transport layer but rather at the application layer  and that these attacks still apply to IPv6. For instance, attacks such as sniffing, application layer attacks , rogue devices, man-in-the-middle attacks, and flooding are still applicable. Both IPv4 and IPv6 are vulnerable when facing application layer attacks , as shown in Figure 2 .
Among many application level attacks methods, SQL injection is the most well known. Furthermore, because it attacks databases which may store information related to accounts and authentication, they are an attractive target to hit. In our evaluation we combine the discovery module which utilizes web crawling with black box penetration methods  to implement a system which is called website security mining system. It has two modules and six functions. The modules are the dynamic scanning module and static mining module. The functions are the syntax analysis function, search engine assistant function, hidden page searching function, vulnerability updating function, specific file searching function, and multidomain lookup with single IP function. The experimental targets are each country’s IPv6 official website. We use the system to crawl each website 24 hours and gather statistics to each site’s found e-mails and injectable URLs to compare the security protection done in each country’s IPv4 website.
3. System Implementation
In order to inspect if information stored on the web presents a security risk, this research combines a web crawler, like those used in search engines, with the concept of application vulnerability inspection, specifically black box and penetration testing. The end product is the website security mining system, a tool to evaluate a website’s security. This system can be separated into two main modules which are the Static Mining module and the Dynamic Scanning module. The Static Mining module inspects a specific website’s robots.txt, E-mails, potential SQL injection URLs, files, and broken links. The Dynamic Scanning module uses the system’s vulnerability-inspecting function by typing keywords into a search engine’s query box to inspect many websites.
Both the Static Mining and Dynamic Scanning modules leverage the system’s vulnerability inspecting function, which has two parts: known website vulnerability inspection and SQL injection inspection. The former compiles a database of open source website vulnerabilities into an XML file which is used to inspect the website to see whether it has the same vulnerability. Algorithm 1 is the format of an XML file. The bug file parameter is a base64 hash and other parameters are converted from the open source website vulnerabilities database. Our system updates its vulnerability database by adopting new vulnerabilities that have been announced on the Exploit Database regularly . By updating the vulnerability database, we can ensure that the vulnerability samples are always updated, similar to how antivirus software regularly updates its virus database.
The website security mining system can find vulnerabilities in a variety of database engines, specifically MS-SQL, MySQL, Access, Oracle, Postgresql, and Sqlite. The steps to identify SQL injection vulnerabilities are as follows. First, an injectable point must be identified by inspecting the website for places where user input may be used in SQL queries. If such an injectable point is found, then further tests are conducted to identify the specific type of database engine. To do this, we take advantage of how different databases use different function names for certain tasks. For example, MS-SQL and MySQL use len( ) to calculate length; however, Oracle uses length( ) to do it. In other words, when you use len(“s”) = 1 to test and receive a normal response, that means the target website uses MS-SQL or MySQL. On the other hand, if this does not work, then the database might be Oracle or other types of database. There are several other functions that can help us determine what the database is. After getting the database’s type, we find table and column names and finally get the database’s data.
The website security mining system can run on any operating systems that are supported by Java. We describe the two basic modules in more detail below.
3.1. Static Mining Module
The Static Mining module runs depth mining on a specific website. There is an option to determine whether you want to follow the website’s robot.txt rules. Robot.txt  is an ASCII-encoded file stored in the website’s root directory that lists files that can and cannot be accessed by search engine crawlers. There is no official standards body or RFC for the robots.txt format. It was created by consensus and ultimately serves only as a recommendation for crawlers, so it cannot protect the website’s private data completely . Other functions of the Static Mining module are identifying e-mail information, potentially injectable URLs, downloadable files, and broken links, which may contain private information.
The Static Mining module starts with a specific web site and then collects all the related pages from it using a breath-first search algorithm. The system assumes that web pages have close relations to the original web page if the link distance is within a certain range [57–59], so it will fetch all links inside the original page then iterate through all of those URLs to fetch all links within them. This type of method can be easily parallelized to improve fetching speed. After files are downloaded by the web crawler, an HTML parser process extracts pages’ URLs and then adds it into the URL queue. Also, the system will call vulnerability inspecting process to inspect URLs, checking whether it has potential vulnerabilities or not.
Figure 3 shows the process of mining a college’s website  by our system. Several injectable URLs were found and by exploiting these vulnerabilities we were able to retrieve the database information shown in Figure 4.
Additionally, we determined that the operating system (OS) of the host was “Microsoft Windows XP Professional,” as shown in Figure 5, which could open up the possibility for further OS-based exploits.
3.2. Dynamic Scanning Module
The most popular search engines today are Google, Yahoo, Baidu, Microsoft Bing, NHN, eBay, Ask.com, Yandex, and Alibaba. With the help of search engines, we can find billions of web pages and their URLs. Our system inspects these websites to determine whether they have vulnerabilities by analyzing the results retrieved from search engines. Our system supports the kinds of query syntaxes used in modern search engines. After you input the keywords, the system can find all related web pages and inspect whether they are at risk for vulnerabilities or not.
Figures 6, 7, and 8 show the different query syntaxes used in different search engines. For Google, it is “inurl:.asp? site:edu nobel prize”; Yahoo is “inurl:.php? site:edu education”; Bing is “inurl:.aspx? site:edu academic”.
This research used the same command, inurl:.asp? |.jsp?|.php?|.aspx? site:com new, to search the ten most popular search engines. 800 web pages were retrieved from each search engine. We found 550 SQL injectable URLs and 21 known website vulnerabilities out of this total of 8000 web pages, which are shown in Figure 9 below. This highlights the fact that SQL injection problems are still very severe on the internet.
Despite SQL queries injection, this system provides functions of backend systems detection , session hijacking , Cookie poisoning , form manipulation , URL parameter tampering , HTTP header modification , bypassing intermediate forms in a multiple-form set , cross-site scripting , third party software misconfiguration , forceful browsing , and several security tests related to application layer. However, we do not focus on these issues here.
We designed two experiments to test the security situation of IPv6’s website on the internet. Experiment 1 uses WSMS’s Dynamic Scanning module to compare the numbers of injectable URL in each IPv4 and IPv6 website. Experiment 2 uses WSMS’s Static Mining module to crawl the websites that have been authorized by IPv6 forum , which can help us realize the situation of e-mail leakage and database leakage in IPv6’s websites.
4.1. Experiment 1
We constructed WSMS in the pure IPv4 environment; it will show “getaddr info failed URL Error” message and stop if it crawled IPv6’s website. In the case where we wish to explore IPv6 addresses, the converse will be true; that is, getaddr info URL failed will be returned for IPv4 address. We uses Dynamic Scanning module to search these four type web pages (asp/aspx/php/jsp) in three different search engines (Google/Yahoo!/Bing) with “world peace” as the keyword. The statements which we type in Google, Yahoo!, and Bing are shown as Google => inurl:asp? world peace Yahoo! => world peace asp? Bing => world peace asp?
We assumed that represents the pure IPv4 web pages that contain world peace, represents the number of URLs that have been inspected by WSMS, and represents the number of URLs that are injectable. The operating process and data results are shown by Tables 1, 2, and 3 (also see Figure 10).
As shown in Table 4 analyzed through type of website, results of Analysis of variance (ANOVA)  ( value = 0.873 > 0.05) showed that the type of website has no significant contribution to the rate of vulnerability in either IPv4 or IPv6. In Tables 5 and 6 analyzed through type of network environment, we knew that IPv4 and IPv6 have great difference in the prevalence of URL injection from results of independent samples -test. In other words, upon the confident level of 95%, the average prevalence rate of injectable URL of IPv4 (5.55%) is larger than IPv6 (2.94%). However, the reasons for above statement remain unclear. We make hypothesis that the main reason that IPv6 sites have better security than IPv4 sites is because the IPv6 sites are newer and the programmers of these sites are more cognizant of vulnerabilities such as SQL injection and have already taken steps to mitigate these issues.
The experiment result shows that the number of inspectable URLs in Google is the highest above all because it supports the function of parameter “inurl.” In IPv4’s situation, ASPX has the least injection problem while ASP gets the worst outcome. In IPv6’s situation, JSP has the least injection problem while ASPX performs poorly. In general, ASPX has much fewer problems and ASP has most problems. From Tables 7 and 8, IPv4 and IPv6 have great difference in the virus number detected in view of types of website, while from the result of Chi-square test, we discovered that ASP website accounts for 34.6% of virus detected in IPv4, followed by JSP with 29.1%; these two kinds of website perform better in IPv6 environment. In IPv6, PHP accounts for 38.9% of virus detected, followed by ASPX with 27.8%, and these two kinds of website perform better in IPv4.
4.2. Experiment 2
We constructed WSMS on the pure IPv6 environment, using Static Mining module to crawl twenty websites which were randomly selected from twenty regions from the IPv6 forum, and then we gathered the amount of E-mail address and injectable URL again (shown in Table 9); we see a significant number of websites in both IPv6 and IPv4 that are susceptible to attack, with IPv6 showing a lower level of vulnerability.
From the above two experiments, we can see that the migration to IPv6 still leaves a great deal of vulnerabilities present in the application level infrastructure with a great deal of vulnerabilities still existing. These vulnerabilities while known can represent the initial springboard for more targeted attacks.
One of the messages from this evaluation is that with respect to the majority of the attacks that are commonly used, IPv6 does not offer any increased level of security versus IPv4. This is not surprising given the fact that the application layer attacks bypass the majority of the security infrastructure built into IPv6. Therefore, the results of this evaluation are hardly surprising. However, one interesting consequence of IPv6 is that given the large address space, it becomes more difficult to identify where malicious attacks are coming from due to the fact that an attacker no longer has to be tied to a small number of IP addresses but instead has a much larger pool with which to hide. Without the need to be readily discoverable by the general public, this level of anonymity becomes a much stronger weapon for the attacker than it is for the defender. That being said, with a better understanding vulnerability, we see that newer systems are much more robust than legacy systems. This perhaps is the most important result of this paper.
The website figures sampled from the experiment can prove that, even though the injection problem of IPv6 website is less than the IPv4 one, IPv6’s security protection on the transport layer does nothing to mitigate shortcomings on the application layer. Therefore, the programming habit [26, 70, 71] of the programmer is still critical. We all know that the information stored online is not one-hundred-percent safe, but one of the measures that an end user can take is to increase the complexity of its password setting [72, 73]. As for the server database side, the plain text password should be encrypted  before it is stored in the database, so that the hacker will not obtain easily authentication tokens when he breaks in the website and obtains the content of the database. The empirical measures show that aside from the website programming logic and database security management, the encrypted storage of the data is also important.
The authors thank the National Science Council, Taiwan, for partially supporting this research under contract no. NSC 102-2221-E-194-036. The authors also feel grateful to anonymous reviewers for their very helpful and constructive criticism. Their suggestions have enabled the authors to improve the quality of this work.
- S. Deering and R. Hinden, IETF RFC2460, Internet Protocol, Version 6, 1998, http://www.ietf.org/rfc/rfc2460.txt.
- M. Boucadair, J. Grimault, P. Lévis, A. Villefranque, and P. Morand, “Anticipate IPv4 address exhaustion: a critical challenge for internet survival,” in Proceedings of the 1st International Conference on Evolving Internet (INTERNET '09), pp. 27–32, Cannes La Bocca, France, August 2009.
- M. Gunn, “War dialing,” 2002.
- Wikipedia, “War dialing,” 2013, http://en.wikipedia.org/wiki/War_dialing.
- R. Oppliger, “Security at the internet layer,” Computer, vol. 31, no. 9, pp. 43–47, 1998.
- S. Weber and L. Cheng, “A survey of anycast in IPv6 networks,” IEEE Communications Magazine, vol. 42, no. 1, pp. 127–132, 2004.
- E. Fong and V. Okun, “Web application scanners: definitions and functions,” in Proceedings of the 40th Annual Hawaii International Conference on System Sciences (HICSS '07), Waikoloa, Hawaii, USA, January 2007.
- X. Fu, X. Lu, B. Peltsverger, S. Chen, K. Qian, and L. Tao, “A static analysis framework for detecting SQL injection vulnerabilities,” in Proceedings of the 31st Annual International Computer Software and Applications Conference (COMPSAC '07), pp. 87–96, Beijing, China, July 2007.
- J. Bau, E. Bursztein, D. Gupta, and J. Mitchell, “State of the art: automated black-box web application vulnerability testing,” in Proceedings of the IEEE Symposium on Security and Privacy (SP '10), pp. 332–345, Oakland, Calif, USA, May 2010.
- G. Pant, P. Srinivasan, and F. Menczer, Crawling the Web, 2004.
- A. Heydon and M. Najork, “Mercator: a scalable, extensible web crawler,” World Wide Web, vol. 2, no. 4, pp. 219–229, 1999.
- H. Y. Kao, S. H. Lin, J. M. Ho, and M. S. Chen, “Mining web informative structures and contents based on entropy analysis,” IEEE Transactions on Knowledge and Data Engineering, vol. 16, no. 1, pp. 41–55, 2004.
- I. S. Altingövde and O. Ulusoy, “Exploiting interclass rules for focused crawling,” IEEE Intelligent Systems, vol. 19, no. 6, pp. 66–73, 2004.
- V. Shkapenyuk and T. Suel, “Design and implementation of a high-performance distributed web crawler,” in Proceedings of the 18th International Conference on Data Engineering, pp. 357–368, San Jose, Calif, USA, March 2002.
- C. Castillo, “Effective web crawling,” Computer Science, The University of Chile in fulfillment: ACM SIGIR Forum, 2004.
- S. Even, Graph Algorithms, Cambridge University Press, New York, NY, USA, 2011.
- A. Paraskevas, I. Katsogridakis, R. Law, and D. Buhalis, “Search engine marketing: transforming search engines into hotel distribution channels,” Cornell Hospitality Quarterly, vol. 52, no. 2, pp. 200–208, 2011.
- M. Weiser, “Program slicing,” IEEE Transactions on Software Engineering, vol. 10, no. 4, pp. 352–357, 1984.
- A. Phalgune, “Testing and debugging web applications: an end-user perspective,” in Proceedings of the IEEE Symposium on Visual Languages and Human Centric Computing, pp. 289–290, Rome, Italy, September 2004.
- N. El Ioini and A. Sillitti, “Open web services testing,” in Proceedings of the IEEE World Congress on Services (SERVICES '11), pp. 130–136, Washington, DC, USA, July 2011.
- N. Khoury, P. Zavarsky, D. Lindskog, and R. Ruhl, “An analysis of black-box web application security scanners against stored SQL injection,” in Proceedings of the IEEE 3rd International Conference on Privacy, Security, Risk and Trust (passat) and IEEE 3rd International Conference on Social Computing (SocialCom '11), pp. 1095–1101, Boston, Mass, USA, October 2011.
- M. Bishop, “About Penetration Testing,” IEEE Security & Privacy, vol. 5, no. 6, pp. 84–87, 2007.
- N. Antunes and M. Vieira, “Enhancing penetration testing with attack signatures and interface monitoring for the detection of injection vulnerabilities in web services,” in Proceedings of the IEEE International Conference on Services Computing (SCC '11), pp. 104–111, Washington, DC, USA, July 2011.
- H. J. Kam and J. J. Pauli, “Work in progress—web penetration testing: effectiveness of student learning in Web application security,” in Proceedings of the Frontiers in Education Conference (FIE '11), pp. F3G-1–F3G-3, Rapid City, SD, USA, November 2011.
- C. Mainka, J. Somorovsky, and J. Schwenk, “Penetration testing tool for web services security,” in Proceedings of the IEEE 8th World Congress on Services (SERVICES '12), pp. 163–170, Honolulu, Hawaii, USA, June 2012.
- D. A. Kindy and A. K. Pathan, “A survey on SQL injection: vulnerabilities, attacks, and prevention techniques,” in Proceedings of the 15th IEEE International Symposium on Consumer Electronics (ISCE '11), pp. 468–471, Singapore, June 2011.
- R. Johari and P. Sharma, “A survey on web application vulnerabilities (SQLIA, XSS) exploitation and security engine for SQL injection,” in Proceedings of the International Conference on Communication Systems and Network Technologies (CSNT '12), pp. 453–458, Rajkot, India, May 2012.
- M. Junjin, “An approach for SQL injection vulnerability detection,” in Proceedings of the 6th International Conference on Information Technology: New Generations (ITNG '09), pp. 1411–1414, Las Vegas, Nev, USA, April 2009.
- V. Chapela, Advanced SQL Injection, 2005.
- R. Overstreet, Protecting Yourself from SQL Injection Attacks, 2006.
- S. W. Boyd and A. D. Keromytis, “SQLrand: preventing SQL injection attacks,” pp. 292–302.
- C. Anley, More Advanced SQL Injection, An NGSSoftware Insight Security Research (NISR) Publication, 2002.
- C. Anley, Advanced SQL Injection in SQL Server Application, An NGSSoftware Insight Security Research (NISR) Publication, 2002.
- E. H. Spafford, “OPUS: preventing weak password choices,” Computers and Security, vol. 11, no. 3, pp. 273–278, 1992.
- D. P. Jablon, “Extended password key exchange protocols immune to dictionary attack,” in Proceedings of the 6th IEEE Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises, pp. 248–255, Cambridge, Mass, USA, June 1997.
- S. M. Bellovin and M. Merritt, “Augmented encrypted key exchange: a password-based protocol secure against dictionary attacks and password file compromise,” in Proceedings of the 1st ACM Conference on Computer and Communications Security, pp. 244–250, ACM, November 1993.
- B. Schneier, “Attack trees,” Dr. Dobb's Journal, vol. 24, no. 12, pp. 21–29, 1999.
- L. R. Knudsen and M. J. B. Robshaw, “Brute force attacks,” in The Block Cipher Companion, Information Security and Cryptography, pp. 95–108, Springer, Berlin, Germany, 2011.
- M. Vieira, N. Antunes, and H. Madeira, “Using web security scanners to detect vulnerabilities in web services,” in Proceedings of the IEEE/IFIP International Conference on Dependable Systems and Networks (DSN '09), pp. 566–571, Lisbon, Portugal, July 2009.
- J. Fonseca, M. Vieira, and H. Madeira, “Testing and comparing web vulnerability scanning tools for SQL injection and XSS attacks,” in Proceedings of the 13th Pacific Rim International Symposium on Dependable Computing (PRDC '07), pp. 365–372, Melbourne, Australia, December 2007.
- S. Kals, E. Kirda, C. Kruegel, and N. Jovanovic, “SecuBat: a web vulnerability scanner,” in Proceedings of the 15th International Conference on World Wide Web, pp. 247–256, ACM, May 2006.
- N. Antunes and M. Vieira, “Detecting SQL injection vulnerabilities in web services,” in Proceedings of the 4th Latin-American Symposium on Dependable Computing (LADC '09), pp. 17–24, Joao Pessoa, Brazil, September 2009.
- L. Auronen, “Tool-based approach to assessing Web application security,” in Seminar on Network Security, vol. 11, pp. 12–13, Helsinki University of Technology, 2002.
- E. Nordmark and R. Gilligan, IETF RFC4213, Basic Transition Mechanisms for IPv6 Hosts and Routers, 2005, http://www.ietf.org/rfc/rfc4213.txt.
- A. R. Choudhary, “In-depth analysis of IPv6 security posture,” in Proceedings of the 5th International Conference on Collaborative Computing: Networking, Applications and Worksharing (CollaborateCom '09), November 2009.
- S. Szigeti and P. Risztics, “Will IPv6 bring better security?” in Proceedings of the 30th EUROMICRO Conference, pp. 532–537, September 2004.
- E. Davies, S. Krishnan, and P. Savola, IETF RFC4942, IPv6 Transition/Coexistence Security Considerations, 2007, http://www.ietf.org/rfc/rfc4942.txt.
- R. Priyadarshini, S. Aishwarya, and A. A. Ahmed, “Search engine vulnerabilities and threats—a survey and proposed solution for a secured censored search platform,” in Proceedings of the International Conference on Communication and Computational Intelligence (INCOCCI '10), pp. 535–539, Erode, India, December 2010.
- Wikipedia, “Application security,” 2012, http://en.wikipedia.org/wiki/Application_security.
- D. Watson, “Web application attacks,” Network Security, vol. 2007, no. 10, pp. 10–14, 2007.
- R. Radhakrishnan, M. Jamil, S. Mehfuz, and M. Moinuddin, “Security issues in IPv6,” in Proceedings of the 3rd International Conference on Networking and Services (ICNS '07), p. 110, Athens, Greece, June 2007.
- D. Yang, X. Song, and Q. Guo, “Security on IPv6,” in Proceedings of the 2nd IEEE International Conference on Advanced Computer Control (ICACC '10), pp. 323–326, March 2010.
- Y. W. Huang, C. Tsai, T. Lin, S. Huang, D. T. Lee, and S. Kuo, “A testing framework for web application security assessment,” Computer Networks, vol. 48, no. 5, pp. 739–761, 2005.
- O. Security, “The exploit database,” 2012, http://www.exploit-db.com.
- Y. Sun, I. G. Councill, and C. L. Giles, “BotSeer: an automated information system for analyzing Web robots,” in Proceedings of the 8th International Conference on Web Engineering (ICWE '08), pp. 108–114, Yorktown Heights, NJ, USA, July 2008.
- Y. Sun, I. G. Councill, and C. L. Giles, “The ethicality of web crawlers,” in Proceedings of the IEEE/WIC/ACM International Conference on Web Intelligence, WI 2010, pp. 668–675, Toronto, Canada, September 2010.
- J. Cho, H. Garcia-Molina, and L. Page, “Efficient crawling through URL ordering,” in Proceedings of the 7th International Conference on World Wide (WWW '98), pp. 161–172, 1998.
- V. Shkapenyuk and T. Suel, “Design and implementation of a high-performance distributed web crawler,” in Proceedings of the 18th International Conference on Data Engineering, pp. 357–368, March 2002.
- M. Najork, “Breadth-first search crawling yields high-quality pages,” in Proceedings of the 10th International Conference on World Wide (WWW '01), pp. 114–118, 2001.
- National Taiwan University, 2012, http://www.ntu.edu.tw/english/.
- N. Gaur, “Assessing the security of your web applications,” Linux Journal, vol. 2000, no. 72, article 3, 2000.
- P. Noiumkar and T. Chomsiri, “Top 10 free web-mail security test using session Hijacking,” in Proceedings of the 3rd International Conference on Convergence and Hybrid Information Technology (ICCIT '08), vol. 2, pp. 486–490, Busan, Republic of Korea, November 2008.
- D. Gollmann, “Securing Web applications,” Information Security Technical Report, vol. 13, no. 1, pp. 1–9, 2008.
- D. Scott and R. Sharp, “Abstracting application-level web security,” in Proceedings of the 11th International Conference on World Wide Web (WWW '02), pp. 396–407, ACM Press, May 2002.
- D. Scott and R. Sharp, “Abstracting application-level web security,” in Proceedings of the 11th International Conference on World Wide Web (WWW '02), pp. 396–407, ACM Press, May 2002.
- D. J. Bryce and T. C. Williams, “HTTP header intermediary for enabling session-based dynamic site searches,” U.S. Patent Application 11/299, 525.
- P. Vogt, F. Nentwich, N. Jovanovic, E. Kirda, C. Kruegel, and G. Vigna, “Cross site scripting prevention with dynamic data tainting and static analysis,” in Proceeding of the Network and Distributed System Security Symposium (NDSS '07), 2007.
- Forum, I. IPv6 Enabled WWW Web Sites List, 2012, http://www.ipv6forum.com/ipv6_enabled/approval_list.php.
- C. M. Judd, G. H. McClelland, and C. S. Ryan, Data Analysis: A Model Comparison Approach, Routledge/Taylor & Francis Group, 2009.
- N. Jovanovic, C. Kruegel, and E. Kirda, “Pixy: a static analysis tool for detecting web application vulnerabilities,” in Proceedings of the IEEE Symposium on Security and Privacy (S and P '06), pp. 258–263, Berkeley/Oakland, Calif, USA, May 2006.
- M. A. Howard, “A process for performing security code reviews,” IEEE Security and Privacy, vol. 4, no. 4, pp. 74–79, 2006.
- P. Cisar and S. M. Cisar, “Password—a form of authentication,” in Proceedings of the 5th International Symposium on Intelligent Systems and Informatics (SISY '07), pp. 29–32, Subotica, Serbia, August 2007.
- S. Riley, “Password security: what users know and what they actually do,” Usability News 8.1, 2006.
- X. Zheng and J. Jidong, “Research for the application and safety of MD5 algorithm in password authentication,” in Proceedings of the 9th International Conference on Fuzzy Systems and Knowledge Discovery (FSKD '12), pp. 2216–2219, Sichuan, China, 2012.