Homomorphic Signature Schemes A Survey /

Homomorphic signature schemes are an important primitive for many applications and since their introduction numerous solutions have been presented. Thus, in this work we provide the first exhaustive, complete, and up-to-date survey about the state of the art of homomorphic signature schemes. First,...

Full description

Main Authors: Traverso, Giulia. (Author, http://id.loc.gov/vocabulary/relators/aut), Demirel, Denise. (http://id.loc.gov/vocabulary/relators/aut), Buchmann, Johannes. (http://id.loc.gov/vocabulary/relators/aut)
Corporate Author: SpringerLink (Online service)
Language:English
Published: Cham : Springer International Publishing : Imprint: Springer, 2016.
Edition:1st ed. 2016.
Series:SpringerBriefs in Computer Science,
Subjects:
Online Access:https://doi.org/10.1007/978-3-319-32115-8
Summary:Homomorphic signature schemes are an important primitive for many applications and since their introduction numerous solutions have been presented. Thus, in this work we provide the first exhaustive, complete, and up-to-date survey about the state of the art of homomorphic signature schemes. First, the general framework where homomorphic signatures are defined is described and it is shown how the currently available types of homomorphic signatures can then be derived from such a framework. In addition, this work also presents a description of each of the schemes presented so far together with the properties it provides. Furthermore, three use cases, electronic voting, smart grids, and electronic health records, where homomorphic signature schemes can be employed are described. For each of these applications the requirements that a homomorphic signature scheme should fulfill are defined and the suitable schemes already available are listed. This also highlights the shortcomings of current solutions. Thus, this work concludes with several ideas for future research in the direction of homomorphic signature schemes.
Physical Description:XI, 64 p. online resource.
ISBN:9783319321158
ISSN:2191-5768