Distributed Hash Chain Data Isolation via Limited Blocks

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Distributed hash chains face challenges in isolating sensitive data, as they store data in a serial fashion and validate data based on traversal of the entire chain, which can compromise the integrity of the chain if sensitive data is not suited for storage on certain nodes, leading to a need for improved data isolation techniques.

Innovation Solution

A method where a node determines if sensitive data should be stored on other nodes and generates a limited block containing only a hash and a pointer to the previous block, preventing sensitive data from being distributed to nodes that do not meet security requirements, while maintaining the integrity of the chain by using limited blocks and permissions to control access.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If sensitive data is stored in every block of a distributed hash chain for validation, then the integrity and validity of the chain can be verified by traversing the entire chain, but sensitive data may be exposed to nodes that do not meet security requirements

Engineering Contradiction:
Improvechain integrityVSAvoiddata exposure risk
Core Design Contradiction:
ReliabilityVSObject-affected harmful factors

Solution Approach 1:

The patent extracts sensitive data from the distributed storage model by creating a separate validation mechanism. Instead of storing sensitive data in every block across all nodes, the system extracts only the cryptographic hash and pointer information needed for validation, leaving the actual sensitive data stored only on authorized nodes.

Inventive Principle:
Principle #2Taking out (Extraction)

Solution Approach 2:

The patent segments the block data into two distinct parts: (1) validation information (hash and pointer) that is distributed to all nodes, and (2) sensitive data that is stored only on authorized nodes. This segmentation allows the chain integrity function to be separated from the sensitive data storage function.

Inventive Principle:
Principle #1Segmentation

2Reliability

If the entire hash chain is distributed to all nodes for validation, then data validity can be verified through chain traversal, but the system complexity and data distribution overhead increase

Engineering Contradiction:
Improvedata validity verificationVSAvoiddata distribution complexity
Core Design Contradiction:
ReliabilityVSDevice complexity

Solution Approach 1:

The patent extracts only the essential validation elements (cryptographic hash and pointer to previous block) from each block and distributes these to all nodes. This extraction eliminates the need to distribute entire block contents, significantly reducing data distribution complexity while maintaining validation capability.

Inventive Principle:
Principle #2Taking out (Extraction)

3Object-affected harmful factors

If sensitive data is isolated in specific nodes only, then security requirements are met, but the traditional hash chain validation mechanism that requires traversing the entire chain becomes broken

Engineering Contradiction:
Improvesecurity complianceVSAvoidchain validation integrity
Core Design Contradiction:
Object-affected harmful factorsVSReliability

Solution Approach 1:

The patent introduces cryptographic hashes as an intermediary element that bridges the gap between isolated sensitive data and chain validation. Each node stores the hash of sensitive data, and validation is performed by verifying the cryptographic chain of hashes rather than by accessing the actual sensitive data, thus maintaining both security and validation integrity.

Inventive Principle:
Principle #24Intermediary (Mediator)

Data Source

PatentEP3744071B1Data isolation in distributed hash chains
Publication Date: 2024.03.13 INTUIT INC
  • EP3744071B1 patent drawingFigure 1
  • EP3744071B1 patent drawingFigure 2
  • EP3744071B1 patent drawingFigure 3

AI summary

Certain aspects of the present disclosure provide techniques for managing data in a plurality of nodes of a distributed system. Embodiments include storing, by a node of the plurality of nodes, sensitive data in a block of a hash chain. Embodiments further include determining, by the node, that the sensitive data should not be distributed to other nodes of the plurality of nodes. Embodiments further include distributing, by the node, a limited version of the block to the other nodes. The limited version of the block may comprise a hash and a pointer to a previous block of the hash chain, and the limited version of the block may not contain the sensitive data.