On the IND-CCA1 Security of FHE Schemes

Author:

Fauzi PrastudyORCID,Hovd Martha NorbergORCID,Raddum HåvardORCID

Abstract

Fully homomorphic encryption (FHE) is a powerful tool in cryptography that allows one to perform arbitrary computations on encrypted material without having to decrypt it first. There are numerous FHE schemes, all of which are expanded from somewhat homomorphic encryption (SHE) schemes, and some of which are considered viable in practice. However, while these FHE schemes are semantically (IND-CPA) secure, the question of their IND-CCA1 security is much less studied, and we therefore provide an overview of the IND-CCA1 security of all acknowledged FHE schemes in this paper. To give this overview, we grouped the SHE schemes into broad categories based on their similarities and underlying hardness problems. For each category, we show that the SHE schemes are susceptible to either known adaptive key recovery attacks, a natural extension of known attacks, or our proposed attacks. Finally, we discuss the known techniques to achieve IND-CCA1-secure FHE and SHE schemes. We concluded that none of the proposed schemes were IND-CCA1-secure and that the known general constructions all had their shortcomings.

Publisher

MDPI AG

Subject

Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Computer Science Applications,Software

Reference80 articles.

1. On data banks and privacy homomorphisms;Rivest;Found. Secur. Comput.,1978

2. Fully homomorphic encryption using ideal lattices

3. Implementing Gentry’s Fully-Homomorphic Encryption Scheme

4. Towards a Homomorphic Machine Learning Big Data Pipeline for the Financial Services Sector;Masters;Cryptol. ePrint Arch.,2019

5. Updates on ISO/IEC Standardization;Laine,2021

Cited by 5 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Coupling bit and modular arithmetic for efficient general-purpose fully homomorphic encryption;ACM Transactions on Embedded Computing Systems;2024-06-10

2. Fully Homomorphic Encryption Beyond IND-CCA1 Security: Integrity Through Verifiability;Lecture Notes in Computer Science;2024

3. Federated Learning is Better with Non-Homomorphic Encryption;Proceedings of the 4th International Workshop on Distributed Machine Learning;2023-12-05

4. A survey on implementations of homomorphic encryption schemes;The Journal of Supercomputing;2023-04-14

5. SoK: Towards CCA Secure Fully Homomorphic Encryption;Proceedings of the 20th International Conference on Security and Cryptography;2023

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3