Merkle Root Digital Identity Authentication
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Asymmetric cryptography systems face vulnerabilities due to the computational ability to reconstruct private keys from public keys, necessitating frequent key pair rotations and certificate issuance, which complicates secure digital identity management.
Innovation Solution
Simultaneously associating multiple public/private key pairs with a user, constructing a Merkle root from their hashes, and using this root for verification, allowing the user to switch private keys without reissuing certificates, while keeping public keys secret until use, and enabling distributed key generation and blockchain-based record-keeping.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If a single public/private key pair is assigned to a user, then the digital identity system is simple to manage, but the security strength is insufficient due to the ability to reconstruct private keys from public keys
Solution Approach 1:
The patent segments the digital identity system by assigning multiple public/private key pairs to a single user instead of using one key pair. Each key pair can be used independently, and the loss or compromise of one key pair does not affect the others. This segmentation approach enhances security strength by providing redundancy and reducing the risk associated with a single key pair.
Solution Approach 2:
The patent creates a composite digital identity structure by combining multiple public/private key pairs into a unified identity system. The verification process uses a composite approach where the verifier can select any subset of the user's key pairs for verification, creating a flexible and robust security framework that leverages the strengths of multiple cryptographic key pairs.
2Reliability
If key pairs are rotated frequently to maintain security, then the security strength is improved, but the certificate issuance process becomes more complex and time-consuming
Solution Approach 1:
The patent applies preliminary action by pre-assigning multiple key pairs to the user during the initial identity creation process. This eliminates the need for frequent key pair rotations and certificate re-issuances, as the user already possesses multiple key pairs that can be used interchangeably. The security strength is maintained without the time loss associated with frequent certificate issuance.
Solution Approach 2:
The patent enables the user to discard compromised or expired key pairs and recover security by using alternative key pairs from the same identity set. This approach allows for seamless key management where individual key pairs can be discarded without affecting the overall digital identity, eliminating the need for time-consuming certificate re-issuance processes.
3Reliability
If multiple public keys are associated with a user, then the security strength is enhanced, but the verification process becomes more complex
Solution Approach 1:
The patent implements universality by creating a verification mechanism that can handle multiple public keys through a unified approach. The verifier is provided with a set of public keys and can selectively use any subset for verification purposes. This multi-functional verification process maintains ease of operation while supporting multiple key pairs, as the same verification logic applies regardless of how many key pairs the user possesses.
Solution Approach 2:
The patent introduces an intermediary verification process where the system provides a structured set of public keys to the verifier, acting as a mediator between the user's multiple key pairs and the verification process. This intermediary layer simplifies the verification ease by presenting a organized set of keys and a clear verification procedure, preventing the process from becoming complex despite the presence of multiple public keys.
Data Source
Figure 1
Figure 2a
Figure 2b
AI summary
A method of digital identity generation and authentication based on the association of a plurality of public/private key pairs with a user and comprising a (Step 2) of constructing a Merkle tree having at least said plurality of public keys as elements of a related bottom level and a (Step 3) of computing a hash set (H) in which each item corresponds to each of the nodes of said Merkle tree, including a related first Merkle root (Z), and storing said Merkle tree for subsequent comparison necessary for verifying said digital identity.