ANDERSON R. Two remarks on public key cryptology[C]// Proceedings of the 4th ACM Conference on Computer and Communications Security, Zurich, Apr 1-4, 1997. New York: ACM, 1997.
 BONEH D, GENTRY C, LYNN B, et al. Aggregate and verifiably encrypted signatures from bilinear maps[C]//LNCS 2656: Proceedings of the 2003 International Conference on the Theory and Applications of Cryptographic Techniques, Warsaw, May 4-8, 2003. Berlin, Heidelberg: Springer, 2003: 416-432.
 LYSYANSKAYA A, MICALI S, REYZIN L, et al. Sequential aggregate signatures from trapdoor permutations[C]//LNCS 3027: Proceedings of the 2004 International Conference on the Theory and Applications of Cryptographic Techniques, Interlaken, May 2-6, 2004. Berlin, Heidelberg: Springer, 2004: 74-90.
 MA D, TSUDIK G. Extended abstract: forward-secure sequential aggregate authentication[C]//Proceedings of the 2007 IEEE Symposium on Security and Privacy, Oakland, May 20-23, 2007. Piscataway: IEEE, 2007: 86-91.
 BONEH D, LYNN B, SHACHAM H. Short signatures from the weil pairing[C]//LNCS 2248: Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security, Gold Coast, Dec 9-13, 2001. Berlin, Heidelberg: Springer, 2001: 514-532.
 MA D. Practical forward secure sequential aggregate signatures[C]//Proceedings of the 2008 ACM Symposium on Information, Computer and Communications Security, Tokyo, Mar 18-20, 2008. New York: ACM, 2008: 341-352.
 WEI X J, ZHANG J H, LIU Z F, et al. Identity based aggregate signature scheme with forward security[J]. Computer Science, 2018, 45(S1): 387-391.
韦性佳, 张京花, 刘增芳, 等. 具有前向安全性质的基于身份的聚合签名方案[J]. 计算机科学, 2018, 45(S1): 387-391.
 WEI X J. Research on aggregate signature scheme with forward security[D]. Xining: Qinghai Normal University, 2018.
韦性佳. 具有前向安全性质的聚合签名方案研究[D]. 西宁: 青海师范大学, 2018.
 KIM J, OH H. FAS: forward secure sequential aggregate signatures for secure logging[J]. Information Sciences, 2019, 471: 115-131.
 SHOR P W. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer[J]. SIAM Journal of Computing, 1997, 26(5): 1484-1509.
 El BANSARKHANI R, BUCHMANN J. Towards lattice based aggregate signatures[C]//LNCS 8469: Proceedings of the 7th International Conference on Cryptology in Africa, Marrakesh, May 28-30, 2014. Cham: Springer, 2014: 336-355.
 ZHANG Y H, HU Y P, JIANG M M, et al. Lattice-based sequential aggregate signatures with lazy verification[J]. The Journal of China Universities of Posts and Telecommunications, 2015, 22(6): 36-44.
 LU X, YIN W, WEN Q, et al. A lattice-based unordered agg-regate signature scheme based on the intersection method[J]. IEEE Access, 2018, 6: 33986-33994.
 WANG Z P, WU Q H. A practical lattice-based sequential aggregate signature[C]//LNCS 11821: Proceedings of the 13th International Conference on Provable Security, Cairns, Oct 1-4, 2019. Cham: Springer, 2019: 94-109.
 GENTRY C, PEIKERT C, VAIKUNTANATHAN V. Trapdoors for hard lattices and new cryptographic constructions[C]//Proceedings of the 40th Annual ACM Symposium on Theory of Computing, Victoria, May 17-20, 2008. New York: ACM, 2008: 197-206.
 AGRAWAL S, BONEH D, BOYEN X. Lattice basis delegation in fixed dimension and shorter-ciphertext hierarchical IBE[C]//LNCS 6223: Proceedings of the 30th Annual Cryptology Conference, Santa Barbara, Aug 15-19, 2010. Berlin, Heidelberg: Springer, 2010: 98-115.
 ALWENY J, PEIKERTZ C. Generating shorter bases for hard random lattices[J]. Theory of Computing Systems, 2011, 48(3): 535-553.
 BOYEN X. Lattice mixing and vanishing trapdoors: a framework for fully secure short signature and more[C]//LNCS 6056: Proceedings of the 13th International Conference on Practice and Theory in Public Key Cryptography, Paris, May 26-28, 2010. Berlin, Heidelberg: Springer, 2010: 499-517.
 MICCIANCIO D, REGEV O. Worst-case to average-case reductions based on Gaussian measures[J]. SIAM Journal on Computing, 2007, 37(1): 267-302.
 EBRI N A, BEAK J, SHOUFAN A. Forward-secure identity-based signature: new generic constructions and their applications[J]. Journal of Wireless Mobile Networks, Ubiquitous Computing, and Dependable Applications, 2013, 4(1): 32-54.
 NEVEN G. Efficient sequential aggregate signed data[C]//LNCS 4965: Proceedings of the 27th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Istanbul, Apr 13-17, 2008. Berlin, Heidelberg: Springer, 2008: 52-69.
 STEHLé D, STEINFELD R. Making NTRU as secure as worst-case problems over ideal lattices[C]//LNCS 6632: Proceedings of the 30th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tallinn, May 15-19, 2011. Berlin, Heidelberg: Springer, 2011: 27-47.