Analysis of Modified Shell Sort for Fully Homomorphic Encryption
The Shell sort algorithm is one of the most practically effective in-place sorting algorithms. However, it is difficult to execute this algorithm with its intended running time complexity on data encrypted using fully homomorphic encryption (FHE), because the insertion sort in Shell sort has to be p...
Main Authors: | Joon-Woo Lee, Young-Sik Kim, Jong-Seon No |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2021-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/9530524/ |
Similar Items
-
SoK: Fully Homomorphic Encryption over the [Discretized] Torus
by: Marc Joye
Published: (2022-08-01) -
SoK: Fully Homomorphic Encryption over the [Discretized] Torus
by: Marc Joye
Published: (2022-08-01) -
Homomorphic Comparison for Point Numbers with User-Controllable Precision and Its Applications
by: Heewon Chung, et al.
Published: (2020-05-01) -
Efficient Leveled (Multi) Identity-Based Fully Homomorphic Encryption Schemes
by: Tongchen Shen, et al.
Published: (2019-01-01) -
FDFB: Full Domain Functional Bootstrapping Towards Practical Fully Homomorphic Encryption
by: Kamil Kluczniak, et al.
Published: (2022-11-01)