Trust Module Authorization Logic for Memory Constrained Security
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing computing systems face challenges in establishing trust during online transactions, particularly in ensuring that access is granted to authorized entities rather than unauthorized systems, due to the lack of effective mechanisms for verifying the identity and role of parties involved.
Innovation Solution
The disclosed architecture employs a trust module that uses arbitrary logical combinations of authorization values, computed through a proofing process, to authorize access to entities by generating a statistically unique digest that matches a predetermined proof value, ensuring secure access based on symmetric and asymmetric authorizations.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If traditional public and private key systems are used for trust verification, then identity authentication is provided, but the system complexity and computational overhead increase significantly
Solution Approach 1:
The patent segments the trust verification process into distinct authorization types (symmetric and asymmetric) that can be independently evaluated and combined. Each authorization type is processed separately through logical expressions, allowing the system to break down complex verification into manageable components rather than using monolithic key systems
Solution Approach 2:
The trust module is designed to handle multiple types of authorizations (symmetric and asymmetric) through a unified logical expression evaluation system. This multi-functional approach allows the same hardware module to perform diverse authorization checks without requiring separate dedicated systems for each type
2Reliability
If comprehensive authorization checks are performed to ensure secure access, then security is improved, but the processing time and computational resources increase
Solution Approach 1:
The system pre-evaluates logical expressions containing authorization values before actual access requests occur. By preparing and storing the results of these logical evaluations in advance, the system avoids performing complex computational checks during time-critical access operations, thus reducing processing time while maintaining security
Solution Approach 2:
The trust module evaluates only the necessary portion of logical expressions based on the specific authorization type required. Rather than always performing complete comprehensive checks, the system selectively processes symmetric or asymmetric authorizations based on the access context, reducing unnecessary computational overhead
3Adaptability or versatility
If multiple types of authorizations (symmetric and asymmetric) are supported, then versatility is improved, but the internal state requirements and memory constraints are worsened
Solution Approach 1:
The patent extracts and separates the evaluation of different authorization types into distinct logical expression components. By isolating symmetric and asymmetric authorization evaluations into separate processing paths, the system can handle multiple authorization types without requiring a unified complex internal state structure, thus reducing memory requirements
Data Source
AI summary
Architecture that utilizes logical combinations (e.g., of Boolean logic) of authorizations as a logical authorization expression that is computed through a proofing process to a single proof value which equates to authorizing access to an intended entity. The authorizations are accumulated and processed incrementally according to an evaluation order defined in the authorization expression. The logical combinations can include Boolean operations that evaluate to a proof value associated with a sum of products expression (e.g., combinations of AND, OR, etc.). The incremental evaluations output corresponding hash values as statistically unique identifiers used in a secure hash algorithm that when evaluated in order allow execution of a specific command to access the entity. The architecture, employed in a trust module, uses minimal internal trust module state, and can be employed as part of a device system that handles trust processing to obtain authorization to access the intended entity.