Noisy Secret Key Sub-key Segmentation for Secure Communication
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current secure communication systems fail to effectively address issues related to noisy secrets, where small differences in negotiated secrets between senders and receivers lead to message loss due to unreliable key negotiation.
Innovation Solution
Implementing a polynomial secret sharing scheme using Shamir's algorithm, where a sender divides negotiated noisy secrets into sub-keys and test blocks, encrypts them with unique points of a secret polynomial, and sends them to a receiver for sub-key validity testing and message decryption.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If traditional secure communication systems use negotiated secrets for key derivation, then encryption and decryption can be performed, but message loss occurs when the negotiated secret is noisy (differing bits between sender and receiver)
Solution Approach 1:
The patent segments the secret key into multiple sub-keys using polynomial-based secret sharing schemes. Instead of relying on a single noisy secret, the system divides the secret into N points of a polynomial, where any K points can reconstruct the original secret. This segmentation allows the receiver to tolerate some noisy bits while still recovering the correct key through majority voting or error correction across multiple sub-key candidates.
2Reliability
If the sender transmits additional data for noise correction, then message loss probability decreases, but message overhead increases
Solution Approach 1:
The patent performs preliminary action by pre-computing multiple sub-key candidates and their corresponding polynomial points before transmission. The sender encrypts multiple test blocks with different sub-key candidates and includes only the necessary encrypted points for key reconstruction. This preliminary preparation allows the receiver to efficiently test sub-key candidates without requiring excessive additional data, reducing overhead while maintaining high decryption reliability.
Data Source
AI summary
Zero round trip secure communications are implemented based on noisy secrets with a polynomial secret sharing scheme. A sender identifies two negotiated noisy secrets associated with an encrypted message to send to a receiver system. The sender utilizes a first negotiated noisy secret for sub-key selection, and generates a secret polynomial using Shamir's polynomial-based secret sharing scheme with N positive integer points and a message key as a secret. The sender divides the first negotiated noisy secret into a plurality of sub-keys, and divides a second negotiated noisy secret into test blocks of a length equivalent to a length of a sub-key. The sender utilizes each of the plurality sub-keys for encrypting a corresponding test block along with one unique point of the secret polynomial. Moreover, the sender sends all encrypted test blocks and corresponding encrypted points of the secret polynomial to the receiver with the encrypted message.