Fast additive partially homomorphic encryption from the approximate common divisor problem
EL Cominetti, MA Simplicio - IEEE Transactions on Information …, 2020 - ieeexplore.ieee.org
This paper presents two efficient partially homomorphic encryption schemes built upon the
approximate common divisor problem, believed to be resistant to quantum computer attacks …
approximate common divisor problem, believed to be resistant to quantum computer attacks …
A symmetric additive homomorphic encryption scheme based on NTRU proxy rekeys
W Liu, HX Hao, LA Wan, K Xu, M Han… - Proceedings of the 2022 …, 2022 - dl.acm.org
To address the problems that homomorphic encryption cannot achieve secret sharing and
existing Paillier cryptosystems cannot resist quantum attacks and are not suitable for …
existing Paillier cryptosystems cannot resist quantum attacks and are not suitable for …