Abstract
In this work a formal definition of the general framework regarding homomorphic signature schemes is provided. Starting from such framework, it is also shown how linearly homomorphic signature schemes, homomorphic signature schemes for polynomial functions, fully homomorphic signature schemes, and homomorphic aggregate signature schemes are derived. Afterwards, the first up-to-dated survey about all the currently existing homomorphic signature schemes is provided, where each scheme is singularly described and analyzed. In addition three interesting use cases for homomorphic signature schemes were presented. These are: electronic voting, smart grids, and electronic health records. For each use case the minimal requirements a suitable homomorphic signature scheme should fulfill are discussed and the existing homomorphic signature schemes that properly address these requirements are presented. Based on these observations, directions for future work are suggested that would address the faults of the current state of the art.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2016 The Author(s)
About this chapter
Cite this chapter
Traverso, G., Demirel, D., Buchmann, J. (2016). Conclusion. In: Homomorphic Signature Schemes. SpringerBriefs in Computer Science. Springer, Cham. https://doi.org/10.1007/978-3-319-32115-8_6
Download citation
DOI: https://doi.org/10.1007/978-3-319-32115-8_6
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-32114-1
Online ISBN: 978-3-319-32115-8
eBook Packages: Computer ScienceComputer Science (R0)