A Survey of Oblivious Compression on Encrypted Data with Fully Homomorphic Encryption

Ensuring the security of private data during transmission and storage is increasingly crucial. Private information retrieval (PIR), which allows a client to retrieve specific data from a server's database without revealing any information to the server, offers a promising solution to this challenge. To design a PIR protocol, fully homomorphic encryption (FHE), which supports arbitrary computations on encrypted data, enables secure queries without exposing the queried data. However, PIR based on FHE often incurs high communication costs, leading to the development of oblivious ciphertext compression protocols that aim to reduce these costs while maintaining privacy. This paper reviews two recent techniques for oblivious ciphertext compression of encrypted data using FHE, which effectively reduce the data size transmitted between a server and a client. We examine these techniques along with their building blocks and related works in this field.

Authors

Institutions

Publication Details

Published
2024-10-16
DOI
https://doi.org/10.1109/ictc62082.2024.10827716
Citations
1
Primary Topic
Cryptography and Data Security
Type
article
Field-Weighted Citation Impact
0.35

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Survey of Oblivious Compression on Encrypted Data with Fully Homomorphic Encryption

Hyung Tae Lee, Sungrae Cho, Jeongyeup Paek, Yongseok Son et al.
1 citations
Cryptography and Data Security
0.35
article

A Survey of Oblivious Compression on Encrypted Data with Fully Homomorphic Encryption

Hyung Tae Lee, Sungrae Cho, Jeongyeup Paek, Yongseok Son, Chanhyeok Park
article en
1 citations

Abstract

Ensuring the security of private data during transmission and storage is increasingly crucial. Private information retrieval (PIR), which allows a client to retrieve specific data from a server's database without revealing any information to the server, offers a promising solution to this challenge. To design a PIR protocol, fully homomorphic encryption (FHE), which supports arbitrary computations on encrypted data, enables secure queries without exposing the queried data. However, PIR based on FHE often incurs high communication costs, leading to the development of oblivious ciphertext compression protocols that aim to reduce these costs while maintaining privacy. This paper reviews two recent techniques for oblivious ciphertext compression of encrypted data using FHE, which effectively reduce the data size transmitted between a server and a client. We examine these techniques along with their building blocks and related works in this field.

Chung-Ang University (KR)
National Research Foundation of Korea
Openalex Percentile: Top 30%
Cryptography and Data Security
0.35
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

A Survey of Oblivious Compression on Encrypted Data with Fully Homomorphic Encryption — Hyung Tae Lee, Sungrae Cho, et al. · (2024) | TGRS Research Map | TGRS