Digital signature algorithm for verifying edited data

The Merkle tree-based cryptographic method securely edits and verifies data integrity by segmenting and signing the root hash, addressing inefficiencies in existing data security methods and ensuring secure, scalable data storage.

JP2026511069APending Publication Date: 2026-04-10NCHAIN LICENSING AG
0 Cites 0 Cited by

Patent Information

Application Number
JP2025555322
Authority / Receiving Office
JP · JP
Patent Type
Applications
Current Assignee / Owner
Priority Date
2023-10-25
Filing Date
2024-03-11
Publication Date
2026-04-10

AI Technical Summary

Technical Problem

Existing methods for securing and verifying electronic data resources, such as redacting sensitive information, are inefficient and prone to unintentional revelation of confidential content, especially with large datasets.

Method used

A cryptographic method using a Merkle tree structure to divide data into segments, hash each segment, and sign the root hash, allowing for secure editing and verification of data integrity without losing authenticity, even if parts of the data are edited.

Benefits of technology

Ensures secure and verifiable editing of data resources by maintaining the integrity of digital signatures, preventing unauthorized access, and providing scalable data storage solutions.

✦ Generated by Eureka AI based on patent content.
Patent Text Reader

Abstract

Embodiments of this disclosure provide, but are not limited to, solutions for protecting, sharing, verifying, and / or generating data resources such as documents. In exemplary embodiments, a data resource is represented, expressed, or defined as a plurality of hashed constituent segments. Using the segment hashes as leaves, a Merkle tree is generated representing the complete original version of the data resource. An edited version of the data resource can be shared, omitting one or more segments that the data administrator wishes to keep secret or does not wish to share in its original form. To verify the authenticity and / or completeness of the edited data resource, a validator is provided with sufficient data (e.g., the hash of each of the non-shared segments) to verify the presence of non-shared segments in the tree representing the complete original version, and an authorized signature that signed the root. In some embodiments, the data resource is a code library, and the segments are parts of computer code that perform specific subtasks. Shared code segments, when executed on a processor, may be selected to combine to perform larger tasks.
Need to check novelty before this filing date? Find Prior Art