[Resource Topic] 2024/1800: Privacy-Preserving Multi-Party Search via Homomorphic Encryption with Constant Multiplicative Depth

Welcome to the resource topic for 2024/1800

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

Authors: Mihail-Iulian Pleşa, Ruxandra F. Olimid

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.

ePrint: https://eprint.iacr.org/2024/1800

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .