[Resource Topic] 2024/655: Implementation and Performance Analysis of Homomorphic Signature Schemes

Welcome to the resource topic for 2024/655

Implementation and Performance Analysis of Homomorphic Signature Schemes

Authors: Davide Carnemolla, Dario Catalano, Mario Di Raimondo, Federico Savasta


Homomorphic signatures allow to validate computation on signed data. Alice, holding a dataset, \{m_1 , \ldots , m_t \} uses her secret key \sf sk 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 \sigma 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.

ePrint: https://eprint.iacr.org/2024/655

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .