URL Fragment Matching for Security Detection
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Comparing Uniform Resource Locators (URLs) to identify security vulnerabilities such as malware, phishing, and spam is computationally intensive and resource-consuming due to the large volume of unique URLs and variations referring to the same resource.
Innovation Solution
A link processing service generates URL fragments by parsing URLs, derives keys for efficient storage and lookup using a transposition of the domain name and a one-way hash, and applies rules based on trust scores and source identifiers to classify URLs as safe or abusive.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If URL comparison is performed to identify security vulnerabilities, then security detection capability is improved, but processing time and resource consumption increase
Solution Approach 1:
The patent segments URLs into distinct components (domain name, path, query parameters) and creates separate key-value stores for each component. This segmentation allows the system to compare only relevant parts of URLs rather than performing full-string comparisons, significantly reducing processing time while maintaining security detection capability.
Solution Approach 2:
The patent transforms URLs into a standardized parameter format by extracting and normalizing components such as domain names, paths, and query parameters. This parameter transformation enables efficient comparison by converting variable-length strings into structured data with consistent formats, reducing both processing time and resource consumption.
2Reliability
If URL comparison is performed to identify security vulnerabilities, then security detection capability is improved, but computing resource consumption increases
Solution Approach 1:
The patent divides URLs into component segments and stores them in separate key-value stores. This segmentation reduces memory access patterns and allows for more efficient cache utilization, decreasing computing resource consumption while maintaining the ability to detect security vulnerabilities through component-level comparison.
Solution Approach 2:
The patent creates simplified key representations (copies) of URL components that can be quickly compared against stored values. These key copies contain only the essential identifying information needed for security detection, reducing the computational overhead of storing and comparing full URL strings.
3Measurement precision
If multiple URL fragments are generated to handle URL variations, then matching accuracy is improved, but device complexity increases
Solution Approach 1:
The patent segments URLs into standardized components and generates key-value pairs for each segment. This systematic segmentation improves matching accuracy by ensuring consistent comparison of equivalent URL parts while managing complexity through a regular, repeatable process rather than ad-hoc fragment generation.
Solution Approach 2:
The patent creates a universal key-value store structure that can handle multiple URL variations and formats through a single standardized interface. This universal approach improves matching accuracy across different URL styles while reducing system complexity by avoiding the need for separate handling logic for each URL variation type.
Data Source
AI summary
The present disclosure is directed to systems and methods for determining a match between uniform resource locators (URL) fragments. A server may maintain a record for a first URL against which to compare. The first URL may have a first domain name, a first path name, and first strings. The record may include a first keys for a corresponding first URL fragments from the first URL. Each first URL fragment may have the first domain name, the first path name, and a first permutation of the first strings. The server may generate a second keys using a corresponding second URL fragments from a second URL. Each second URL fragment may have a second domain, a second path name, and a second permutation of the second strings. The server may determine a match between at least one of the first keys and at least one of the second keys.