A Lattice-Based Unordered Aggregate Signature Scheme Based on the Intersection Method

An aggregate signature turns multi-message multi-authentication into multi-message single-authentication, reducing the required storage space, transmission cost, and number of verification calculations, and is suitable for fast message authentication in the big data era, particularly in wireless sensor networks and secure email systems. Many aggregate signature schemes have been proposed, including lattice-based ones, which have good resistance to quantum machine attacks. However, the existing lattice-based aggregate signature schemes, which either have strict requirements on the signing order or encounter security risks, are not suitable for the unordered polymerization environment. In this paper, we accordingly propose a lattice-based unordered aggregate signature scheme. The proposed scheme makes use of the intersection method and solves the unordered aggregate problem of lattice signatures with different public keys. Therefore, it avoids both the signing order limitation and the risk of single signature forgery. Furthermore, the scheme follows the improved security model; hence, it is robust against collusion attacks. In addition, the scheme’s security depends on the small integer solution problem, which enables the scheme to resist quantum algorithm attacks.

[1]  Jianfeng Ma,et al.  A Provably Secure Aggregate Signature Scheme for Healthcare Wireless Sensor Networks , 2016, Journal of Medical Systems.

[2]  Zhang Yanhua,et al.  Lattice-based sequential aggregate signatures with lazy verification , 2015 .

[3]  Zhengjun Jing,et al.  An Efficient Homomorphic Aggregate Signature Scheme Based on Lattice , 2014 .

[4]  Rachid El Bansarkhani,et al.  Towards Lattice Based Aggregate Signatures , 2014, AFRICACRYPT.

[5]  Dong Hoon Lee,et al.  Sequential Aggregate Signatures with Short Public Keys: Design, Analysis and Implementation Studies , 2013, Public Key Cryptography.

[6]  Dan Boneh,et al.  Homomorphic Signatures for Polynomial Functions , 2011, EUROCRYPT.

[7]  David Cash,et al.  Bonsai Trees, or How to Delegate a Lattice Basis , 2010, Journal of Cryptology.

[8]  Dan Boneh,et al.  Efficient Lattice (H)IBE in the Standard Model , 2010, EUROCRYPT.

[9]  Craig Gentry,et al.  Trapdoors for hard lattices and new cryptographic constructions , 2008, IACR Cryptol. ePrint Arch..

[10]  Rafail Ostrovsky,et al.  Sequential Aggregate Signatures and Multisignatures Without Random Oracles , 2006, EUROCRYPT.

[11]  Craig Gentry,et al.  Identity-Based Aggregate Signatures , 2006, Public Key Cryptography.

[12]  Zuhua Shao,et al.  Enhanced Aggregate Signatures from Pairings , 2005, CISC.

[13]  Brent Waters.  Efficient Identity-Based Encryption Without Random Oracles , 2005, EUROCRYPT.

[14]  Hovav Shacham,et al.  Sequential Aggregate Signatures from Trapdoor Permutations , 2004, EUROCRYPT.

[15]  Hovav Shacham,et al.  Aggregate and Verifiably Encrypted Signatures from Bilinear Maps , 2003, EUROCRYPT.

[16]  Peter W. Shor,et al.  Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer , 1995, SIAM Rev..

[17]  Zhang Peng,et al.  A Homomorphic Aggregate Signature Scheme Based on Lattice , 2012 .

[18]  David Cash,et al.  How to Delegate a Lattice Basis , 2009, IACR Cryptol. ePrint Arch..