Open AccessLeveled Homomorphic Encryption in Certificateless Cryptosystem
Author(s) -
Chen Hu,
Hu Yupu,
Lian Zhizhu
Publication year - 2017
Publication title -
chinese journal of electronics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.267
H-Index - 25
eISSN - 2075-5597
pISSN - 1022-4653
DOI - 10.1049/cje.2017.07.008
Subject(s) - homomorphic encryption , cryptosystem , random oracle , computer science , semantic security , probabilistic logic , theoretical computer science , multiplicative function , hybrid cryptosystem , property (philosophy) , encryption , class (philosophy) , homomorphic secret sharing , algorithm , public key cryptography , mathematics , cryptography , computer security , secret sharing , artificial intelligence , mathematical analysis , attribute based encryption , philosophy , epistemology
To lower communication complexity, a Certificateless homomorphic encryption (CLHE) scheme based on the Learning with errors (LWE) problem is constructed by introducing a new technique called probabilistic encoding with weakly homomorphic property. This technique can conveniently convert an intended message into two elements in a ring, which will be respectively encrypted under both public keys of a user in certificateless cryptosystem. Upon knowing both elements simultaneously, the original message can be easily recovered. It is hidden perfectly by the probabilistic property of encoding. This CLHE removes evaluation keys by using the approximate eigenvector method given by Gentry et al. , which makes it into a pure CLHE. It is proven to be semantic secure in the Random oracle model (ROM). The results indicate it is able to homomorphically evaluate any functions in a class functions with given multiplicative depth L .