Implementation and Performance Analysis of Homomorphic Signature Schemes | Research Square window.SnipcartSettings = { analytics: { enabled: false } }; (function() { var accessVector = localStorage.getItem('access_vector') || ''; window.dataLayer = window.dataLayer || []; if (accessVector) { window.dataLayer.push({ user: { profile: { profileInfo: { snid: accessVector } } } }); } })(); (function(w,d,s,l,i){w[l]=w[l]||[];w[l].push({'gtm.start':new Date().getTime(),event:'gtm.js'});var f=d.getElementsByTagName(s)[0],j=d.createElement(s),dl=l!='dataLayer'?'&l='+l:'';j.async=true;j.src='https://www.googletagmanager.com/gtm.js?id='+i+dl;f.parentNode.insertBefore(j,f);})(window,document,'script','dataLayer','GTM-K279D39R'); Browse Preprints In Review Journals COVID-19 Preprints AJE Video Bytes Research Tools Research Promotion AJE Professional Editing AJE Rubriq About Preprint Platform In Review Editorial Policies Our Team Advisory Board Help Center Sign In Submit a Preprint Cite Share Download PDF Research Article Implementation and Performance Analysis of Homomorphic Signature Schemes Davide Carnemolla, Dario Catalano, Mario Di Raimondo, Federico Savasta This is a preprint; it has not been peer reviewed by a journal. https://doi.org/ 10.21203/rs.3.rs-4793409/v1 This work is licensed under a CC BY 4.0 License Status: Under Revision Version 1 posted 9 You are reading this latest preprint version Abstract Homomorphic signatures allow to validate computation on signed data. Alice, holding a dataset ${m_1 , \ldots , m_t }$ uses her secret key $\sk$ to sign these data and stores the authenticated dataset on a remote server. \sloppy{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. Homomorphic Signatures Digital Signatures Cryptographic Engineering Cryptography Full Text Additional Declarations No competing interests reported. Cite Share Download PDF Status: Under Revision Version 1 posted Editorial decision: Revision requested 01 May, 2026 Reviews received at journal 30 Apr, 2026 Reviews received at journal 29 Apr, 2026 Reviewers agreed at journal 20 Apr, 2026 Reviewers agreed at journal 17 Apr, 2026 Reviewers invited by journal 20 Sep, 2025 Editor assigned by journal 24 Jul, 2024 Submission checks completed at journal 24 Jul, 2024 First submitted to journal 24 Jul, 2024 You are reading this latest preprint version Research Square lets you share your work early, gain feedback from the community, and start making changes to your manuscript prior to peer review in a journal. As a division of Research Square Company, we’re committed to making research communication faster, fairer, and more useful. We do this by developing innovative software and high quality services for the global research community. Our growing team is made up of researchers and industry professionals working together to solve the most critical problems facing scientific publishing. Also discoverable on Platform About Our Team In Review Editorial Policies Advisory Board Help Center Resources Author Services Accessibility API Access RSS feed Manage Cookie Preferences © Research Square 2026 | ISSN 2693-5015 (online) Privacy Policy Terms of Service Do Not Sell My Personal Information {"props":{"pageProps":{"initialData":{"identity":"rs-4793409","acceptedTermsAndConditions":true,"allowDirectSubmit":false,"archivedVersions":[],"articleType":"Research Article","associatedPublications":[],"authors":[{"id":338208294,"identity":"5a4548ba-3455-4752-a27f-33ecfb12de95","order_by":0,"name":"Davide Carnemolla","email":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZAAAAAyAQMAAABI0h/eAAAABlBMVEX///8AAABVwtN+AAAACXBIWXMAAA7EAAAOxAGVKw4bAAAA5ElEQVRIie3PvQrCMBDA8YRCHLumbxEptPgs7m7dM4ikS13UuSDoK+ji3HLQLgFXwYKVQmcncRJj8QuhtqND/tMR7gcXhHS6P4whRKrBfD0ZhmhFqHXfiyqCWxIWPQlqIG5nWhZ8mI3s/fRYnHjWN8eKXPimlvQmqduVSUmdLLVZJEsvBCzwRO7rD9sNiCUIUEcNNA7AE4oYOPhBDqUiV6B2+CDLRrIjxPIDoIw+yKqRyEGn68/ACrPEYFKCt1Yk/vmXNCFHcQbTnAc45xy8xRbi/MLryTv6MUct9r+ITqfT6T67AeRHXlRQbcbmAAAAAElFTkSuQmCC","orcid":"","institution":"University of Catania","correspondingAuthor":true,"prefix":"","firstName":"Davide","middleName":"","lastName":"Carnemolla","suffix":""},{"id":338208296,"identity":"c1ac0d53-29cd-477c-b525-981cdad0a371","order_by":1,"name":"Dario Catalano","email":"","orcid":"","institution":"University of Catania","correspondingAuthor":false,"prefix":"","firstName":"Dario","middleName":"","lastName":"Catalano","suffix":""},{"id":338208299,"identity":"31b7d3ae-ce75-4c6c-ba2f-2d63d1af7715","order_by":2,"name":"Mario Di Raimondo","email":"","orcid":"","institution":"University of Catania","correspondingAuthor":false,"prefix":"","firstName":"Mario","middleName":"Di","lastName":"Raimondo","suffix":""},{"id":338208300,"identity":"c43baaff-1be2-4677-aa7e-af1656b348b5","order_by":3,"name":"Federico Savasta","email":"","orcid":"","institution":"","correspondingAuthor":false,"prefix":"","firstName":"Federico","middleName":"","lastName":"Savasta","suffix":""}],"badges":[],"createdAt":"2024-07-24 07:59:45","currentVersionCode":1,"declarations":"","doi":"10.21203/rs.3.rs-4793409/v1","doiUrl":"https://doi.org/10.21203/rs.3.rs-4793409/v1","draftVersion":[],"editorialEvents":[],"editorialNote":"","failedWorkflow":false,"files":[{"id":62891885,"identity":"9ee7936f-28b6-44fe-a044-8593539ecdff","added_by":"auto","created_at":"2024-08-20 17:49:09","extension":"pdf","order_by":1,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":369908,"visible":true,"origin":"","legend":"","description":"","filename":"ImplementationandPerformanceAnalysisofHomomorphicSignatureSchemes.pdf","url":"https://assets-eu.researchsquare.com/files/rs-4793409/v1_covered_112628d8-05ac-4226-a3a1-490c4bd75d1f.pdf"}],"financialInterests":"No competing interests reported.","formattedTitle":"Implementation and Performance Analysis of Homomorphic Signature Schemes","fulltext":[],"fulltextSource":"","fullText":"","funders":[],"hasAdminPriorityOnWorkflow":false,"hasManuscriptDocX":false,"hasOptedInToPreprint":true,"hasPassedJournalQc":"","hasAnyPriority":false,"hideJournal":false,"highlight":"","institution":"","isAcceptedByJournal":false,"isAuthorSuppliedPdf":true,"isDeskRejected":"","isHiddenFromSearch":false,"isInQc":false,"isInWorkflow":false,"isPdf":true,"isPdfUpToDate":true,"isWithdrawnOrRetracted":false,"journal":{"display":true,"email":"
[email protected]","identity":"journal-of-cryptographic-engineering","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":false,"externalIdentity":"jcen","sideBox":"Learn more about [Journal of Cryptographic Engineering](http://link.springer.com/journal/13389)","snPcode":"13389","submissionUrl":"https://submission.nature.com/new-submission/13389/3","title":"Journal of Cryptographic Engineering","twitterHandle":"","acdcEnabled":true,"dfaEnabled":true,"editorialSystem":"em","reportingPortfolio":"Springer Hybrid","inReviewEnabled":true,"inReviewRevisionsEnabled":false},"keywords":"Homomorphic Signatures, Digital Signatures, Cryptographic Engineering, Cryptography","lastPublishedDoi":"10.21203/rs.3.rs-4793409/v1","lastPublishedDoiUrl":"https://doi.org/10.21203/rs.3.rs-4793409/v1","license":{"name":"CC BY 4.0","url":"https://creativecommons.org/licenses/by/4.0/"},"manuscriptAbstract":"Homomorphic signatures allow to validate computation on signed data. Alice, holding a dataset $\\{m_1 , \\ldots , m_t \\}$ uses her secret key $\\sk$ to sign these data and stores the authenticated dataset on a remote server. \\sloppy{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.","manuscriptTitle":"Implementation and Performance Analysis of Homomorphic Signature Schemes","msid":"","msnumber":"","nonDraftVersions":[{"code":1,"date":"2024-08-20 17:41:01","doi":"10.21203/rs.3.rs-4793409/v1","editorialEvents":[{"type":"communityComments","content":0},{"type":"decision","content":"Revision requested","date":"2026-05-01T06:08:04+00:00","index":"","fulltext":""},{"type":"editorInvitedReview","content":"","date":"2026-04-30T10:09:45+00:00","index":"hide","fulltext":""},{"type":"editorInvitedReview","content":"","date":"2026-04-29T15:42:49+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"135234688492644521196455800806652207212","date":"2026-04-20T08:50:19+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"170026965261665603507468847105064291017","date":"2026-04-17T12:45:42+00:00","index":"hide","fulltext":""},{"type":"reviewersInvited","content":"","date":"2025-09-20T16:20:52+00:00","index":"","fulltext":""},{"type":"editorAssigned","content":"","date":"2024-07-24T13:58:14+00:00","index":"","fulltext":""},{"type":"checksComplete","content":"","date":"2024-07-24T13:57:29+00:00","index":"","fulltext":""},{"type":"submitted","content":"Journal of Cryptographic Engineering","date":"2024-07-24T07:58:29+00:00","index":"","fulltext":""}],"status":"published","journal":{"display":true,"email":"
[email protected]","identity":"journal-of-cryptographic-engineering","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":false,"externalIdentity":"jcen","sideBox":"Learn more about [Journal of Cryptographic Engineering](http://link.springer.com/journal/13389)","snPcode":"13389","submissionUrl":"https://submission.nature.com/new-submission/13389/3","title":"Journal of Cryptographic Engineering","twitterHandle":"","acdcEnabled":true,"dfaEnabled":true,"editorialSystem":"em","reportingPortfolio":"Springer Hybrid","inReviewEnabled":true,"inReviewRevisionsEnabled":false}}],"origin":"","ownerIdentity":"da0cb2a8-19bd-4c4f-84b6-80ee93f7117e","owner":[],"postedDate":"August 20th, 2024","published":true,"recentEditorialEvents":[],"rejectedJournal":[],"revision":"","amendment":"","status":"in-revision","subjectAreas":[],"tags":[],"updatedAt":"2026-05-01T06:23:12+00:00","versionOfRecord":[],"versionCreatedAt":"2024-08-20 17:41:01","video":"","vorDoi":"","vorDoiUrl":"","workflowStages":[]},"version":"v1","identity":"rs-4793409","journalConfig":"researchsquare"},"__N_SSP":true},"page":"/article/[identity]/[[...version]]","query":{"redirect":"/article/rs-4793409","identity":"rs-4793409","version":["v1"]},"buildId":"qtupq5eGEP_6zYnWcrvyt","isFallback":false,"isExperimentalCompile":false,"dynamicIds":[84888],"gssp":true,"scriptLoader":[]}
Text is read by the "Ask this paper" AI Q&A widget below.
Extraction quality varies by source — PMC NXML preserves structure
cleanly, OA-HTML may include some navigation residue, and OA-PDF can
have broken hyphenation. The publisher copy
(via DOI)
is the canonical version.