Davide Carnemolla

Homomorphic signatures allow to validate computation on signed data. Alice, holding a dataset, {m_1 , \ldots , m_t } uses her secret key \mathsfsk to sign these data and stores the authenticated dataset on a remote server. The server can later (publicly) compute m = f(m_1,...,m_t) together with a signature σcertifying that m is indeed the correct output of the computation f. Over the last fifteen years, the problem of realizing homomorphic signatures has been the focus of numerous research works, with constructions now ranging from very efficient ones supporting linear functions to very expressive ones supporting (up to) arbitrary circuits. In this work we tackle the question of assessing the practicality of schemes belonging to this latter class. Specifically, we implement the GVW lattice based scheme for circuits from STOC 2015 and two, recently proposed, pairings based constructions building from functional commitments. Our experiments show that (both) pairings based schemes outperform GVW on all fronts.