RMC-PVC: A Multi-Client Reusable Verifiable Computation Protocol (Long version) - Archive ouverte HAL Access content directly
Conference Papers Year :

RMC-PVC: A Multi-Client Reusable Verifiable Computation Protocol (Long version)

(1) , (1) , (2)
1
2

Abstract

The verification of computations performed by an untrusted server is a cornerstone for delegated computations, especially in multiclients setting where inputs are provided by different parties. Assuming a common secret between clients, a garbled circuit offers the attractive property to ensure the correctness of a result computed by the untrusted server while keeping the input and the function private. Yet, this verification can be guaranteed only once. Based on the notion of multi-key homomorphic encryption (MKHE), we propose RMC-PVC a multi-client verifiable computation protocol, able to verify the correctness of computations performed by an untrusted server for inputs (encoded for a garbled circuit) provided by multiple clients. Thanks to MKHE, the garbled circuit is reusable an arbitrary number of times. In addition, each client can verify the computation by its own. Compared to a single-key FHE scheme, the MKHE usage in RMC-PVC allows to reduce the workload of the server and thus the response delay for the client. It also enforce the privacy of inputs, which are provided by different clients.
Fichier principal
Vignette du fichier
main.pdf (577.45 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03909382 , version 1 (21-12-2022)

Identifiers

  • HAL Id : hal-03909382 , version 1

Cite

Pascal Lafourcade, Gael Marcadet, Léo Robert. RMC-PVC: A Multi-Client Reusable Verifiable Computation Protocol (Long version). SAC 23, 2023, Tallinn, Estonia. ⟨hal-03909382⟩
0 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More