Chosen-Ciphertext Secure Fully Homomorphic Encryption.

PKC(2017)

引用 76|浏览119
暂无评分
摘要
We give three fully homomoprhic encryption FHE schemes that are secure against non-adaptive chosen ciphertext attacks CCA1. For the first two, we extend the generic transformation of Boneh, Canetti, Halevi and Katz to turn any multi-key identity-based FHE scheme into a CCA1-secure FHE scheme. We then show two instantiations of multi-key identity-based FHE: One from LWE in the random oracle model, and one from sub-exponentially secure indistinguishability obfuscation. Both constructions are compact with respect to the function evaluated homomorphically but not compact with respect to the number of ciphertext involved in the homomorphic evaluation. The third scheme uses succinct non-interactive arguments of knowledge SNARKs and is fully compact.
更多
查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要