Journal Redaction via Cryptographic Hash Tree
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Database management systems face challenges in providing advanced security and auditing capabilities, such as cryptographic verification of transaction history, while maintaining high transactional throughput.
Innovation Solution
A journaled database management system employs a cryptographic hash tree structure with threaded leaf nodes and a symmetric hash operator to support cryptographic verification features, enabling efficient proof generation and high transaction commit rates.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If cryptographic verification features are implemented to verify transaction history, then security and auditing capabilities are improved, but transactional throughput deteriorates
Solution Approach 1:
The journal structure is segmented into fixed-size pages with each page containing multiple entries. Cryptographic verification is performed at the page level rather than individual entry level, reducing the computational overhead per transaction while maintaining verification capability. The hash tree structure divides the journal into manageable segments that can be verified efficiently.
Solution Approach 2:
Hash values are pre-computed and stored in the journal entries and hash tree structure during transaction commit. This preliminary cryptographic processing eliminates the need for complex verification calculations during transaction execution, allowing high throughput while maintaining security. The digest values are prepared in advance for efficient batch verification.
2Reliability
If cryptographic hash tree structure is used to provide verifiable proof, then transaction integrity is improved, but system complexity increases
Solution Approach 1:
The hash tree structure serves multiple functions simultaneously: it provides cryptographic verification, enables efficient range proofs, supports redaction operations, and maintains transaction integrity. This multi-functionality reduces the need for separate verification mechanisms, thereby managing complexity while delivering comprehensive security capabilities.
Solution Approach 2:
Instead of storing and verifying complete transaction histories, the system uses compact hash representations (digests) that capture the essential verification information. These hash copies enable efficient verification without requiring access to or processing of the entire transaction history, significantly reducing system complexity.
3Quantity of substance
If fixed-size pages with multiple entries are used, then storage efficiency is improved, but proof verification complexity increases
Solution Approach 1:
Each page in the journal is treated as a distinct unit with its own hash representation. The hash tree structure organizes these page-level hashes, allowing verification to be performed locally at the page level rather than requiring global verification of the entire journal. This local quality approach simplifies proof verification while maintaining storage efficiency.
Solution Approach 2:
The journal is divided into fixed-size pages, each containing multiple entries. This segmentation allows the system to verify a subset of entries by computing hashes only for the relevant pages, rather than processing the entire journal. The segmented structure enables efficient range proofs and reduces verification complexity for partial transaction histories.
Data Source
AI summary
A database management system stores an entry in a journal. The journal, upon storage of the entry, comprises a leaf node with a hash value based at least in part on the entry, and a hierarchy of interior nodes based at least in part upon the leaf node. In response to a request to delete the entry, the entry is deleted but the hash value is retained. A cryptographic proof of a second entry stored in the journal is based at least in part on the retained hash value.