A Survey of Blind Sorting Techniques: Approaches Using Fully Homomorphic Encryption

Citations

SCOPUS

0

초록

With recent advancements in cloud services, the demand for data security during outsourced computations has been increasing. Fully Homomorphic Encryption (FHE) offers a promising solution to this demand by enabling the evaluation of arbitrary functions on encrypted data. Over the years, there have been significant developments in using FHE for various applications. One interesting but still incomplete topic is the sorting of encrypted arrays. This task presents several challenges, including the choice of a base sorting algorithm and the need for efficient private comparison methods. In this paper, we present a comprehensive survey of blind sorting, providing a canonical arrangement of previous works. Furthermore, we review the core ideas from key studies, as well as the main challenges and solutions in developing efficient blind sorting algorithms. © 2024 IEEE.

키워드

Blind sorting; fully homomorphic encryption; private comparison methods; sorting algorithm; sorting of encrypted arrays
제목
A Survey of Blind Sorting Techniques: Approaches Using Fully Homomorphic Encryption
저자
Kim, Seunghu; Son, Yongseok; Paek, Jeongyeup; Cho, Sungrae; Lee, Hyung Tae
DOI
10.1109/ICTC62082.2024.10827130
발행일
2024-10
유형
Conference paper
저널명
International Conference on ICT Convergence
권
2024
페이지
480 ~ 485