Hash-Oriented Blockchain for Quantum-Resistant Assertions

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Current cryptographic techniques, such as RSA and ECDSA, may become vulnerable to quantum computing, and traditional hash-based signatures have impractical data sizes, necessitating a system resistant to quantum computing while enabling secure proof of assertions like identities and contracts.

Innovation Solution

A hash-oriented transaction scheme using a blockchain to store declarations with hash values generated by users, allowing verification through confirmation messages that include items known only to the user, ensuring resistance to quantum computing and efficient proof of assertions.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If quantum computing is used to solve mathematical problems, then cryptographic security is compromised, but using traditional algorithms provides security against standard computers

Engineering Contradiction:
Improvecryptographic securityVSAvoidresistance to quantum computing
Core Design Contradiction:
ReliabilityVSAdaptability or versatility

Solution Approach 1:

The patent transitions from using mathematical problem-based cryptography (RSA, ECDSA) to hash-based cryptography. This fundamental parameter change in the cryptographic approach creates a system that is resistant to quantum computing attacks while maintaining security against classical computers, as hash functions do not rely on the mathematical problems that quantum algorithms like Shor's algorithm can solve efficiently.

Inventive Principle:
Principle #35Parameter changes

2Reliability

If traditional hash-based signatures are used, then quantum resistance is achieved, but data sizes become impractical

Engineering Contradiction:
Improvequantum resistanceVSAvoiddata size
Core Design Contradiction:
ReliabilityVSQuantity of substance

Solution Approach 1:

The patent extracts only the essential hash values from traditional hash-based signature schemes and stores them in a blockchain. Instead of storing complete signature structures with large data sizes, the system stores compact hash values (e.g., SHA-256 producing 256-bit hashes) that can be efficiently verified, dramatically reducing the quantity of data while maintaining quantum resistance.

Inventive Principle:
Principle #2Taking out (Extraction)

Solution Approach 2:

The blockchain structure serves multiple functions: it stores the hash values for quantum-resistant verification, provides immutable timestamps for the values being protected, and enables efficient retrieval and verification by any participant. This multi-functionality eliminates the need for separate signature storage structures, reducing overall data requirements.

Inventive Principle:
Principle #6Universality (Multi-functionality)

3Reliability

If complex mathematical algorithms are used, then security against standard computers is maintained, but computational efficiency decreases

Engineering Contradiction:
Improvecryptographic securityVSAvoidcomputational efficiency
Core Design Contradiction:
ReliabilityVSProductivity

Solution Approach 1:

The patent replaces complex mathematical algorithm computations (factorization, discrete logarithms) with hash function computations. Hash functions are computationally more efficient, requiring fewer computational resources and time to generate and verify, while providing adequate security for the application's needs. This substitution improves productivity without significantly compromising security.

Inventive Principle:
Principle #28Mechanics substitution (Replace mechanical system)

Data Source

PatentUS11917077B2Method and system for quantum-resistant hashing scheme
Publication Date: 2024.02.27 MASTERCARD INT INC
  • US11917077B2 patent drawing
  • US11917077B2 patent drawing
  • US11917077B2 patent drawing

AI summary

A method for moderation in a permissioned blockchain using a hash-oriented scheme includes: storing a blockchain including a most recent block; receiving transaction data values; receiving a first reference value and a second reference value; generating a first hash value by hashing the first reference value; generating a block proof including the first hash value, a second hash value, a third reference value, and a block value; verifying a block header of the most recent block using the block proof; receiving a new block value; generating a new block header including the first reference value, the second reference value, a fourth reference value, and the new block value; generating a new block for the blockchain including the new block header and the transaction data values; and transmitting the new block to one or more additional nodes associated with the blockchain.