Nonce-Based Block Cipher Proof-of-Work for Secure Authentication
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing proof-of-work (PoW) systems lack flexibility, security, and reliability, particularly in environments requiring secure and scalable authentication and encryption, such as vehicle-internal networks.
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 variations to the nonce until the tag meets the criterion, allowing for secure and flexible PoW implementation using symmetric encryption and adjustable difficulty levels.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If traditional PoW systems are used, then basic computational puzzle functionality is achieved, but flexibility and security are insufficient for specialized environments
Solution Approach 1:
The patent applies parameter changes by utilizing block cipher encryption with variable key lengths and different cipher algorithms (e.g., AES, DES) to adjust the computational difficulty and security level of the PoW mechanism. The encryption parameters such as block size, key length, and number of encryption rounds can be modified to suit different security requirements and computational resources, thereby achieving both flexibility and enhanced security.
2Reliability
If block encryption with symmetric keys is implemented, then security and flexibility are improved, but computational overhead increases
Solution Approach 1:
The patent implements partial action by applying block encryption only to specific portions of the data or to critical fields within the PoW structure, rather than encrypting the entire dataset. This selective encryption approach maintains security for sensitive information while reducing the overall computational overhead and energy consumption associated with processing large volumes of data through encryption operations.
3Reliability
If PoW difficulty is increased to limit participants, then network security is improved, but computational requirements and energy consumption increase
Solution Approach 1:
The patent applies dynamics by implementing an adaptive PoW difficulty mechanism that automatically adjusts the encryption complexity and computational requirements based on the current state of the network. When the network experiences high participation or potential security threats, the difficulty increases to maintain security. Conversely, when the network is stable with fewer participants, the difficulty is reduced to lower energy consumption, thereby achieving a dynamic balance between security and energy efficiency.
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.