AI Neural Tree Data Structure for Secure File Storage

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Existing file systems are insecure as their static structure can be easily determined, allowing nefarious devices to reconstruct stored files, and encrypting the entire file system is not entirely secure and results in data loss.

Innovation Solution

The use of a self-securing, dynamically programmable neural tree data structure with trained artificial intelligence models to encrypt and store data blocks instead of the entire file system, preventing file reconstruction by storing data blocks in a non-sequential manner.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If the entire file system is encrypted, then security is improved, but data loss increases and the system becomes less efficient

Engineering Contradiction:
ImprovesecurityVSAvoiddata loss
Core Design Contradiction:
ReliabilityVSLoss of substance

Solution Approach 1:

The patent divides the file system into individual file components and encrypts only specific files or data blocks rather than the entire file system. This segmentation allows selective encryption of sensitive data while leaving non-sensitive areas unencrypted, thereby reducing data loss and improving efficiency while maintaining security for critical information.

Inventive Principle:
Principle #1Segmentation

2Ease of operation

If traditional file system structures are used, then ease of operation is improved, but security deteriorates as files can be easily reconstructed

Engineering Contradiction:
Improvefile accessVSAvoidsecurity
Core Design Contradiction:
Ease of operationVSReliability

Solution Approach 1:

The patent implements dynamic encryption keys that change over time or based on access conditions, making the file system structure adaptive rather than static. This dynamic approach prevents nefarious devices from reconstructing files through static analysis while maintaining ease of operation through automated key management and transparent encryption/decryption processes.

Inventive Principle:
Principle #15Dynamics

Solution Approach 2:

The patent changes the parameters of file storage by applying encryption transformations to data blocks, altering their mathematical representation. This parameter change makes the stored data mathematically secure while maintaining the operational functionality of the file system through proper decryption mechanisms.

Inventive Principle:
Principle #35Parameter changes

3Loss of substance

If selective file encryption is implemented, then data loss is reduced, but device complexity increases

Engineering Contradiction:
Improvedata lossVSAvoidencryption system complexity
Core Design Contradiction:
Loss of substanceVSDevice complexity

Solution Approach 1:

The patent implements self-service mechanisms where the file system automatically manages encryption key generation, distribution, and rotation without requiring complex external key management infrastructure. This self-service approach reduces device complexity by embedding security management within the file system itself while maintaining selective encryption capabilities.

Inventive Principle:
Principle #25Self-service

Data Source

PatentUS11709957B2Methods for securing files within a storage device using artificial intelligence and devices thereof
Publication Date: 2023.07.25 NETAPP INC
  • US11709957B2 patent drawing
  • US11709957B2 patent drawing
  • US11709957B2 patent drawing

AI summary

The present technology relates to identifying an artificial intelligence model based on a received first key value to write a received first block of data associated with a file. The received first key value is applied to the identified artificial intelligence model which is trained to output one of a plurality of actual index values where the identified artificial intelligence model and the plurality of data blocks are stored as a neural tree. The one of the actual index values is compared to a range within the actual index values to determine when the one of the actual index value points to a first data block of the plurality of data. The received first block of data associated with the file is written into the determined first data block.