Intermediate Server Authentication Registration via Merkle Tree Root Hash
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing methods for recording authentication information in blockchain are inefficient, leading to bottlenecks and high transaction costs, especially during increased transactions, as they require registering all information and incurring fees for each transaction.
Innovation Solution
A method using an intermediate server that creates and manages authentication information by combining biometric authentication with blockchain technology, registering only a representative hash value of a Merkle tree's root value instead of all authentication information, thereby reducing the load on the blockchain and transaction costs.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If all authentication information is recorded in blockchain, then data integrity is ensured, but transaction costs increase and service speed decreases
Solution Approach 1:
The patent extracts only the essential authentication information (public key and biometric hash) and stores it in blockchain, while keeping detailed authentication data in traditional databases. This selective extraction maintains data integrity for critical elements while avoiding the performance penalty of storing all data in blockchain.
Solution Approach 2:
The authentication information is segmented into two parts: critical authentication data (public key, biometric hash) stored in blockchain for integrity, and supplementary data stored in traditional databases for efficient access. This segmentation resolves the contradiction by placing different types of data in appropriate storage systems.
2Reliability
If all authentication information is recorded in blockchain, then forgery and falsification are prevented, but transaction costs become high
Solution Approach 1:
The patent extracts only the critical authentication elements (public key and biometric hash) that need blockchain's anti-forgery properties, while storing less critical data in traditional databases. This reduces the number of blockchain transactions and associated costs while maintaining security for essential data.
Solution Approach 2:
Instead of applying blockchain to all authentication data, the patent applies it partially only to the most critical elements. This partial action approach prevents forgery where needed while avoiding the excessive cost of applying blockchain to all data.
3Reliability
If authentication information is recorded in blockchain for all cases, then security is maintained, but bottlenecks occur during increased transactions
Solution Approach 1:
The system segments authentication operations into two paths: critical authentication data goes through blockchain for security, while non-critical data operations use traditional databases for high throughput. This segmentation maintains security for essential operations while achieving high transaction throughput for others.
Solution Approach 2:
The patent introduces an intermediary layer (traditional database) that handles non-critical authentication data operations, reducing the load on blockchain. This intermediary maintains security for critical data while enabling high-speed processing for routine operations.
Data Source
AI summary
A method for creating and registering the authentication information is provided. The method includes steps of: (a) an intermediate server determining whether the specific user's public key is registered if (i) the specific user's public key and (ii) a hash value of the specific user's information or its processed value are acquired from the biometric authentication server which received a request for registration of authentication information; and (b) the intermediate server, if the specific user's public key is determined to be unregistered and at least one certain anchoring condition is satisfied, registering with a database a representative hash value or its processed value in a certain data structure, wherein the representative hash value is created by using (1) a specific hash value and (2) at least one hash value of at least one neighboring node which corresponds to a node of the specific hash value.