Paper 2017/458
Fully Homomorphic Encryption Using Multivariate Polynomials
Matthew Tamayo-Rios, Jean-Charles Faugère, Ludovic Perret, Peng Hui How, and Robin Zhang
Abstract
Efficient and secure third party computation has many practical applications in cloud computing. We develop new approach for building fully homomorphic encryption (FHE) schemes, by starting with the intuition of using algebraic descriptions of the encryption and decryption functions to construct a functionally complete set of homomorphic boolean operators. We use this approach to design a compact efficient asymmetric cryptosystem that supports secure third party evaluation of arbitrary boolean functions. In the process, we introduce a new hard problem that is a more difficult variant of of the classical Isomorphism of Polynomials (IP) that we call the Obfuscated-IP.
Note: This article has been withdrawn by the authors because it was not ready to be made public at the point that it was originally posted.
Metadata
- Available format(s)
- -- withdrawn --
- Category
- Public-key cryptography
- Publication info
- Preprint.
- Keywords
- public-key cryptographyfully homomorphic encryptionmultivariate cryptographyboolean functionsisomorphism of polynomialsimplementation
- Contact author(s)
- robinz16 @ stanford edu
- History
- 2017-06-09: withdrawn
- 2017-05-25: received
- See all versions
- Short URL
- https://ia.cr/2017/458
- License
-
CC BY