[1]Steinfeld R, Bull L, Zheng Y. Content extraction signatures[C] Proc of the 5th Int Conf on Information Security and Cryptology. Berlin: Springer, 2002: 285304[2]蓝才会, 王彩芬. 基于身份的可截取签名方案[J]. 计算机应用, 2007, 27(10): 24562458[3]Yin Xinchun, Ye Shuyin, Ou Funa, et al. A new IDbased content extraction signatures[C] Proc of the 2nd Int Conf on Computational Intelligence and Software Engineering. Piscataway, NJ: IEEE, 2009: 14[4]何启芝, 曹素珍, 王彩芬, 等. 基于身份的可审计多重截取签名方[J]. 计算机工程与科学, 2023, 5(2): 269276[5]Goldreich O, Goldwasser S, Halevi S. Publickey cryptosystems from lattice reduction problems[C] Proc of the 17th Annual Int Cryptology Conf. Berlin: Springer, 1997: 112131[6]NIST. NIST announces first four quantumresistant cryptographic algorithms[EBOL]. National Institute of Standards and Technology, 2022[20240105]. https:www.nist.govnewseventsnews202207nistannouncesfirstfourquantumresistantcryptographicalgorithms[7]赵勇, 杨少军, 张福泰, 等. 基于格的可截取签名方案[J]. 密码学报, 2022, 9(4): 767778[8]Shamir A. Identitybased cryptosystems and signature schemes[C] Proc of the 4th Annual Int Cryptology Conf. Berlin: Springer, 1985: 4753[9]Boneh D, Franklin M. Identitybased encryption from the Weil pairing[C] Proc of the 21st Annual Int Cryptology Conf. Berlin: Springer, 2001: 213229[10]Rückert M. Strongly unforgeable signatures and hierarchical identitybased signatures from lattices without random oracles[C] Proc of the 3rd Int Conf on PostQuantum Cryptography. Berlin: Springer, 2010: 182200[11]杨丹婷, 许春根, 徐磊, 等. 理想格上基于身份的签名方案[J]. 密码学报, 2015, 2(4): 306316[12]Yang Zhichao, Duong D H, Willy S, et al. Hierarchical identitybased signature in polynomial rings [J]. The Computer Journal, 2020, 63(10): 14901499[13]Lyubashevsky V, Micciancio D. Generalized compact knapsacks are collision resistant[C] Proc of the 33rd Int Colloquium on Automata, Languages, and Programming. Berlin: Springer, 2006: 144155[14]Peikert C, Rosen A. Efficient collisionresistant hashing from worstcase assumptions on cyclic lattices[C] Proc of the 3rd Conf on Theory of Cryptography. Berlin: Springer, 2006: 145166[15]Gentry C, Peikert C, Vaikuntanathan V. Trapdoors for hard lattices and new cryptographic constructions[C] Proc of the 40th Annual ACM Symp on Theory of Computing. New York: ACM, 2008: 197206[16]Micciancio D, Peikert C. Trapdoors for lattices: Simpler, tighter, faster, smaller[C] Proc of the 31st Annual Int Conf on the Theory and Applications of Cryptographic Techniques. Berlin: Springer, 2012: 700718[17]Lai R W F, Cheung H K F, Chow S S M. Trapdoors for ideal lattices with applications[C] Proc of the 10th Int Conf on Information Security and Cryptology. Berlin: Springer, 2014: 239256[18]Regev O. On lattices, learning with errors, random linear codes, and cryptography[J]. Journal of the ACM, 2009, 56(6): 140[19]Bellare M, Neven G. Multisignatures in the plain publickey model and a general forking lemma[C] Proc of the 13th ACM Conf on Computer and Communications Security. New York: ACM, 2006: 390399 |