Broadcast Data Integrity via Hash-Based Tag and Secrecy Coding
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing secrecy coding techniques ensure confidentiality but do not guarantee the integrity or authentication of messages, relying on shared keys or pre-established secrets.
Innovation Solution
A process and system that incorporate a hash-based tag into each message before secrecy coding, ensuring authentication and integrity without requiring pre-shared keys, using a single secret key transmitted confidentially through the secrecy coding protocol.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Loss of information
If secrecy coding is used to ensure confidentiality, then message confidentiality is improved, but message integrity and authentication are not guaranteed
Solution Approach 1:
The patent combines secrecy coding with hash-based message authentication codes (HMAC) into a unified transmission framework. The secret key serves dual purposes: enabling confidentiality through secrecy coding and ensuring integrity/authentification through HMAC tag generation. This merging allows simultaneous achievement of both confidentiality and reliability without requiring separate key management systems.
Solution Approach 2:
The secret key in this system performs multiple functions: it is used both for the secrecy coding process to ensure confidentiality and for generating HMAC authentication tags to ensure integrity and authentication. This multi-functionality eliminates the need for separate pre-shared keys for different security objectives, simplifying the system while maintaining comprehensive security.
2Reliability
If hash-based authentication tags are added to messages, then message integrity and authentication are improved, but the complexity of the transmission system increases
Solution Approach 1:
The patent merges the secrecy coding operation and HMAC tag generation into a single integrated process that occurs simultaneously during message transmission preparation. Both operations use the same secret key and are performed in parallel, eliminating the need for separate processing stages and reducing overall system complexity despite adding authentication functionality.
Solution Approach 2:
By making the secret key universal for both confidentiality and authentication purposes, the patent reduces the number of key management operations and system components needed. The same key material serves both security functions, simplifying key distribution, storage, and management infrastructure while maintaining strong integrity and authentication guarantees.
3Reliability
If pre-shared keys are used for authentication, then message authentication is improved, but the key distribution and management becomes more difficult
Solution Approach 1:
The patent makes the secret key universally applicable for both confidentiality and authentication, eliminating the need for separate authentication keys. This reduces the number of keys that need to be distributed and managed between parties, simplifying key management infrastructure while maintaining strong authentication guarantees through HMAC tags.
Data Source
Figure 1~2
AI summary
The invention relates to a method for ensuring data integrity characterized in that it comprises at least the following steps: To transmit a message xi the sender A adds to the message xi containing the data to be transmitted a label tag, defined by tagi=h(Xi), by using a function h known only to the sender A and to the receiver B, and which is intended to guarantee the authentication and the checking of integrity of the transmitted data (201), The message x*i composed of the message of the useful data xi and of the label tagi is encoded to produce a message C(x*i) which is transmitted to the receiver B, the encoding is carried out in such a way as to guarantee confidentiality with the aid of a secret coding (202), After transmission, the receiver B receives the message X*i to which it applies a secret decoding so as to retrieve a data message Xi and a label Tag, and then it checks the authentication and the integrity of the received useful message Xi by verifying that the relation tagi = hko(Xi) is in fact complied with, guaranteeing Xi = xi.