Hash Tree Verification Through Selective Data Disclosure

Resolve Bottlenecks,
Find Innovative SolutionsGenerate Solutions

Solution Overview

Problem

Existing digital signature systems require the full disclosure of all data elements to verify the integrity of a hash tree, which may not be feasible or desirable in all scenarios, especially when users want to protect sensitive information.

Innovation Solution

A method and apparatus that utilize a hash tree to selectively provide a subset of data elements, including a reference data element for user authentication, allowing partial data transfer while ensuring integrity and authenticity through hash values and a root node verification.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If all data elements are disclosed for hash tree verification, then verification reliability is improved, but information security deteriorates

Engineering Contradiction:

Improveverification reliabilityVSAvoidinformation security

Core Design Contradiction:

ReliabilityVSLoss of information

Solution Approach 1:

The patent segments the data elements into two categories: selected data elements that are disclosed and non-selected data elements that remain confidential. The hash tree is correspondingly divided into leaves from selected data elements (disclosed) and leaves from non-selected data elements (confidential). This segmentation allows verification to proceed with only the necessary subset of data, maintaining security while enabling verification.

Inventive Principle:

Principle #1Segmentation

Solution Approach 2:

The patent introduces hash values as intermediaries to bridge the gap between partial data disclosure and complete verification. Hash values of non-selected data elements serve as mediators that allow the verification process to account for confidential data without exposing it. The root hash value acts as a ultimate intermediary that encapsulates the integrity of all data elements while allowing verification with minimal disclosure.

Inventive Principle:

Principle #24Intermediary (Mediator)

2Loss of information

If a subset of data elements is provided, then information security is improved, but verification reliability deteriorates

Engineering Contradiction:

Improveinformation securityVSAvoidverification reliability

Core Design Contradiction:

Loss of informationVSReliability

Solution Approach 1:

The patent applies preliminary action by pre-computing and providing hash values of non-selected data elements along with the selected data elements. This preliminary preparation of hash values enables the verification process to proceed reliably without requiring access to the actual non-selected data, thus maintaining both security and verification integrity.

Inventive Principle:

Principle #10Preliminary action

Solution Approach 2:

The patent transforms the verification problem from requiring direct access to all data elements into verifying hash values derived from those elements. By changing the parameter from raw data elements to their hash representations, the system enables verification of confidential data without exposing the data itself, thus resolving the contradiction between security and reliability.

Inventive Principle:

Principle #35Parameter changes

Data Source

PatentUS20250284682A1Method and apparatus for trustworthy provision of data elements and method for checking a dataset with a plurality of data elements

Publication Date: 2025.09.11 SIEMENS HEALTHINEERS AG

AI summary

Methods and apparatuses relate to transferring user-specific data that can be validated via a hash tree. If not all of the underlying data of the hash tree is transferred, then in place of the non-transferred data, a suitable hash value from the hash tree can be transferred. The data to be transferred includes at least one reference data element which is suitable for checking the authenticity of the sender.