Dynamic Approval Policy for Distributed Ledger Fraud Prevention
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In consortium-type distributed ledger systems, the design of the agreement policy is vulnerable to fraudulent transactions, particularly when client nodes collude with approval nodes, leading to potential deterioration in transaction performance due to increased processing load and reduced transaction speed.
Innovation Solution
An electronic transaction system that includes a relationship map storage unit, policy requirement storage unit, and an agreement policy calculation unit to generate an agreement policy based on the relationship map and policy requirements, ensuring that only trusted nodes approve transactions, thereby reducing the risk of fraud and maintaining transaction performance.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If the number of approval nodes is increased to prevent collusion, then transaction security is improved, but transaction processing speed deteriorates
Solution Approach 1:
The patent changes the selection parameter from random or static node selection to dynamic selection based on relationship evaluation. The system calculates relationship values between nodes and dynamically determines which nodes to request approval from, allowing flexible adjustment of security versus speed trade-offs without increasing the total number of nodes.
Solution Approach 2:
The system automatically evaluates relationships between nodes and autonomously determines the optimal set of approval nodes based on calculated relationship values. This self-service mechanism eliminates the need for manual configuration or increasing node counts to ensure security, as the system自适应ly adjusts its approval process.
2Reliability
If all nodes are required to approve transactions, then transaction reliability is improved, but transaction processing efficiency deteriorates
Solution Approach 1:
The patent implements partial approval action by requiring approval from only a subset of nodes rather than all nodes. The system calculates relationship values and selects the minimum necessary number of nodes whose approvals are required, achieving sufficient reliability without the excessive overhead of universal approval.
Solution Approach 2:
The system changes the approval threshold parameter dynamically based on relationship evaluations. Instead of a fixed requirement for all nodes, the approval threshold is adjusted according to the calculated relationship values, allowing efficient processing while maintaining reliability through selective node approval.
3Measurement precision
If relationship evaluation is performed for all node combinations, then approval accuracy is improved, but computational load increases
Solution Approach 1:
The patent segments the node evaluation process by dividing nodes into groups based on relationship values. Instead of evaluating all possible node combinations, the system segments nodes into relevant and irrelevant groups, performing detailed evaluation only on segments that contribute to the transaction, thereby reducing computational load while maintaining accuracy.
Solution Approach 2:
The system performs relationship evaluation partially by focusing computational resources only on nodes that are relevant to the specific transaction based on pre-calculated relationship values. This partial evaluation approach achieves sufficient approval accuracy without the excessive computational burden of evaluating all node combinations.
Data Source
AI summary
According to one embodiment, an electronic transaction device includes: a relationship map storage unit that stores a relationship map (a participant relationship map) which is information indicating a relationship between a plurality of parties involved in a predetermined transaction; a policy requirement storage unit that stores policy requirements, which are requirements for the parties involved in the transaction, necessary for the closing of the transaction; an agreement policy calculation unit that generates an agreement policy which is a condition related to an approver of a transaction indicated by transaction data holding a predetermined transaction content, based upon the relationship map and the policy requirements; and an approval request transmission unit that transmits a predetermined approval request to a predetermined information processing device associated with an approver of a transaction specified based upon the generated agreement policy.