Hash-Based Permission Graphs for Faster Network Access Control
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional network-based permissioning systems face inefficiencies and increased processing due to the large number of nodes in hierarchical resource graphs, leading to inconsistent user access permissions and redundant development across applications.
Innovation Solution
A network-based permissioning system uses hash-based security node identifiers to generate and manage access permissions, reducing the need for redundant evaluations by creating a compact hierarchy resource graph with security nodes that aggregate common security across transactions.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If conventional hierarchical resource graphs are used to manage user access permissions, then comprehensive permission control is achieved, but processing time and computational resources increase significantly
Solution Approach 1:
The patent extracts and isolates the security evaluation logic from the large hierarchical resource graph by introducing security node hash identifiers. These identifiers represent aggregated security states that can be evaluated independently, removing the need to traverse entire permission hierarchies for each access request, thus reducing evaluation time while maintaining accuracy
Solution Approach 2:
The patent transforms the permission evaluation problem by changing the representation parameters from detailed hierarchical node structures to condensed hash identifiers. This parameter transformation allows equivalent security information to be represented in a more compact form that enables faster comparison and evaluation operations
2Reliability
If detailed hierarchical resource graphs with many nodes are maintained, then precise permission tracking is achieved, but device complexity and processing overhead increase
Solution Approach 1:
The patent merges multiple hierarchical nodes into single security node hash identifiers that represent aggregated security states. By combining the security information of parent and child nodes into unified hash representations, the system reduces the number of individual nodes that need to be tracked while preserving the hierarchical permission relationships
Solution Approach 2:
The security node hash identifiers serve multiple functions: they represent security states, enable permission evaluation, and facilitate inheritance relationships simultaneously. This multi-functionality reduces the need for separate structural elements, simplifying the overall system complexity while maintaining comprehensive permission tracking
3Reliability
If security policies are maintained for each individual node in the hierarchy, then granular security control is achieved, but processing overhead and computational resources increase
Solution Approach 1:
The patent creates hash identifier copies that represent security states without requiring the original detailed node structures. These hash copies can be rapidly generated and compared, enabling efficient security evaluations while maintaining the granularity of control through the cryptographic properties of the hash functions
Data Source
AI summary
Systems and methods generate a first security node hash identifier by performing a first hash operation, such as a one-way hash, on a first data resource identifier associated with a first data resource, such as a data set, produced by a data resource platform. The systems and methods generate a dependent second security node hash identifier by performing a second hash operation on a second data resource identifier associated with a dependent second data resource produced by the data resource platform and on the first security node hash identifier, receive an access request for access to the dependent second data resource; and in response to the access request, grant permission to access the dependent second data resource to a user associated with the access request based on the dependent second security node hash identifier.