Method for verifying web system license based on multi-way tree search

A method for verifying a web system license based on multi-way tree search, comprising steps of:

• step 1:
• identifying a requiring uniform resource locator (URL for short) of each function;
• step 2:
• using the requiring URL of the function as a mark, writing the mark in a license;
• step 3:
• encrypting the license with an asymmetric encryption algorithm for generating a cipher text, and storing the cipher text in a web system;
• step 4:
• during initializing of the web system, decrypting the cipher text with a corresponding asymmetric decryption algorithm, and sending to a memory;
• step 5:
• establishing a multi-way tree according to a URL of an authorized function in the license;
• and
• step 6:
• receiving a requirement for a specific function by the web system, using the requiring URL as a searching value and matching in the multi-way tree;
• wherein if a corresponding URL is found, the function is authorized and further operation is required until response returning;
• if the corresponding URL is not found, the requirement is intercepted, and a response is returned that the specific function required is not authorized;
• wherein the requiring URL is a unique identifier for accessing a certain page of the web system or calling a certain interface of the web system;
• the requiring URL has a multi-level structure, levels thereof are divided with a semicolon;
• wherein encrypting with the asymmetric encryption algorithm comprises encrypting the license with a public key;
• decrypting with the asymmetric decryption algorithm comprises decrypting the license with a private key;
• wherein decrypting the cipher text and sending to the memory comprises decrypting the license in the cipher text into a clear text, and storing the clear text as an object of the memory;
• wherein establishing the multi-way tree according to the URL of the authorized function in the license comprises steps of:
• step 1:
• dividing each function URL in the license with “/” for forming identifiers with different levels;
• step 2:
• firstly providing a root node “/” of the multi-way tree, inserting the identifiers into the multi-way tree as tree nodes according to the levels;
• and
• step 3:
• stopping inserting if a same node exists under a same root node, and repeating until all function URLs are treated;
• then establishing the multi-way tree.