{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,20]],"date-time":"2025-12-20T22:18:31Z","timestamp":1766269111236,"version":"build-2065373602"},"reference-count":47,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2022,3,16]],"date-time":"2022-03-16T00:00:00Z","timestamp":1647388800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,3,16]],"date-time":"2022-03-16T00:00:00Z","timestamp":1647388800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Sci. China Inf. Sci."],"published-print":{"date-parts":[[2022,5]]},"DOI":"10.1007\/s11432-020-3226-6","type":"journal-article","created":{"date-parts":[[2022,3,22]],"date-time":"2022-03-22T02:03:42Z","timestamp":1647914622000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Lattice-based group encryptions with only one trapdoor"],"prefix":"10.1007","volume":"65","author":[{"given":"Jing","family":"Pan","sequence":"first","affiliation":[]},{"given":"Jiang","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Fangguo","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Xiaofeng","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Willy","family":"Susilo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,3,16]]},"reference":[{"key":"3226_CR1","doi-asserted-by":"crossref","unstructured":"Kiayias A, Tsiounis Y, Yung M. Group encryption. In: Proceedings of International Conference on the Theory and Application of Cryptology and Information Security, Kuching, 2007. 181\u2013199","DOI":"10.1007\/978-3-540-76900-2_11"},{"key":"3226_CR2","doi-asserted-by":"crossref","unstructured":"Chaum D, Heyst E V. Group signatures. In: Proceedings of Workshop on the Theory and Application of of Cryptographic Techniques, Brighton, 1991. 257\u2013265","DOI":"10.1007\/3-540-46416-6_22"},{"key":"3226_CR3","doi-asserted-by":"crossref","unstructured":"Trolin M, Wikstr\u00f6m D. Hierarchical group signatures. In: Proceedings of International Colloquium on Automata, Languages, and Programming, Lisbon, 2005. 446\u2013458","DOI":"10.1007\/11523468_37"},{"key":"3226_CR4","doi-asserted-by":"crossref","unstructured":"Libert B, Ling S, Mouhartem M, et al. Zero-knowledge arguments for matrix-vector relations and lattice-based group encryption. In: Proceedings of International Conference on the Theory and Application of Cryptology and Information Security, Hanoi, 2016. 101\u2013131","DOI":"10.1007\/978-3-662-53890-6_4"},{"key":"3226_CR5","doi-asserted-by":"crossref","unstructured":"Regev O. On lattices, learning with errors, random linear codes, and cryptography. In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing, Baltimore, 2005. 84\u201393","DOI":"10.1145\/1060590.1060603"},{"key":"3226_CR6","doi-asserted-by":"crossref","unstructured":"Ajtai M. Generating hard instances of the short basis problem. In: Proceedings of International Colloquium on Automata, Languages, and Programming, Prague, 1999. 1\u20139","DOI":"10.1007\/3-540-48523-6_1"},{"key":"3226_CR7","doi-asserted-by":"crossref","unstructured":"Libert B, Ling S, Mouhartem M, et al. Signature schemes with efficient protocols and dynamic group signatures from lattice assumptions. In: Proceedings of International Conference on the Theory and Application of Cryptology and Information Security, Hanoi, 2016. 373\u2013403","DOI":"10.1007\/978-3-662-53890-6_13"},{"key":"3226_CR8","doi-asserted-by":"crossref","unstructured":"Lyubashevsky V. Lattice signatures without trapdoors. In: Proceedings of Annual International Conference on the Theory and Applications of Cryptographic Techniques, Cambridge, 2012. 738\u2013755","DOI":"10.1007\/978-3-642-29011-4_43"},{"key":"3226_CR9","doi-asserted-by":"crossref","unstructured":"Gentry C, Peikert C, Vaikuntanathan V. Trapdoors for hard lattices and new cryptographic constructions. In: Proceedings of the 40th Annual ACM Symposium on Theory of Computing, Victoria, 2008. 197\u2013206","DOI":"10.1145\/1374376.1374407"},{"key":"3226_CR10","doi-asserted-by":"crossref","unstructured":"Micciancio D, Peikert C. Trapdoors for lattices: simpler, tighter, faster, smaller. In: Proceedings of Annual International Conference on the Theory and Applications of Cryptographic Techniques, Cambridge, 2012. 700\u2013718","DOI":"10.1007\/978-3-642-29011-4_41"},{"key":"3226_CR11","doi-asserted-by":"publisher","first-page":"182101","DOI":"10.1007\/s11432-019-9861-3","volume":"63","author":"J Zhang","year":"2020","unstructured":"Zhang J, Yu Y, Fan S Q, et al. Improved lattice-based CCA2-secure PKE in the standard model. Sci China Inf Sci, 2020, 63: 182101","journal-title":"Sci China Inf Sci"},{"key":"3226_CR12","unstructured":"Alwen J, Peikert C. Generating shorter bases for hard random lattices. In: Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science, Freiburg, 2009. 75\u201386"},{"key":"3226_CR13","doi-asserted-by":"crossref","unstructured":"Libert B, Ling S, Nguyen K, et al. Zero-knowledge arguments for lattice-based accumulators: logarithmic-size ring signatures and group signatures without trapdoors. In: Proceedings of Annual International Conference on the Theory and Applications of Cryptographic Techniques, Vienna, 2016. 1\u201331","DOI":"10.1007\/978-3-662-49896-5_1"},{"key":"3226_CR14","doi-asserted-by":"crossref","unstructured":"Ling S, Nguyen K, Wang H X, et al. Lattice-based group signatures: achieving full dynamicity with ease. In: Proceedings of International Conference on Applied Cryptography and Network Security, Kanazawa, 2017. 293\u2013312","DOI":"10.1007\/978-3-319-61204-1_15"},{"key":"3226_CR15","doi-asserted-by":"crossref","unstructured":"Cash D, Hofheinz D, Kiltz E, et al. Bonsai trees, or how to delegate a lattice basis. In: Proceedings of Annual International Conference on the Theory and Applications of Cryptographic Techniques, Monaco, 2010. 523\u2013552","DOI":"10.1007\/978-3-642-13190-5_27"},{"key":"3226_CR16","doi-asserted-by":"crossref","unstructured":"Camenisch J, Lysyanskaya A. A signature scheme with efficient protocols. In: Proceedings of International Conference on Security in Communication Networks, Amalfi, 2002. 268\u2013289","DOI":"10.1007\/3-540-36413-7_20"},{"key":"3226_CR17","doi-asserted-by":"crossref","unstructured":"Paillier P. Public-key cryptosystems based on composite degree residuosity classes. In: Proceedings of International Conference on the Theory and Application of Cryptographic Techniques, Prague, 1999. 223\u2013238","DOI":"10.1007\/3-540-48910-X_16"},{"key":"3226_CR18","doi-asserted-by":"crossref","unstructured":"Cathalo J, Libert B, Yung M. Group encryption: non-interactive realization in the standard model. In: Proceedings of International Conference on the Theory and Application of Cryptology and Information Security, Tokyo, 2009. 179\u2013196","DOI":"10.1007\/978-3-642-10366-7_11"},{"key":"3226_CR19","doi-asserted-by":"crossref","unstructured":"Aimani L E, Joye M. Toward practical group encryption. In: Proceedings of the 11th International Conference on Applied Cryptography and Network Security, Banff, 2013. 237\u2013252","DOI":"10.1007\/978-3-642-38980-1_15"},{"key":"3226_CR20","doi-asserted-by":"crossref","unstructured":"Libert B, Yung M, Joye M, et al. Traceable group encryption. In: Proceedings of International Workshop on Public Key Cryptography, Buenos Aires, 2014. 592\u2013610","DOI":"10.1007\/978-3-642-54631-0_34"},{"key":"3226_CR21","doi-asserted-by":"crossref","unstructured":"Kiayias A, Tsiounis Y, Yung M. Traceable signatures. In: Proceedings of the 23rd Annual Eurocrypt Conference, Interlaken, 2004. 571\u2013589","DOI":"10.1007\/978-3-540-24676-3_34"},{"key":"3226_CR22","doi-asserted-by":"crossref","unstructured":"Izabach\u00e8ne M, Pointcheval D, Vergnaud D. Mediated traceable anonymous encryption. In: Proceedings of the 1st International Conference on Cryptology and Information Security in Latin America, Puebla, 2010. 40\u201360","DOI":"10.1007\/978-3-642-14712-8_3"},{"key":"3226_CR23","doi-asserted-by":"crossref","unstructured":"Naor M, Yung M. Public-key cryptosystems provably secure against chosen ciphertext attacks. In: Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, Baltimore, 1990. 427\u2013437","DOI":"10.1145\/100216.100273"},{"key":"3226_CR24","doi-asserted-by":"crossref","unstructured":"Micciancio D, Peikert C. Hardness of SIS and LWE with small parameters. In: Proceedings of Annual Cryptology Conference, Santa Barbara, 2013. 21\u201339","DOI":"10.1007\/978-3-642-40041-4_2"},{"key":"3226_CR25","doi-asserted-by":"crossref","unstructured":"Brakerski Z, Langlois A, Peikert C, et al. Classical hardness of learning with errors. In: Proceedings of A Symposium on Theory of Computing Conference, Palo Alto, 2013. 575\u2013584","DOI":"10.1145\/2488608.2488680"},{"key":"3226_CR26","doi-asserted-by":"crossref","unstructured":"Peikert C. Public-key cryptosystems from the worst-case shortest vector problem: extended abstract. In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing, Bethesda, 2009. 333\u2013342","DOI":"10.1145\/1536414.1536461"},{"key":"3226_CR27","doi-asserted-by":"crossref","unstructured":"Baric N, Pfitzmann B. Collision-free accumulators and fail-stop signature schemes without trees. In: Proceedings of International Conference on the Theory and Applications of Cryptographic Techniques, Konstanz, 1997. 480\u2013494","DOI":"10.1007\/3-540-69053-0_33"},{"key":"3226_CR28","doi-asserted-by":"crossref","unstructured":"Camenisch J, Lysyanskaya A. Dynamic accumulators and application to efficient revocation of anonymous credentials. In: Proceedings of the 22nd Annual International Cryptology Conference, Santa Barbara, 2002. 61\u201376","DOI":"10.1007\/3-540-45708-9_5"},{"key":"3226_CR29","doi-asserted-by":"crossref","unstructured":"Nguyen N. Accumulators from bilinear pairings and applications. In: Proceedings of Cryptographers\u2019 Track at the RSA Conference, San Francisco, 2005. 275\u2013292","DOI":"10.1007\/978-3-540-30574-3_19"},{"key":"3226_CR30","doi-asserted-by":"crossref","unstructured":"Tsudik G, Xu S H. Accumulating composites and improved group signing. In: Proceedings of International Conference on the Theory and Application of Cryptology and Information Security, Taipei, 2003. 265\u2013286","DOI":"10.1007\/978-3-540-40061-5_16"},{"key":"3226_CR31","doi-asserted-by":"publisher","first-page":"1757","DOI":"10.1109\/18.556672","volume":"42","author":"J Stern","year":"1996","unstructured":"Stern J. A new paradigm for public key identification. IEEE Trans Inform Theory, 1996, 42: 1757\u20131768","journal-title":"IEEE Trans Inform Theory"},{"key":"3226_CR32","doi-asserted-by":"crossref","unstructured":"Benhamouda F, Camenisch J, Krenn S, et al. Better zero-knowledge proofs for lattice encryption and their application to group signatures. In: Proceedings of International Conference on the Theory and Application of Cryptology and Information Security, Kaoshiung, 2014. 551\u2013572","DOI":"10.1007\/978-3-662-45611-8_29"},{"key":"3226_CR33","doi-asserted-by":"crossref","unstructured":"Jain A, Krenn S, Pietrzak K, et al. Commitments and efficient zero-knowledge proofs from learning parity with noise. In: Proceedings of International Conference on the Theory and Application of Cryptology and Information Security, Beijing, 2012. 663\u2013680","DOI":"10.1007\/978-3-642-34961-4_40"},{"key":"3226_CR34","doi-asserted-by":"crossref","unstructured":"Langlois A, Ling S, Nguyen K, et al. Lattice-based group signature scheme with verifier-local revocation. In: Proceedings of International Workshop on Public Key Cryptography, Buenos Aires, 2014. 345\u2013361","DOI":"10.1007\/978-3-642-54631-0_20"},{"key":"3226_CR35","doi-asserted-by":"crossref","unstructured":"Ling S, Nguyen K, Stehl\u00e9 D, et al. Improved zero-knowledge proofs of knowledge for the ISIS problem, and applications. In: Proceedings of International Workshop on Public Key Cryptography, Nara, 2013. 107\u2013124","DOI":"10.1007\/978-3-642-36362-7_8"},{"key":"3226_CR36","doi-asserted-by":"crossref","unstructured":"Ling S, Nguyen K, Wang H X. Group signatures from lattices: simpler, tighter, shorter, ring-based. In: Proceedings of IACR International Workshop on Public Key Cryptography, Gaithersburg, 2015. 427\u2013449","DOI":"10.1007\/978-3-662-46447-2_19"},{"key":"3226_CR37","doi-asserted-by":"crossref","unstructured":"Kawachi A, Tanaka K, Xagawa K. Concurrently secure identification schemes based on the worst-case hardness of lattice problems. In: Proceedings of the 14th International Conference on the Theory and Application of Cryptology and Information Security, Melbourne, 2008. 372\u2013389","DOI":"10.1007\/978-3-540-89255-7_23"},{"key":"3226_CR38","doi-asserted-by":"crossref","unstructured":"Agrawal S, Boneh D, Boyen X. Efficient lattice (H)IBE in the standard model. In: Proceedings of the 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Monaco, 2010. 553\u2013572","DOI":"10.1007\/978-3-642-13190-5_28"},{"key":"3226_CR39","doi-asserted-by":"crossref","unstructured":"Yang R P, Au M H, Zhang Z F, et al. Efficient lattice-based zero-knowledge arguments with standard soundness: construction and applications. In: Proceedings of Annual International Cryptology Conference, 2019. 147\u2013175","DOI":"10.1007\/978-3-030-26948-7_6"},{"key":"3226_CR40","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1515\/jmc-2015-0016","volume":"9","author":"M R Albrecht","year":"2015","unstructured":"Albrecht M R, Player R, Scott S. On the concrete hardness of Learning with Errors. J Math Cryptology, 2015, 9: 169\u2013203","journal-title":"J Math Cryptology"},{"key":"3226_CR41","unstructured":"Kosba A E, Zhao Z C, Miller A, et al. C\u00f8C\u00f8: a framework for building composable zero-knowledge proofs. Cryptology ePrint Archive, Report 2015\/1093, 2005"},{"key":"3226_CR42","unstructured":"Alkim E, Ducas L, P\u00f6ppelmann T, et al. Post-quantum key exchange \u2014 a new hope. In: Proceedings of the 25th USENIX Security Symposium, Austin, 2016. 327\u2013343"},{"key":"3226_CR43","doi-asserted-by":"crossref","unstructured":"Albrecht M R, Curtis R R, Deo A, et al. Estimate all the {LWE, NTRU} schemes! In: Proceedings of International Conference on Security and Cryptography for Networks, Amalfi, 2018. 351\u2013367","DOI":"10.1007\/978-3-319-98113-0_19"},{"key":"3226_CR44","doi-asserted-by":"crossref","unstructured":"Chen Y M, Nguyen P Q. BKZ 2.0: better lattice security estimates. In: Proceedings of International Conference on the Theory and Application of Cryptology and Information Security, Seoul, 2011. 1\u201320","DOI":"10.1007\/978-3-642-25385-0_1"},{"key":"3226_CR45","doi-asserted-by":"publisher","first-page":"032115","DOI":"10.1007\/s11432-017-9307-0","volume":"61","author":"Z X Zheng","year":"2018","unstructured":"Zheng Z X, Wang X Y, Xu G W, et al. Orthogonalized lattice enumeration for solving SVP. Sci China Inf Sci, 2018, 61: 032115","journal-title":"Sci China Inf Sci"},{"key":"3226_CR46","unstructured":"Sahai A. Non-malleable non-interactive zero knowledge and adaptive chosen-ciphertext security. In: Proceedings of the 40th Annual Symposium on Foundations of Computer Science, New York, 1999. 543\u2013553"},{"key":"3226_CR47","doi-asserted-by":"crossref","unstructured":"Damg\u00e5rd I. Efficient concurrent zero-knowledge in the auxiliary string model. In: Proceedings of International Conference on the Theory and Applications of Cryptographic Techniques, Bruges, 2000. 418\u2013430","DOI":"10.1007\/3-540-45539-6_30"}],"container-title":["Science China Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-020-3226-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11432-020-3226-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-020-3226-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,4]],"date-time":"2023-06-04T20:24:13Z","timestamp":1685910253000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11432-020-3226-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,16]]},"references-count":47,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2022,5]]}},"alternative-id":["3226"],"URL":"https:\/\/doi.org\/10.1007\/s11432-020-3226-6","relation":{},"ISSN":["1674-733X","1869-1919"],"issn-type":[{"type":"print","value":"1674-733X"},{"type":"electronic","value":"1869-1919"}],"subject":[],"published":{"date-parts":[[2022,3,16]]},"assertion":[{"value":"24 October 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 December 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 March 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 March 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"152304"}}