Paper 2018/035
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).
Metadata
- Available format(s)
-
PDF
- 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)
- lschabhueser @ cdc tu-darmstadt de
- History
- 2018-01-08: received
- Short URL
- https://ia.cr/2018/035
- License
-
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},
url = {https://eprint.iacr.org/2018/035}
}
