Graduate School and Research Center in Digital Sciences

Efficient proof composition for verifiable computation

Keuffer, Julien; Molva, Refik; Chabanne, Hervé

ESORICS 2018, European Symposium on Research in Computer Security, 3-7 September 2018, Barcelona, Spain / Also published in LNCS, Vol.11098/2018

Outsourcing machine learning algorithms helps users to deal with large amounts of data without the need to develop the expertise required by these algorithms. Outsourcing however raises severe security issues due to potentially untrusted service providers. Verifiable computing (VC) tackles some of these issues by assuring computational integrity for an outsourced computation. In this paper, we design a VC protocol tailored to verify a sequence of operations for which no existing VC scheme is suitable to achieve realistic performance objective for the entire sequence. We thus suggest a technique to compose several specialized and efficient VC schemes with a general purpose VC protocol, like Parno et al.’s Pinocchio, by integrating the verification of the proofs generated by these specialized schemes as a function that is part of the sequence of operations verified using the general purpose scheme. The resulting scheme achieves the objectives of the general purpose scheme with increased efficiency for the prover. The scheme relies on the underlying cryptographic assumptions of the composed protocols for correctness and soundness.

Doi Bibtex

Title:Efficient proof composition for verifiable computation
Keywords:Verifiable computation, Proof composition, Neural networks
Type:Conference
Language:English
City:Barcelona
Country:SPAIN
Date:
Department:Communication systems
Eurecom ref:5624
Copyright: © Springer. Personal use of this material is permitted. The definitive version of this paper was published in ESORICS 2018, European Symposium on Research in Computer Security, 3-7 September 2018, Barcelona, Spain / Also published in LNCS, Vol.11098/2018 and is available at : http://doi.org/10.1007/978-3-319-99073-6_8
Bibtex: @inproceedings{EURECOM+5624, doi = {http://doi.org/10.1007/978-3-319-99073-6_8}, year = {2018}, title = {{E}fficient proof composition for verifiable computation}, author = {{K}euffer, {J}ulien and {M}olva, {R}efik and {C}habanne, {H}erv{\'e}}, booktitle = {{ESORICS} 2018, {E}uropean {S}ymposium on {R}esearch in {C}omputer {S}ecurity, 3-7 {S}eptember 2018, {B}arcelona, {S}pain / {A}lso published in {LNCS}, {V}ol.11098/2018 }, address = {{B}arcelona, {SPAIN}}, month = {08}, url = {http://www.eurecom.fr/publication/5624} }
See also: