Privacy-Preserving Multi-Party Search via Homomorphic Encryption with Constant Multiplicative Depth

Mihail-Iulian Pleşa; Ruxandra F. Olimid

Paper 2024/1800

Privacy-Preserving Multi-Party Search via Homomorphic Encryption with Constant Multiplicative Depth

Mihail-Iulian Pleşa

, Orange Services, University of Bucharest, Research Institute of the University of Bucharest

Ruxandra F. Olimid

, University of Bucharest, Research Institute of the University of Bucharest

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.

Note: Accepted at SecITC 2024 (https://secitc.eu/#)

Metadata

Available format(s): PDF
Category: Cryptographic protocols
Publication info: Preprint.
Keywords: Leveled Homomorphic Encryption (LHE)Multi-Party Computation (MPC)Privacy-preserving searching
Contact author(s): mihail plesa @ orange com
ruxandra olimid @ fmi unibuc ro
History: 2024-11-08: approved; 2024-11-04: received; See all versions
Short URL: https://ia.cr/2024/1800
License: CC BY

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}
}