期刊文献+

Worst-Input Mutation Approach to Web Services Vulnerability Testing Based on SOAP Messages 被引量:2

Worst-Input Mutation Approach to Web Services Vulnerability Testing Based on SOAP Messages
原文传递
导出
摘要 The growing popularity and application of Web services have led to increased attention regarding the vulnerability of software based on these services. Vulnerability testing examines the trustworthiness and reduces the security risks of software systems. This paper proposes a worst-input mutation approach for testing Web service vulnerability based on Simple Object Access Protocol (SOAP) messages. Based on characteristics of SOAP messages, the proposed approach uses the farthest neighbor concept to guide generation of the test suite. The corresponding automatic test case generation algorithm, namely, the Test Case generation based on the Farthest Neighbor (TCFN), is also presented. The method involves partitioning the input domain into sub-domains according to the number and type of SOAP message parameters in the TCFN, selecting the candidate test case whose distance is the farthest from all executed test cases, and applying it to test the Web service. We also implement and describe a prototype Web service vulnerability testing tool. The tool was applied to the testing of Web services on the Internet. The experimental results show that the proposed approach can find more vulnerability faults than other related approaches. The growing popularity and application of Web services have led to increased attention regarding the vulnerability of software based on these services. Vulnerability testing examines the trustworthiness and reduces the security risks of software systems. This paper proposes a worst-input mutation approach for testing Web service vulnerability based on Simple Object Access Protocol (SOAP) messages. Based on characteristics of SOAP messages, the proposed approach uses the farthest neighbor concept to guide generation of the test suite. The corresponding automatic test case generation algorithm, namely, the Test Case generation based on the Farthest Neighbor (TCFN), is also presented. The method involves partitioning the input domain into sub-domains according to the number and type of SOAP message parameters in the TCFN, selecting the candidate test case whose distance is the farthest from all executed test cases, and applying it to test the Web service. We also implement and describe a prototype Web service vulnerability testing tool. The tool was applied to the testing of Web services on the Internet. The experimental results show that the proposed approach can find more vulnerability faults than other related approaches.
出处 《Tsinghua Science and Technology》 SCIE EI CAS 2014年第5期429-441,共13页 清华大学学报(自然科学版(英文版)
基金 supported by the National Natural Science Foundation of China (Nos. 61202110 and 61063013) the Natural Science Foundation of Jiangsu Province (No. BK2012284)
关键词 security testing Web service vulnerability SOAP message test case generation mutation operator security testing Web service vulnerability SOAP message test case generation mutation operator
  • 相关文献

参考文献4

二级参考文献41

  • 1黄宁,余莹,张大勇.Web服务软件测试技术的研究与实现[J].计算机工程与应用,2004,40(35):147-149. 被引量:18
  • 2姜瑛,辛国茂,单锦辉,张路,谢冰,杨芙清.一种Web服务的测试数据自动生成方法[J].计算机学报,2005,28(4):568-577. 被引量:50
  • 3毛澄映,卢炎生.构件软件测试技术研究进展[J].计算机研究与发展,2006,43(8):1375-1382. 被引量:32
  • 4Flip K, MuthttklJshnan S. Influence sets based on reverse nearest neighbor queries[ C]. SIGMOD, 2000, 201-212.
  • 5Tao Yu-fei, Yiu Man-lung. Mamoulis Nikos. Reverse nearest neighbor search in metric spaces [ J ]. IEEE Transactions on Knowledge and Data Engineering, 2006, 18(9), 1239-1252.
  • 6Sergio Cabello, Miguel Diaz-Banez J, Stefan Langerman, et al. Reverse facility location problems [ C ]. In: Proceedings of the 17 th Canadian Conference on Computational Geometry, 2005, 68-71.
  • 7Bohm C, Berchtold S, Keim D. Searching in high-dimensional spaces-index structures for improving the performance of multimedia databases[J]. ACM Computing Surveys, 2001, 33(3) : 322- 373.
  • 8Ciaccia P, Patella M, Zezula P. M-tree: an efficient access method for similarity search in metficspaces[ C]. VLDB, 1997, 426-435.
  • 9McGraw Gary,Allen Booz.Software security testing[J].IEEE Security&Privacy,2004,2(5):81-85.
  • 10Thompson Herbert H.,Whittaker James A.Mottay Florence E.Software security vulnerability testing in hostile environments[C].In:Haddad H and Papadopoulos G,ed.the 2002 ACM symposium on Applied computing Madrid,Spain:2002,260-264.

共引文献22

同被引文献16

引证文献2

二级引证文献8

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部