Confidential Truth Finding with Multi-Party Computation (Extended Version) - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Preprints, Working Papers, ... Year : 2023

Confidential Truth Finding with Multi-Party Computation (Extended Version)


Federated knowledge discovery and data mining are challenged to assess the trustworthiness of data originating from autonomous sources while protecting confidentiality and privacy. Truth-finding algorithms help corroborate data from disagreeing sources. For each query it receives, a truth-finding algorithm predicts a truth value of the answer, possibly updating the trustworthiness factor of each source. Few works, however, address the issues of confidentiality and privacy. We devise and present a secure secret-sharing-based multi-party computation protocol for pseudo-equality tests that are used in truth-finding algorithms to compute additions depending on a condition. The protocol guarantees confidentiality of the data and privacy of the sources. We also present variants of truth-finding algorithms that would make the computation faster when executed using secure multi-party computation. We empirically evaluate the performance of the proposed protocol on two state-of-the-art truth-finding algorithms, Cosine, and 3-Estimates, and compare them with that of the baseline plain algorithms. The results confirm that the secret-sharing-based secure multi-party algorithms are as accurate as the corresponding baselines but for proposed numerical approximations that significantly reduce the efficiency loss incurred.
Fichier principal
Vignette du fichier
2305.14727.pdf (274.77 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-04139243 , version 1 (23-06-2023)




Angelo Saadeh, Pierre Senellart, Stéphane Bressan. Confidential Truth Finding with Multi-Party Computation (Extended Version). 2023. ⟨hal-04139243⟩
49 View
32 Download



Gmail Mastodon Facebook X LinkedIn More