Fully Homomorphic Public-key Encryption Based on Discrete Logarithm Problem
نویسنده
چکیده
In this paper I propose the new fully homomorphic public-key encryption scheme without bootstrapping that is based on the discrete logarithm assumption and computational Diffie–Hellman assumption of multivariate polynomials on octonion ring. The key size of this scheme and complexity for enciphering /deciphering become to be not so large to handle. keywords: fully homomorphic public-key encryption, discrete logarithm problem, octonion ring
منابع مشابه
FHPKE with Zero Norm Noises based on DLA&CDH
In this paper I propose the fully homomorphic public-key encryption(FHPKE) scheme with zero norm noises that is based on the discrete logarithm assumption(DLA) and computational Diffie–Hellman assumption(CDH) of multivariate polynomials on octonion ring. Since the complexity for enciphering and deciphering become to be small enough to handle, the cryptosystem runs fast. keywords: fully homomorp...
متن کاملFHPKE based on multivariate discrete logarithm problem
Previously I proposed fully homomorphic public-key encryption (FHPKE) based on discrete logarithm problem which is vulnerable to quantum computer attacks. In this paper I propose FHPKE based on multivariate discrete logarithm assumption. This encryption scheme is thought to withstand to quantum computer attacks. Though I can construct this scheme over many non-commutative rings, I will adopt th...
متن کاملFHE with Recursive Ciphertext
In this paper I propose fully homomorphic public-key encryption (FHPKE) with the recursive ciphertex. A ciphertext consists of three sub-ciphertexts corresponding to one plaintext. When we execute the additional operation or multiplicative operation, a new three sub-ciphertexts are generated from the three sub-ciphertexts recursively without revealing the plaintexts. The scheme is based on the ...
متن کاملNon-interactive Zero-Knowledge from Homomorphic Encryption
We propose a method for compiling a class of Σ-protocols (3-move public-coin protocols) into non-interactive zero-knowledge arguments. The method is based on homomorphic encryption and does not use random oracles. It only requires that a private/public key pair is set up for the verifier. The method applies to all known discrete-log based Σ-protocols. As applications, we obtain non-interactive ...
متن کاملA Multi-Bit Fully Homomorphic Encryption with Shorter Public Key from LWE
The efficiency of fully homomorphic encryption is a big question at present. To improve efficiency of fully homomorphic encryption, we use the technique of packed ciphertext to construct a multi-bit fully homomorphic encryption based on Learning with Errors problem. Our scheme has a short public key. Since our fully homomorphic encryption scheme builds on the basic encryption scheme that choose...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IACR Cryptology ePrint Archive
دوره 2016 شماره
صفحات -
تاریخ انتشار 2016