Four papers accepted for the Combinatorial Security Testing Team of SBA Research
The interplay between discrete mathematics and computer science is crucial for the successful deployment of real-world applications but also necessary for the advancement of theoretical approaches and methodologies. Recently, the combinatorial security testing team of SBA Research has marked significant contributions in this regard:
- The paper “Algebraic Modelling of Covering Arrays” by Bernhard Garn and Dimitris Simos (both with SBA Research) has been accepted in Springer Proceeding Series in Mathematics and Statistics.
- The papers “Set-based Algorithms for Combinatorial Test Set Generation” by Ludwig Kampel and Dimitris Simos (both with SBA Research) and “A Combinatorial Approach to Analyzing Cross-Site Scripting (XSS) Vulnerabilities in Web Application Security Testing” by Dimitris Simos (SBA Research), Kristoffer Kleine (SBA Research), Laleh Ghandehari (University of Texas at Arlington), Bernhard Garn (SBA Research) and Jeff Yu Lei (University of Texas at Arlington) have been both accepted for publication at the 28th International Conference on Testing Software and Systems (ICTSS-2016) which takes place on October 17-19 at Graz, Austria.
- The paper “TLS Cipher Suites Recommendations: A Combinatorial Coverage Measurement Approach” by Dimitris Simos (SBA Research), Kristoffer Kleine (SBA Research), Artemios Voyiatzis (SBA Research), Rick Kuhn (NIST) and Raghu Kacker (NIST) has been accepted for publication at the 2016 IEEE International Conference on Software Quality, Reliability and Security (QRS 2016) which takes place on August 1-3 at Vienna, Austria.
The results of these papers demonstrate the effectiveness of combinatorial methods in security testing together with theoretical advancements on related algorithms for combinatorial testing.