Relational Merkle Tree Storage for Counterfeit-Resistant Authentication
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current product authentication systems are easily defeated by replication of serial numbers and tags, and RFID chips can be counterfeited, lacking unique identification and secure verification mechanisms.
Innovation Solution
A bi-directional Merkle tree data store system with synchronized noSQL and relational data stores, using bi-directional hashes and unique encrypted QR codes for product authentication, ensuring data integrity and preventing fraud.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If alphanumeric serial numbers and RFID chips are used for product authentication, then product identification is enabled, but the system is easily defeated by replication and counterfeiting
Solution Approach 1:
The patent segments the authentication system into multiple independent components: a relational Merkle tree data store for cryptographic verification, a noSQL data store for replicated authentication data, and distributed verification nodes. This segmentation ensures that no single component can be compromised to defeat the entire system, as each segment provides redundant verification capabilities.
Solution Approach 2:
The patent combines multiple data store technologies (relational and noSQL) with different strengths into a composite authentication system. The relational data store provides structured cryptographic verification through Merkle trees, while the noSQL data store provides distributed replication and fault tolerance. This composite approach creates a authentication system that is more resistant to counterfeiting than either technology alone.
2Device complexity
If a centralized relational database management system is used for storing product information, then data organization is simplified, but the system lacks distributed verification and is vulnerable to central points of failure
Solution Approach 1:
The patent implements a nested data store architecture where a noSQL data store containing replicated authentication data is embedded within or synchronized to a relational Merkle tree data store. The noSQL store handles distributed replication and the relational store provides cryptographic verification, with both layers working together. This nested structure provides distributed fault tolerance while maintaining organized data access patterns.
Solution Approach 2:
The patent changes the operational parameters of the data stores by implementing asynchronous synchronization between the relational and noSQL data stores. The noSQL data store operates with replicated data for rapid authentication, while the relational data store maintains the authoritative Merkle tree structure. This parameter change allows each data store to optimize for its specific function while maintaining overall system consistency.
3Adaptability or versatility
If independent product authentication systems are used by each business, then company-specific authentication is achieved, but cross-company verification and shared authentication infrastructure are lacking
Solution Approach 1:
The patent creates a universal authentication infrastructure where the relational Merkle tree data store and noSQL data store can serve multiple companies and products simultaneously. Each business can maintain its own authentication data while sharing the underlying distributed verification infrastructure. The system supports both company-specific authentication requirements and cross-company verification through the standardized Merkle tree cryptographic proofs that can be validated by any node in the distributed network.
Data Source
AI summary
A system including a relational Merkle tree data store including a child node and an additional child node. The child node has a linked parent node of a first Merkle tree, the linked parent node is tagged with a hash of the child node, and the child node and the additional child node are each tagged with an inverse hash of the linked parent node prior to the relational Merkle tree data store receiving a request for a product history of a product. The inverse hash is exclusively a cryptographic hash of the linked parent node, The inverse hash is used to perform a bi-directional traversal of the relational Merkle tree data store to retrieve the product history for the request. The relational Merkle tree data store includes the product history of the product.