Homomorphic encryption in computing systems and environments
AssigneeGokay Saldamli
InventorGokay Saldamli
Life of this patent
Estimating the term…
Loading patent…
AssigneeGokay Saldamli
InventorGokay Saldamli
Estimating the term…
A transformation function that satisfies at least linearity and convolution can be used to encrypt data. The transformation function can, for example, be a DFT with one or more evaluation points that can be kept secret for encryption. The transformation function can effectively serve as a transform map and can be used to achieve fully homographic encryption in a system where encrypted data can be manipulated by applying one or more operations and the resulting encrypted data can be decrypted by applying the inverse of the transformation function and/or transformation map. A transformation function that satisfies at least linearity and convolution can be used for various applications, including, for example, private/public key decryption schemes, a signature schemes, database query and search schemes, as well as various applications of homomorphic operations.
A method, implemented at least partly by an encrypting device, for encrypting data, wherein the method comprises:
An encrypting system that includes one or more processors and memory configured to:
A non-transitory computer readable storage medium storing at least executable code for encrypting data in encrypting system operable to execute executable code, wherein the executable code when executed:
Dependencies are inferred from the claim text.