{'fraction_non_alphanumeric': 0.017123287671232876, 'fraction_numerical': 0.0, 'mean_word_length': 5.448529411764706, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Web Service Security Policy Matching Based on Semantics

An improved matching algorithm of Web service security concerns is proposed in this paper. It performs matching requirement and capability security concerns of both consumer and provider. WS-SP specifies the security requirements or capabilities of different web service participants. Security requirement/capability of a participant is one of the most important non-functional properties of a web service. The security concerns addressed within this paper emphasis on the security of a message (integrity and confidentiality) transmitted between the two participants. The proposed matching algorithm states matching of a simple policy and complex policy of WS-SP. In addition, a generalized matching algorithm is introduced to get the best-matched provider from a list of available providers for consumer requirements.