Results 81 to 90 of about 111,433 (205)
Analysis of Homomorphic Encryption Algorithms [PDF]
Modern methods of homomorphic encryption are considered. Homomorphic encryption schemes are analyzed according to the type and complexity of operations they support. Homomorphic encryption schemes based on lattice problems, such as the BGV scheme and the
Hushchyn Bohdan-Danylo
core
A Survey of Homomorphic Encryption for Nonspecialists
No ...
Fontaine, Caroline, Galand, Fabien
openaire +3 more sources
Homomorphic encryption (HE) is one technique that enables privacy-preserving computation. Operations (or circuit evaluations) are performed directly on homomorphically encrypted data. The result can then be decrypted. Since its introduction 46 years ago, homomorphic encryption has evolved significantly with a plethora of schemes to choose from, each ...
Xun Yi +7 more
openaire +2 more sources
Homomorphic Encryption Using Enhanced BGV Encryption Scheme For Cloud Security
Fully Homomorphic Encryption is used to enhance the security incase of un-trusted systems or applications that deals with sensitive data. Homomorphic encryption enables computation on encrypted data without decryption.
S.V.Suriya Prasad, K. Kumanan
core +1 more source
Secure Cloud Computing Using Homomorphic Encryption
The question of cloud security has become more significant with growing popularity of cloud computing. This article is dedicated to fully homomorphic encryption which is one of the most promising methods to reach the necessary level of privacy.
Alexander Olegovich Zhirov +2 more
doaj
This paper proposes a pruned homomorphic encryption-based collaborative federated learning algorithm to address the issues of non-uniform data distribution, overfitting caused by residual gradient features, and privacy leakage risks in power big data ...
Weijian Zhang +4 more
doaj +1 more source
New Limits for Homomorphic Encryption
We make progress on the foundational problem of determining the strongest security notion achievable by homomorphic encryption. Our results are negative. We prove that a wide class of semi-homomorphic public key encryption schemes (SHPKE) cannot be proven IND-PCA secure (indistinguishability against plaintext checkability attacks), a relaxation of IND ...
Sven Schäge, Marc Vorstermans
openaire +2 more sources
Applications of Homomorphic Encryption
First, we prove that if an asymmetric homomorphic encryption (homomorphic on addoperation) which can detect zero, detect equality, compare the value or detect overflow without any restrictions, then the scheme is not IND-CPA.
Tsai, Chen-yu
core
Post-Quantum Homomorphic Encryption: A Case for Code-Based Alternatives
Homomorphic Encryption (HE) allows secure and privacy-protected computation on encrypted data without the need to decrypt it. Since Shor’s algorithm rendered prime factorisation and discrete logarithm-based ciphers insecure with quantum computations ...
Siddhartha Siddhiprada Bhoi +3 more
doaj +1 more source
On the Weakness of Fully Homomorphic Encryption
10 ...
Zhengjun Cao, Lihua Liu 0001
openaire +2 more sources

