Blockchain Hash-Based Digital Signature System

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Existing server-based signature systems rely on complete trust in the server, which can be unfeasible due to complexity and lack of user control, and hash tree constructs require pre-generation of all keys at once, leading to inefficiencies and risks of key reuse.

Innovation Solution

The BLT signature scheme uses time-bound one-time keys with a cryptographic time-stamping service, allowing sequential key use and minimizing trusted components, with a blockchain-based system for secure key management and verification, ensuring non-repudiation and resistance to attacks, including those from quantum computers.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Ease of operation

If server-based signature systems are used to simplify user operations, then ease of operation is improved, but trust in the server becomes a critical vulnerability

Engineering Contradiction:
Improveease of operationVSAvoidtrust in server
Core Design Contradiction:
Ease of operationVSReliability

Solution Approach 1:

The patent introduces a blockchain as an intermediary layer between the server and users. The server operates a blockchain that publicly logs all signature operations with cryptographic proofs. This intermediary mechanism allows users to maintain trustless relationships with the server, as the blockchain independently verifies and records all operations, eliminating the need for direct trust in the server while preserving ease of operation.

Inventive Principle:
Principle #24Intermediary (Mediator)

2Productivity

If hash tree constructs are used to aggregate multiple keys, then key management efficiency is improved, but all keys must be pre-generated at once increasing complexity

Engineering Contradiction:
Improvekey management efficiencyVSAvoidkey generation complexity
Core Design Contradiction:
ProductivityVSDevice complexity

Solution Approach 1:

The patent applies preliminary action by pre-computing and publishing Merkle root hashes on the blockchain before keys are actually needed. This allows the system to prepare the cryptographic structure in advance without generating all individual keys at once. When signing is needed, keys are generated on-demand and linked to the pre-established Merkle structure, maintaining efficiency while reducing upfront complexity.

Inventive Principle:
Principle #10Preliminary action

Solution Approach 2:

The patent segments the key management process into independent, on-demand key generation units rather than requiring bulk pre-generation. Each key can be generated independently and linked to the blockchain-based Merkle structure as needed. This segmentation allows flexible, incremental key creation while maintaining the efficiency benefits of aggregated verification through the Merkle tree structure.

Inventive Principle:
Principle #1Segmentation

3Reliability

If one-time hash-based signatures are used to enhance security, then reliability is improved, but a new key pair must be generated for each message reducing productivity

Engineering Contradiction:
Improvesignature securityVSAvoidsigning speed
Core Design Contradiction:
ReliabilityVSProductivity

Solution Approach 1:

The patent merges multiple one-time signature key pairs into a single aggregated public key structure using Merkle trees. The blockchain stores the Merkle root hash, and signature operations can utilize pre-computed Merkle paths. This combining approach maintains the security properties of one-time signatures while enabling more efficient batch processing and reducing the overhead of individual key pair generation for each message.

Inventive Principle:
Principle #5Merging (Combining)

Data Source

PatentUS11057187B2Blockchain-assisted hash-based data signature system and method
Publication Date: 2021.07.06 GUARDTIME SA
  • US11057187B2 patent drawing
  • US11057187B2 patent drawing

AI summary

A set of secret, indexed keys is generated and used in requests from a signing entity to a signing server for digital signature of messages. The signing server maintains a counter as well as a hash tree that aggregates requests during a round into a root value that is stored in an append-only data structure in a repository. Each signing entity is associated with a leaf of the hash tree. After a signature is formed, the counter for the requesting signing entity is incremented, whereby the secret key that was used cannot be used again.