Paper 2024/1800 Original: eprint.iacr.org/2024/1800 ↗
Privacy-Preserving Multi-Party Search via Homomorphic Encryption with Constant Multiplicative Depth
Abstract
We propose a privacy-preserving multiparty search protocol using threshold-level homomorphic encryption, which we prove correct and secure to honest but curious adversaries. Unlike existing approaches, our protocol maintains a constant circuit depth. This feature enhances its suitability for practical applications involving dynamic underlying databases.
Metadata
- Available format(s)
PDF- Category
- Cryptographic protocols
- Publication info
- Preprint.
- History
- 2024-11-04: last updated
- 2024-11-04: published
- Short URL
- https://ia.cr/2024/1800
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2024/1800,
author = {Mihail-Iulian Pleşa and Ruxandra F. Olimid},
title = {Privacy-Preserving Multi-Party Search via Homomorphic Encryption with Constant Multiplicative Depth},
howpublished = {Cryptology {ePrint} Archive, Paper 2024/1800},
year = {2024},
url = {https://eprint.iacr.org/2024/1800}
}