Merkle Tree Storage Authentication Using Dynamic Super Block Keys

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Existing storage devices lack effective methods for establishing secure mutual credibility certification between hosts and storage devices, which is crucial for ensuring data integrity and preventing unauthorized access or coupling with other devices.

Innovation Solution

Implementing a computing device and storage device that utilize Merkle tree-based credibility certification by generating private keys from random hash values of super blocks, allowing for secure identification and updating of these keys to prevent unauthorized access.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If traditional authentication methods are used between host and storage device, then the system is simpler to implement, but security against unauthorized access and device coupling is insufficient

Engineering Contradiction:
ImprovesecurityVSAvoidauthentication mechanism
Core Design Contradiction:
ReliabilityVSDevice complexity

Solution Approach 1:

The authentication mechanism is segmented into multiple components: Merkle trees are constructed from multiple super blocks, each contributing hash values as leaf nodes. Private keys are generated from root nodes of these Merkle trees, creating a hierarchical segmented structure that enhances security while maintaining manageable complexity

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

Merkle trees and private keys are pre-generated and stored in the storage device before actual authentication occurs. The host device receives and stores these private keys in advance, enabling rapid credibility verification during operation without complex real-time computation

Inventive Principle:
Principle #10Preliminary action

2Reliability

If static authentication keys are used, then the authentication process is simpler, but the system cannot prevent unauthorized coupling with other devices

Engineering Contradiction:
Improvedevice identification accuracyVSAvoidauthentication process
Core Design Contradiction:
ReliabilityVSEase of operation

Solution Approach 1:

The authentication system transitions from static keys to dynamic keys that change based on storage device operations. Private keys are updated whenever super blocks are erased or rewritten, ensuring that the authentication credentials evolve with the device state and preventing reuse with unauthorized devices

Inventive Principle:
Principle #15Dynamics

Solution Approach 2:

The authentication system incorporates feedback mechanisms where the host device verifies credibility by comparing current private keys against previously stored ones. The storage device receives verification results and can update its key state accordingly, creating a closed-loop feedback system that enhances identification accuracy

Inventive Principle:
Principle #23Feedback

3Reliability

If Merkle tree-based dynamic key updates are implemented, then unauthorized coupling is prevented, but the authentication mechanism becomes more complex

Engineering Contradiction:
ImprovesecurityVSAvoidkey management system
Core Design Contradiction:
ReliabilityVSDevice complexity

Solution Approach 1:

Merkle trees serve as an intermediary mathematical structure that bridges the storage device's internal state (super block erase counts) and the authentication keys. This intermediary structure allows complex key generation logic to be managed through a well-defined mathematical framework, making the system more tractable

Inventive Principle:
Principle #24Intermediary (Mediator)

Solution Approach 2:

The host device receives and stores copies of the storage device's private keys for verification purposes. This copying mechanism allows the host to independently verify credibility without requiring complex real-time computation on the storage device, distributing the computational burden

Inventive Principle:
Principle #26Copying

Data Source

PatentUS12574229B2Computing device providing Merkle tree-based credibility certification, storage device, and method for operating storage device
Publication Date: 2026.03.10 SK HYNIX INC
  • US12574229B2 patent drawing
  • US12574229B2 patent drawing
  • US12574229B2 patent drawing

AI summary

A storage device included in a computing device which provides Merkle tree-based credibility certification may generate a random hash value by hashing an erase count and a seed of each of a plurality of super blocks, may generate a Merkle tree in which the random hash value is a leaf node, for each of the plurality of super blocks, may generate a plurality of private keys corresponding to the plurality of super blocks, respectively, on the basis of root nodes of Merkle trees of the plurality of respective super blocks, and may transmit private key information including the plurality of private keys to a host device. The host device may use the private key information in credibility certification of the storage device.