Homomorphic Key Rotation Verification Without Plaintext Exposure
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing encryption systems lack efficient and secure methods for encryption key rotation, particularly in the context of symmetric encryption systems, where existing systems fail to provide robust validation and post-compromise security, and are vulnerable to quantum computers.
Innovation Solution
Implementing a cryptographic key rotation system using a cryptographic key rotation method, where the cryptographic key is generated and validated by a cryptographic key, and the cryptographic key is rotated by a cryptographic key.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If existing key rotation methods decrypt and re-encrypt data, then key rotation can be performed, but plaintext is exposed and computational resources are extensively consumed
Solution Approach 1:
The patent introduces a re-encryption key as an intermediary element that enables key rotation without direct decryption. The re-encryption key acts as a mediator between the old encryption key and the new encryption key, allowing ciphertext to be transformed from one key to another through a two-step process: first re-encrypting with the re-encryption key, then encrypting with the new key. This intermediary mechanism prevents plaintext exposure while achieving secure key rotation.
Solution Approach 2:
The patent segments the key rotation process into distinct cryptographic operations: generating a re-encryption key from the old key, using this re-encryption key to transform the ciphertext, and then applying the new encryption key. This segmentation allows each step to be performed independently and verifiably, reducing computational overhead compared to full decryption and re-encryption, while maintaining security.
2Reliability
If existing key rotation methods decrypt and re-encrypt data, then key rotation can be performed, but extensive computational resources are consumed
Solution Approach 1:
The re-encryption key serves as a computational intermediary that enables efficient key rotation. Instead of performing full decryption and re-encryption operations, the system uses the re-encryption key to perform a specialized transformation operation that is computationally less intensive. This intermediary approach significantly reduces the computational resources required for key rotation while maintaining cryptographic security.
Solution Approach 2:
The patent performs preliminary generation of the re-encryption key before the actual key rotation operation. This re-encryption key is pre-computed from the old encryption key and can be used repeatedly for rotating multiple ciphertexts to the new key. This preliminary action avoids repeated expensive cryptographic operations, reducing overall computational resource consumption during key rotation.
3Measurement precision
If homomorphic encryption is used for key rotation, then data integrity can be verified without decryption, but the encryption scheme complexity increases
Solution Approach 1:
The patent uses homomorphic encryption properties to create an intermediary verification mechanism. The re-encryption key enables verification of data integrity through cryptographic proofs that can be checked without decrypting the ciphertext. This intermediary verification approach allows precise measurement of data integrity (whether the ciphertext was properly re-encrypted) while avoiding the need for complex decryption and re-encryption operations, thus managing complexity.
Data Source
AI summary
Certain aspects of the disclosure provide a method for verifiable key rotation of an encryption key. The method includes generating a ciphertext by encrypting a plaintext with a homomorphic probabilistic encryption scheme based on a first key. The method further includes generating an updating token based on a difference between the homomorphic probabilistic encryption scheme based on a second key and generating a second ciphertext by encrypting the first ciphertext with the updating token. The method further includes validating the key rotation by selecting a set of second ciphertext blocks from the second ciphertext; reverting the set of second ciphertext blocks with the updating token to a set of third ciphertext blocks; and computing a Hamming distance between blocks of the set of second ciphertext blocks and the corresponding set of third ciphertext blocks.