Keyless Signature Infrastructure for Digital Record Authenticity
Solution Overview
Problem
Existing digital signature methods, such as PKI-based systems, are compromised by key compromise issues and require trust in service providers, limiting scalability and authenticity verification efficiency, especially for large document collections.
Innovation Solution
A keyless, distributed hash tree-based infrastructure, like Guardtime's Keyless Signature Infrastructure (KSI), which verifies document authenticity without relying on trusted authorities or cryptographic keys, enabling scalable and secure verification of digital records and entity identification through a layered system with client, gateway, and core components, using hash functions and blockchain for permanent trust-free authentication.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If PKI-based digital signature schemes are used, then document authenticity can be verified, but the system becomes vulnerable to key compromise and requires trust in service providers
Solution Approach 1:
The patent extracts and removes the trusted authority and cryptographic key dependencies from the digital signature system. By using a keyless distributed hash tree structure where document hashes are stored in a distributed ledger, the system eliminates the need for private keys that can be compromised and removes reliance on trusted service providers, thereby resolving the vulnerability to key compromise while maintaining authenticity verification.
Solution Approach 2:
The patent segments the centralized trust model into a distributed structure where multiple nodes maintain copies of the hash tree. Instead of relying on a single trusted authority or key pair, the verification process is distributed across the network, with each node independently verifying document authenticity through the hash chain structure, thus eliminating the single point of failure and trust requirement.
2Object-affected harmful factors
If publication methods are used for verification, then key compromise is avoided, but the system becomes inefficiently slow and unsuitable for large document collections
Solution Approach 1:
The patent applies preliminary action by pre-computing and storing document hashes in the distributed hash tree structure before verification is needed. The hash chain is built in advance with all necessary cryptographic commitments, allowing instant verification without requiring time-consuming publication processes. This enables the system to achieve both key compromise avoidance and high verification speed.
Solution Approach 2:
The patent replaces the mechanical publication process (physical or electronic posting of documents) with a cryptographic hash-based verification mechanism. Instead of publishing entire documents or relying on slow dissemination processes, the system uses distributed hash trees where verification is achieved through cryptographic proof, dramatically increasing speed while maintaining security against key compromise.
3Reliability
If trusted authorities are required for authentication, then entity identity can be verified, but scalability is limited
Solution Approach 1:
The patent segments the centralized trusted authority into multiple distributed nodes that collectively perform verification. Each node maintains a copy of the distributed hash tree and can independently verify entity identities and document authenticity. This segmentation removes the scalability bottleneck of centralized authorities while maintaining reliable identity verification through distributed consensus.
Solution Approach 2:
The patent enables entities to self-verify their own identities and document authenticity using the distributed hash tree structure. Instead of requiring external trusted authorities to validate each entity, the system allows participants to independently verify identities through the cryptographic hash chains stored in the distributed ledger, enabling unlimited scalability without additional trusted authorities.
Data Source
AI summary
At least one node in a distributed hash tree verification infrastructure is augmented with either a function of a signature of a child computational node, or of a child entity attestation value derived from an HMAC value of the child entity, or both. A data signature, which includes parameters for recomputation of a verifying value, and which is associated with a digital input record, will therefore also include data that identifies at least one child entity in the hash tree path used for its initial registration in the infrastructure.



