Metadata-Free Tree Storage Using Volatile Secret Entry Points
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing methods for storing trees in databases generate metadata, making it difficult to maintain data authenticity and integrity, especially in untrustworthy environments like cloud storage, where metadata generation is unavoidable even with encrypted data.
Innovation Solution
A method for generating metadata-free trees using secret node entry points, where child nodes and associated encrypted data are stored on a non-volatile storage device without revealing information about siblings or parents, using cryptographic hash functions to create unique identification values and volatile secret node entry points that are never stored permanently.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If trees are stored in database tables using conventional methods, then data can be stored and retrieved, but metadata is generated revealing tree structure information even when data is encrypted
Solution Approach 1:
The patent extracts and removes metadata from the storage structure by using hash-based identification values that do not reveal tree structure information. Instead of storing nodes in traditional database tables that expose hierarchy, the invention stores only encrypted data with hash-based identifiers, extracting the harmful metadata component while preserving useful data storage and retrieval functionality.
Solution Approach 2:
The patent introduces hash functions as intermediaries between the tree structure and storage representation. The hash function transforms node identifiers into identification values that serve as mediators - they enable data retrieval without exposing the underlying tree structure, thus protecting metadata while maintaining functional access to the hierarchical data.
2Reliability
If encrypted data is stored in conventional database tables, then data security is improved, but metadata about tree structure is still generated and stored
Solution Approach 1:
The patent extracts metadata from the storage structure by using hash-based identification values that do not reveal tree structure information. Instead of storing nodes in traditional database tables that expose hierarchy, the invention stores only encrypted data with hash-based identifiers, extracting the harmful metadata component while preserving useful data storage and retrieval functionality.
Solution Approach 2:
The patent changes the parameter representation by transforming node identifiers through hash functions. Instead of storing actual node identifiers or paths that reveal tree structure, the system stores hash-based identification values that maintain the necessary functional properties for data retrieval while fundamentally changing the representation to eliminate structural information leakage.
3Reliability
If secret node entry points are calculated volatily and never stored, then security against data theft is improved, but access complexity increases
Solution Approach 1:
The patent applies preliminary action by pre-calculating and storing hash-based identification values during tree construction, while the actual secret node entry points are derived volatily during access. This preliminary preparation of hash values enables fast retrieval without requiring volatile calculation of the entire tree structure, reducing access complexity while maintaining security.
Solution Approach 2:
The patent implements self-service through the use of hash functions that automatically generate identification values from secret node entry points without requiring external storage or additional cryptographic operations. The hash function serves itself to transform secrets into usable identifiers, simplifying the access process while maintaining the volatility and security of the secret entry points.
Applied Scientific Principles
This section explains which scientific principles are used to turn an abstract innovation direction into a practical engineering solution.
Function Achieved in This Case
Ensures secure, metadata-free storage of hierarchical data by allowing only authorized users to reconstruct parts of the tree, preventing data theft and maintaining data integrity and authenticity without the need for additional keys or lists, thus enhancing security and performance.
Implementation Method 1
for the first and each further required child node, a cryptographic hash function is applied to at least the volatile secret node entry point and an assignable value from the child node numbering set, and the result of the applied cryptographic hash function represents the respective identification value of the child node
Data Source
AI summary
A method for storing hierarchical data protected by access data in an untrustworthy environment, wherein unique identification values of child nodes of at least one associated tree are determined for the data and are stored together with the data. The root node entry point is calculated based on the access data by means of a predeterminable calculation function in a volatile way, and the root node entry point represents a secret node entry point from which the identification value of a root node of the tree is subsequently calculated. The root node represents one of the child nodes in this tree, as a child node generation step is applied to generate the identification values of the child nodes based on one of the secret node entry points. A child node numbering set contains at least as many different elements as the number of child nodes to be generated is created or used.