### A Linearly Homomorphic Signature Scheme From Weaker Assumptions

Lucas Schabhüser, Johannes Buchmann, and Patrick Struck

##### Abstract

In delegated computing, prominent in the context of cloud computing, guaranteeing both the correctness and authenticity of computations is of critical importance. Homomorphic signatures can be used as cryptographic solutions to this problem. In this paper we solve the open problem of constructing a linearly homomorphic signature scheme that is secure against an active adversary under standard assumptions. We provide a construction based on the DL and CDH assumption. Furthermore we show how our scheme can be combined with homomorphic encryption under the framework of Linearly Homomorphic Authenticated Encryption with Public Verifiability. This way we can provide the first such scheme that is context hiding. Furthermore our solution even allows verification in constant time (in an amortized sense).

Available format(s)
Category
Public-key cryptography
Publication info
Published elsewhere. MINOR revision.IMACC 2017
DOI
10.1007/978-3-319-71045-7_14
Keywords
homomorphic signatureshomomorphic encryptiondelegated computationcloud computing
Contact author(s)
History
Short URL
https://ia.cr/2018/035

CC BY

BibTeX

@misc{cryptoeprint:2018/035,
author = {Lucas Schabhüser and Johannes Buchmann and Patrick Struck},
title = {A Linearly Homomorphic Signature Scheme From Weaker Assumptions},
howpublished = {Cryptology ePrint Archive, Paper 2018/035},
year = {2018},
doi = {10.1007/978-3-319-71045-7_14},
note = {\url{https://eprint.iacr.org/2018/035}},
url = {https://eprint.iacr.org/2018/035}
}

Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.