The polynomial approximate common divisor problem and its application to the fully homomorphic encryption-Reference-Cited by-同舟云学术

The polynomial approximate common divisor problem and its application to the fully homomorphic encryption

Published:2016-01 Issue: Volume:326 Page:41-58
ISSN:0020-0255
Container-title:Information Sciences
language:en
Short-container-title:Information Sciences

Author:

Cheon Jung Hee,Hong Hyunsook,Lee Moon Sung,Ryu Hansol^ORCID

Publisher

Elsevier BV

Subject

Artificial Intelligence,Information Systems and Management,Computer Science Applications,Theoretical Computer Science,Control and Systems Engineering,Software

Reference32 articles.

1. Possibility and impossibility results for encryption and commitment secure under selective opening;Bellare,2009

2. Improved security for a ring-based fully homomorphic encryption scheme;Bos,2013

3. Fully homomorphic encryption without modulus switching from classical gapsvp;Brakerski,2012

4. When Homomorphism Becomes a Liability;Brakerski,2013

5. (Leveled) fully homomorphic encryption without bootstrapping;Brakerski,2012

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

1. Security, privacy, and robustness for trustworthy AI systems: A review;Computers and Electrical Engineering;2024-11

2. A retrospective analysis on fully homomorphic encryption scheme;International Journal of Electronic Security and Digital Forensics;2024

3. Understanding integer-based fully homomorphic encryption;AIP Conference Proceedings;2022

4. Preserving Health Care Data Security and Privacy Using Carmichael's Theorem-Based Homomorphic Encryption and Modified Enhanced Homomorphic Encryption Schemes in Edge Computing Systems;Big Data;2021-08-10

5. Research perspectives on fully homomorphic encryption models for cloud sector1;Journal of Computer Security;2021-03-29