Network Node Attestation via Hamiltonian Hash Chain Verification
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional attestation technologies face challenges in efficiently checking the integrity of all apparatuses in a network due to high communication and calculation costs, especially when the verification server is compromised.
Innovation Solution
A detection system utilizing a base station and nodes that perform a Hamiltonian circuit integrity check, where each node verifies the integrity of the subsequent node using hash values and challenges, reducing the need for multiple individual checks.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If conventional attestation technology is used to check integrity of all nodes, then integrity verification is performed, but communication cost and calculation cost become excessively high
Solution Approach 1:
The verification process is segmented into individual edge-to-center links rather than requiring comprehensive node-to-node verification. Each edge performs verification only with its connected center node, dividing the overall verification task into independent segments that reduce total communication and calculation overhead.
Solution Approach 2:
Center nodes act as intermediaries that aggregate verification results from multiple edges. Instead of direct verification between all pairs of nodes, the center node receives verification data from connected edges and performs centralized processing, reducing the number of direct communication channels required.
2Reliability
If a central verification server is used to hold confidential information, then verification can be performed, but the system becomes vulnerable when the server is compromised
Solution Approach 1:
The vulnerable central verification server is extracted and replaced with distributed verification capability. Confidential information is no longer concentrated in a single server but is distributed across multiple center nodes, each handling only its connected edges' verification, thereby eliminating the single point of failure.
Solution Approach 2:
Each center node maintains verification capability locally for its connected edges rather than relying on a centralized server. This localizes the verification function to specific edge-center pairs, so that compromise of one center node does not affect the security of other edges in the network.
3Reliability
If distributed attestation is performed between all nodes, then verification server dependency is eliminated, but communication overhead increases significantly
Solution Approach 1:
The distributed verification is segmented by graph edges rather than requiring all-node communication. Each edge independently performs verification with its connected center node, creating discrete verification units that eliminate the need for comprehensive node-to-node communication while maintaining distributed verification benefits.
Solution Approach 2:
Instead of requiring complete verification between all possible node pairs, the system performs partial verification only on edges that exist in the graph structure. This partial action approach achieves sufficient verification coverage without the excessive communication overhead of universal node-to-node verification.
Data Source
AI summary
A detection system includes two or more nodes and a base station that holds information on each of the nodes, wherein the base station includes first processing circuitry configured to search for a circuit passing through all nodes in a network only once, sequentially calculate as many hash values as a number of nodes in the network, and notify each node of an order in the circuit, a hash value according to the order among the calculated hash values, and a node in a subsequent stage in the circuit, and each of the nodes includes second processing circuitry configured to send a hash value notification of which is provided and a challenge to a node in a subsequent stage according to the order notification of which is provided, and verify whether or not the sent hash value matches a value calculated from the hash value notification of which is provided.