Re-encrypting Data on Hash Chains via Container Segmentation

Resolve Bottlenecks,
Find Innovative SolutionsGenerate Solutions

Solution Overview

Problem

Distributed systems, such as hash chains, face challenges in maintaining continuous security and privacy due to outdated or compromised encryption techniques, where re-encrypting data is not practicable without breaking the cryptographic proof of correctness, leading to security vulnerabilities.

Innovation Solution

A method involving a block manager that retrieves encrypted data, places it in a container, applies a new encryption technique, and creates a new chain with the encrypted container as the first block, or stores the encrypted container separately and adds a reference to the new chain, ensuring data integrity and security while freeing up storage resources.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If data is re-encrypted using a new encryption technique, then security is improved, but the cryptographic proof of correctness of the chain is broken

Engineering Contradiction:

ImprovesecurityVSAvoidcryptographic proof of correctness

Core Design Contradiction:

ReliabilityVSStability of the object's composition

Solution Approach 1:

The patent segments the data structure into two parts: the immutable hash chain that maintains cryptographic proof of correctness, and a separate container object that holds the re-encrypted data. This allows the hash chain to remain unchanged and valid while the data container can be updated with new encryption techniques.

Inventive Principle:

Principle #1Segmentation

Solution Approach 2:

The patent introduces a container object as an intermediary between the hash chain and the encrypted data. The container object stores references to the data and can be updated independently, allowing re-encryption without modifying the hash chain structure or breaking its cryptographic integrity.

Inventive Principle:

Principle #24Intermediary (Mediator)

2Quantity of substance

If blocks are continuously appended to the chain, then data storage capacity is increased, but storage resources are consumed without bound

Engineering Contradiction:

Improvedata storage capacityVSAvoidstorage resources

Core Design Contradiction:

Quantity of substanceVSWeight of stationary object

Solution Approach 1:

The patent creates a reference copy in the container object that points to the encrypted data, rather than duplicating the entire data chain. This allows multiple references to the same data without proportionally increasing storage consumption, as the actual data is stored once but can be referenced multiple times.

Inventive Principle:

Principle #26Copying

Solution Approach 2:

The patent moves the encrypted data storage to a separate dimension outside the hash chain structure, using container objects that reference the data rather than embedding it within the chain blocks. This separates the growth of data capacity from the consumption of chain storage resources.

Inventive Principle:

Principle #17Another dimension (Dimensionality change)

Data Source

PatentUS11489660B2Re-encrypting data on a hash chain

Publication Date: 2022.11.01 INTUIT INC

AI summary

Techniques are disclosed for managing encrypted data stored in one or more blocks of a first data structure. One embodiment presented herein includes a computer-implemented method, which includes retrieving the encrypted data from the one or more blocks. The method further includes placing the encrypted data in a container object. The method further includes applying an encryption technique to the container object to generate an encrypted container object and a key. The method further includes generating a second data structure. A first block of the second data structure may include either the encrypted container object or information related to the encrypted container object.