Block Cipher Proof-of-Work for Secure Adaptive Authentication
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing proof-of-work (PoW) systems lack flexibility, security, and reliability, particularly in environments where computational effort needs to be adaptable and secure, such as in vehicle-internal networks and closed banking systems.
Innovation Solution
A method involving associating a data block with a nonce, encrypting it with a secret key to form a tag, and checking if it meets a predetermined criterion, with the nonce varied until the tag meets the criterion, using symmetric encryption for secure and efficient PoW generation, suitable for private blockchains and vehicle-internal networks.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If traditional PoW systems use hash functions with nonce variation, then PoW generation is simple and fast, but security and flexibility are insufficient for private networks
Solution Approach 1:
The patent changes the fundamental parameter of the PoW function from hash-based to block cipher-based encryption. By using symmetric block ciphers (AES, DES, etc.) instead of hash functions, the system achieves higher security through established cryptographic primitives while maintaining computational efficiency. The block cipher approach allows for configurable security levels through different key lengths and cipher types.
Solution Approach 2:
The block cipher-based PoW system serves multiple functions simultaneously: it provides proof-of-work validation, message authentication, and encryption capabilities. The same cryptographic primitive (block cipher) is used for both PoW generation and data encryption, reducing system complexity by eliminating the need for separate cryptographic modules while enhancing security through proven cryptographic standards.
2Adaptability or versatility
If PoW computational effort is fixed, then system behavior is predictable, but adaptability to different computing power and network conditions is lost
Solution Approach 1:
The patent introduces dynamic adjustment of PoW difficulty through configurable parameters including block size, cipher key length, and number of encryption rounds. The system can adapt computational requirements based on network conditions, available computing power, and security requirements. This dynamic configuration allows the PoW difficulty to be tuned without changing the fundamental algorithm structure.
Solution Approach 2:
By allowing configuration of multiple parameters (block size, key length, cipher type, rounds), the system achieves adaptability through parameter variation rather than algorithmic changes. This maintains operational simplicity while providing flexibility to adjust computational effort to match different network conditions and security requirements.
3Reliability
If block cipher encryption is used for PoW, then security and flexibility are improved, but computational cost increases
Solution Approach 1:
The patent applies partial encryption by encrypting only the data block with the nonce rather than the entire message. This partial action provides sufficient security for PoW validation while significantly reducing computational energy requirements compared to full message encryption. The block cipher is applied selectively to the essential components needed for PoW verification.
Solution Approach 2:
The system allows configuration of encryption parameters (block size, number of rounds, cipher complexity) to balance security requirements against computational energy consumption. For resource-constrained environments, lighter ciphers and fewer rounds can be selected, while high-security applications can use stronger ciphers with more rounds, providing energy-efficient adaptability.
Data Source
AI summary
The disclosure creates a method for generating a proof-of-work. In the method, a data block is associated with a nonce. Then, the data block associated with the nonce is encrypted into a tag using a secret key. In a further step it is checked whether the tag meets a predetermined criterion. If the tag does not meet the predetermined criterion, the nonce is varied and the association and encryption are repeated until the check shows that the tag meets the criterion. In addition, the disclosure relates to the implementation of the proof-of-work during the process of authentication, encryption, transmission and reception of a message. In addition, the disclosure relates to a computer program and a device for carrying out the method.