Organizer: Dr. Moritz Horsch, TU Darmstadt

Abstract

A major opportunity afforded by cloud computing is the delegation of computations. This immediately raises the security issue of guaranteeing data authenticity during a remote computation. Existing solutions do not simultaneously provide fast verification, strong security properties, and information-theoretic confidentiality. We introduce a novel approach, in the form of function dependent commitments, that combines these features. We provide an instantiation of function-dependent commitments for linear functions that is unconditionally hiding and relies on standard hardness assumptions. Our scheme can be used to perform verifiable computations on secret shares while requiring only a single party to compute the audit data for verification