Abstract
Homomorphic aggregate signature (HAS) is a linearly homomorphic signature (LHS) for multiple users, which can be applied for a variety of purposes, such as multi-source network coding and sensor data aggregation. In order to design an efficient postquantum secure HAS scheme, we borrow the idea of the lattice-based LHS scheme over binary field in the single-user case, and develop it into a new lattice-based HAS scheme in this paper. The security of the proposed scheme is proved by showing a reduction to the single-user case and the signature length remains invariant. Compared with the existing lattice-based homomorphic aggregate signature scheme, our new scheme enjoys shorter signature length and high efficiency.
Highlights
The homomorphic signature, proposed originally by Johnson et al [1], is an important cryptographic primitive commonly used to secure computation
Their works give an example of linearly homomorphic signature built using the lattice assumption over binary field [5], while they show that a homomorphic signature supporting authenticated polynomial functions on signed data can be constructed by using “ideal lattice” in the random model [6]
We propose a novel lattice-based Homomorphic aggregate signature (HAS) scheme with short signature, which is an extension of linearly homomorphic signature (LHS) scheme based on lattice over binary field in the single user case [7]
Summary
The homomorphic signature, proposed originally by Johnson et al [1], is an important cryptographic primitive commonly used to secure computation. The breakthrough has been achieved by Bohen and Freeman [5, 6] Their works give an example of linearly homomorphic signature built using the lattice assumption over binary field [5], while they show that a homomorphic signature supporting authenticated polynomial functions on signed data can be constructed by using “ideal lattice” in the random model [6]. Zhang et al [16] introduced aggregation property into homomorphic signature for multiple users case and formed a homomorphic aggregation signature scheme (HAS) by using preimage sampling function and Bonsai tree technique over random lattice These authentication schemes designed for multiuser case (or multi-source case) all have their own flaws. We propose a short latticed-based linearly homomorphic aggregate signature scheme over binary field after optimizing our initial scheme in the multiple users case.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
