Lightweight Node Blockchain Storage and Self-Dependent Authentication
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In decentralized networks of lightweight nodes, the reliance on a certificate authority for both initial enrollment and later authentication creates a centralized system vulnerable to single points of failure, delays, and availability issues, particularly in authentication processes.
Innovation Solution
Implementing a method where lightweight nodes in a decentralized network store block headers and a revocation list, allowing them to perform self-dependent authentication using a lightweight consensus algorithm, such as Neurochain, and utilizing data Merkle roots and intermediate hashes for public key verification, reducing reliance on full nodes.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Quantity of substance
If lightweight nodes store only block headers and use simplified payment verification (SPV) technique, then storage requirements are reduced, but authentication capability is weakened as they become reliant on full nodes
Solution Approach 1:
Lightweight nodes perform self-dependent authentication by verifying public keys against the data Merkle root stored in block headers they already possess. The authentication process uses locally stored intermediate hashes and the data Merkle root to verify enrollment transactions without requiring full nodes, enabling nodes to authenticate themselves independently.
Solution Approach 2:
The patent extracts only the essential authentication elements (data Merkle root, intermediate hashes, public keys) from the full blockchain and stores them in lightweight block headers. This extraction allows lightweight nodes to have sufficient data for authentication without storing the entire blockchain, resolving the contradiction between minimal storage and authentication capability.
2Reliability
If a certificate authority is used for both initial enrollment and later authentication, then security is established through centralized trust, but system vulnerability increases due to single points of failure and availability issues
Solution Approach 1:
The patent segments the authentication function from the centralized certificate authority model. Instead of a single CA performing both enrollment and authentication, the system divides authentication into distributed verification of enrollment transactions (performed once during enrollment) and independent public key verification (performed locally by any lightweight node during authentication). This segmentation eliminates the single point of failure while maintaining security.
Solution Approach 2:
The data Merkle root acts as an intermediary between the enrollment transaction and the public key verification process. Rather than requiring direct access to the certificate authority or full blockchain, lightweight nodes use the data Merkle root (stored in block headers) as an intermediary to verify public keys. This intermediary enables decentralized authentication while maintaining the security guarantees of the original enrollment process.
3Ease of operation
If lightweight nodes rely on full nodes for authenticating other lightweight nodes, then authentication can be performed, but communication overhead and network dependency increase
Solution Approach 1:
Lightweight nodes perform self-dependent authentication by using the data Merkle root and intermediate hashes stored in their local block headers to verify public keys. The authentication process queries the local blockchain data rather than requiring communication with full nodes, eliminating communication overhead while maintaining authentication capability.
Data Source
AI summary
A lightweight node in a decentralized network includes stores a blockchain with a plurality of blocks. The lightweight node adds blocks to the blockchain successively. A given block having a header and a body. The header includes a data merkle root generated as a root hash of a data merkle tree with one or more leaf nodes that are one or more hashes. A given hash being a hash of a combination of (1) a public key associated with a lightweight node of the decentralized network and (2) of a validity value associated with the public key indicating whether the public key is a valid public key. The data merkle root being insufficient for restoring the data merkle tree. But with a public key and an intermediate hash the date merkle root is sufficient for at least partly verifying the public key.