Fully Homomorphic Encryption from Ring-LWE：Identity-Based，Arbitrary Cyclotomic，Tighter Parameters

GU Chun-xiang; Xin Dan; ZHENG Yong-hui; KANG Yuan-ji

Paper 2015/078

Fully Homomorphic Encryption from Ring-LWE：Identity-Based，Arbitrary Cyclotomic，Tighter Parameters

GU Chun-xiang, Xin Dan, ZHENG Yong-hui, and KANG Yuan-ji

Abstract

Fully homomorphic is an encryption scheme that allows for data to be stored and processed in an encrypted format, which gives the cloud provider a solution to host and process data without even knowing what the message is. In previous identity-based homomorphic encryption scheme, computing efficiency is complicated and expensive. In this work, based on Regev’s work, we propose a sampling trapdoor one-way function in arbitrary cyclotomic rings . Then construct a leveled identity-based homomorphic encryption scheme from ring learning with errors, which has advantage in computational efficiency and key management, by using user’s identity as the unique public key. This scheme is proved IND-CPA secure in the random oracle model, relied to hardness of decision ring learning with errors problem.

Metadata

Available format(s): PDF
Category: Public-key cryptography
Publication info: Preprint. MINOR revision.
Keywords: fully homomorphic encryption identity-based ring learning with errors cyclotomic rings
Contact author(s): gcxiang5209 @ aliyun com
History: 2015-02-10: received
Short URL: https://ia.cr/2015/078
License: CC BY

BibTeX

@misc{cryptoeprint:2015/078,
      author = {GU Chun-xiang and Xin Dan and ZHENG Yong-hui and KANG Yuan-ji},
      title = {Fully Homomorphic Encryption from Ring-{LWE}：Identity-Based，Arbitrary Cyclotomic，Tighter Parameters},
      howpublished = {Cryptology {ePrint} Archive, Paper 2015/078},
      year = {2015},
      url = {https://eprint.iacr.org/2015/078}
}