Compressed Homomorphic Encryption for Multi-Bit Ciphertext Storage
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current homomorphic encryption techniques face challenges in efficiently supporting arbitrary operations and have large public keys, leading to high storage costs due to the generation of multiple ciphertexts for small amounts of encrypted data.
Innovation Solution
A compressed encryption/decryption system is developed using a key generation module to create a public key and secret key, allowing for the encryption of multiple bits as a single ciphertext, reducing storage space requirements by using a compression ratio to generate only one ciphertext for l bits of plaintext information.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If homomorphic encryption encrypts one bit at a time using traditional techniques, then security is maintained, but storage space increases proportionally with the amount of data
Solution Approach 1:
The patent merges multiple plaintext bits into a single ciphertext by using a plaintext space larger than one bit. Specifically, it encrypts l bits of plaintext information into one ciphertext, combining what would traditionally require l separate encryption operations into a single unified encryption process, thereby reducing storage requirements while maintaining security
Solution Approach 2:
The patent changes the parameter of plaintext length from 1 bit to l bits in the homomorphic encryption scheme. By modifying the plaintext space parameter, the system can encrypt multiple bits simultaneously in a single ciphertext, directly addressing the storage space issue while preserving the security properties of homomorphic encryption
2Adaptability or versatility
If homomorphic encryption supports arbitrary operations, then functionality is improved, but public key length and computational complexity increase
Solution Approach 1:
The patent segments the large plaintext space into manageable chunks of l bits that can be encrypted together. This segmentation approach allows the system to handle arbitrary operations on encrypted data while keeping the public key length and computational complexity at manageable levels by processing data in fixed-size blocks rather than requiring support for arbitrarily large operations
Data Source
AI summary
The present invention relates to a technique which provides a function of compressed encryption large pieces of plaintext information in a single ciphertext in order to improve a space efficiency of the encryption data which occupies most of a storage space to design an efficient SHE technique which is a base of the FHE technique design. More specifically, the present invention relates to a technique which is designed to improve a structure in which only one bit is encrypted/decrypted in the technique of the prior art to encrypt/decrypt multiple bit information to improve the space efficiency for storing a ciphertext.