Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2014 (2014), Article ID 536527, 9 pages
Research Article

An Efficient Homomorphic Aggregate Signature Scheme Based on Lattice

1Department of Computer Engineering, Jiangsu University of Technology, Changzhou 213001, China
2Department of Computer, Nanjing University of Posts and Telecommunications, Nanjing 210003, China

Received 19 June 2014; Accepted 15 September 2014; Published 6 November 2014

Academic Editor: Guoqiang Zhang

Copyright © 2014 Zhengjun Jing. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


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.