{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T12:58:22Z","timestamp":1772283502555,"version":"3.50.1"},"publisher-location":"Cham","reference-count":57,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030255091","type":"print"},{"value":"9783030255107","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-25510-7_3","type":"book-chapter","created":{"date-parts":[[2019,7,13]],"date-time":"2019-07-13T07:02:33Z","timestamp":1563001353000},"page":"44-64","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":21,"title":["Forward-Secure Group Signatures from Lattices"],"prefix":"10.1007","author":[{"given":"San","family":"Ling","sequence":"first","affiliation":[]},{"given":"Khoa","family":"Nguyen","sequence":"additional","affiliation":[]},{"given":"Huaxiong","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Yanhong","family":"Xu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,7,14]]},"reference":[{"key":"3_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1007\/3-540-44448-3_10","volume-title":"Advances in Cryptology \u2014 ASIACRYPT 2000","author":"M Abdalla","year":"2000","unstructured":"Abdalla, M., Reyzin, L.: A new forward-secure digital signature scheme. In: Okamoto, T. (ed.) ASIACRYPT 2000. LNCS, vol. 1976, pp. 116\u2013129. Springer, Heidelberg (2000). \n                      https:\/\/doi.org\/10.1007\/3-540-44448-3_10"},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"Ajtai, M.: Generating Hard Instances of Lattice Problems (Extended Abstract). In: STOC 1996, pp. 99\u2013108. ACM (1996)","DOI":"10.1145\/237814.237838"},{"key":"3_CR3","unstructured":"Alwen, J., Peikert, C.: Generating shorter bases for hard random lattices. In: STACS 2009, pp. 75\u201386 (2009)"},{"key":"3_CR4","unstructured":"Anderson, R.: Two remarks on public key cryptology. Technical report, University of Cambridge, Computer Laboratory (2002)"},{"key":"3_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1007\/978-3-642-03356-8_35","volume-title":"Advances in Cryptology - CRYPTO 2009","author":"B Applebaum","year":"2009","unstructured":"Applebaum, B., Cash, D., Peikert, C., Sahai, A.: Fast cryptographic primitives and circular-secure encryption based on hard learning problems. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol. 5677, pp. 595\u2013618. Springer, Heidelberg (2009). \n                      https:\/\/doi.org\/10.1007\/978-3-642-03356-8_35"},{"key":"3_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"614","DOI":"10.1007\/3-540-39200-9_38","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2003","author":"M Bellare","year":"2003","unstructured":"Bellare, M., Micciancio, D., Warinschi, B.: Foundations of group signatures: formal definitions, simplified requirements, and a construction based on general assumptions. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol. 2656, pp. 614\u2013629. Springer, Heidelberg (2003). \n                      https:\/\/doi.org\/10.1007\/3-540-39200-9_38"},{"key":"3_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1007\/3-540-48405-1_28","volume-title":"Advances in Cryptology \u2014 CRYPTO 99","author":"M Bellare","year":"1999","unstructured":"Bellare, M., Miner, S.K.: A forward-secure digital signature scheme. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 431\u2013448. Springer, Heidelberg (1999). \n                      https:\/\/doi.org\/10.1007\/3-540-48405-1_28"},{"key":"3_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1007\/978-3-540-30574-3_11","volume-title":"Topics in Cryptology \u2013 CT-RSA 2005","author":"M Bellare","year":"2005","unstructured":"Bellare, M., Shi, H., Zhang, C.: Foundations of group signatures: the case of dynamic groups. In: Menezes, A. (ed.) CT-RSA 2005. LNCS, vol. 3376, pp. 136\u2013153. Springer, Heidelberg (2005). \n                      https:\/\/doi.org\/10.1007\/978-3-540-30574-3_11"},{"key":"3_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1007\/11426639_26","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2005","author":"D Boneh","year":"2005","unstructured":"Boneh, D., Boyen, X., Goh, E.-J.: Hierarchical identity based encryption with constant size ciphertext. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol. 3494, pp. 440\u2013456. Springer, Heidelberg (2005). \n                      https:\/\/doi.org\/10.1007\/11426639_26"},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"Boneh, D., Shacham, H.: Group signatures with verifier-local revocation. In: ACM-CCS 2004, pp. 168\u2013177. ACM (2004)","DOI":"10.1145\/1030083.1030106"},{"key":"3_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/978-3-319-93387-0_9","volume-title":"Applied Cryptography and Network Security","author":"C Boschini","year":"2018","unstructured":"Boschini, C., Camenisch, J., Neven, G.: Floppy-sized group signatures from lattices. In: Preneel, B., Vercauteren, F. (eds.) ACNS 2018. LNCS, vol. 10892, pp. 163\u2013182. Springer, Cham (2018). \n                      https:\/\/doi.org\/10.1007\/978-3-319-93387-0_9"},{"key":"3_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1007\/978-3-642-13013-7_29","volume-title":"Public Key Cryptography \u2013 PKC 2010","author":"X Boyen","year":"2010","unstructured":"Boyen, X.: Lattice mixing and vanishing trapdoors: a framework for fully secure short signatures and more. In: Nguyen, P.Q., Pointcheval, D. (eds.) PKC 2010. LNCS, vol. 6056, pp. 499\u2013517. Springer, Heidelberg (2010). \n                      https:\/\/doi.org\/10.1007\/978-3-642-13013-7_29"},{"key":"3_CR13","doi-asserted-by":"crossref","unstructured":"Boyen, X., Shacham, H., Shen, E., Waters, B.: Forward-secure signatures with untrusted update. In: ACM-CCS 2006, pp. 191\u2013200. ACM (2006)","DOI":"10.1145\/1180405.1180430"},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"Brakerski, Z., Gentry, C., Vaikuntanathan, V.: (Leveled) fully homomorphic encryption without bootstrapping. In: ITCS 2012, pp. 309\u2013325. ACM (2012)","DOI":"10.1145\/2090236.2090262"},{"key":"3_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/978-3-642-32928-9_4","volume-title":"Security and Cryptography for Networks","author":"J Camenisch","year":"2012","unstructured":"Camenisch, J., Neven, G., R\u00fcckert, M.: Fully anonymous attribute tokens from lattices. In: Visconti, I., De Prisco, R. (eds.) SCN 2012. LNCS, vol. 7485, pp. 57\u201375. Springer, Heidelberg (2012). \n                      https:\/\/doi.org\/10.1007\/978-3-642-32928-9_4"},{"key":"3_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/3-540-39200-9_16","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2003","author":"R Canetti","year":"2003","unstructured":"Canetti, R., Halevi, S., Katz, J.: A forward-secure public-key encryption scheme. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol. 2656, pp. 255\u2013271. Springer, Heidelberg (2003). \n                      https:\/\/doi.org\/10.1007\/3-540-39200-9_16"},{"key":"3_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/978-3-540-24676-3_13","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"R Canetti","year":"2004","unstructured":"Canetti, R., Halevi, S., Katz, J.: Chosen-ciphertext security from identity-based encryption. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 207\u2013222. Springer, Heidelberg (2004). \n                      https:\/\/doi.org\/10.1007\/978-3-540-24676-3_13"},{"key":"3_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1007\/978-3-642-13190-5_27","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"D Cash","year":"2010","unstructured":"Cash, D., Hofheinz, D., Kiltz, E., Peikert, C.: Bonsai trees, or how to delegate a lattice basis. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 523\u2013552. Springer, Heidelberg (2010). \n                      https:\/\/doi.org\/10.1007\/978-3-642-13190-5_27"},{"key":"3_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/3-540-46416-6_22","volume-title":"Advances in Cryptology \u2014 EUROCRYPT","author":"D Chaum","year":"1991","unstructured":"Chaum, D., van Heyst, E.: Group signatures. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol. 547, pp. 257\u2013265. Springer, Heidelberg (1991). \n                      https:\/\/doi.org\/10.1007\/3-540-46416-6_22"},{"issue":"1","key":"3_CR20","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/s10623-015-0126-y","volume":"81","author":"Shantian Cheng","year":"2015","unstructured":"Cheng, S., Nguyen, K., Wang, H.: Policy-based signature scheme from lattices. Des. Codes Cryptography 81(1), 43\u201374 (2016)","journal-title":"Designs, Codes and Cryptography"},{"key":"3_CR21","doi-asserted-by":"crossref","unstructured":"del Pino, R., Lyubashevsky, V., Seiler, G.: Lattice-based group signatures and zero-knowledge proofs of automorphism stability. In: ACM-CCS 2018, pp. 574\u2013591. ACM (2018)","DOI":"10.1145\/3243734.3243852"},{"key":"3_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/3-540-46035-7_5","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2002","author":"Y Dodis","year":"2002","unstructured":"Dodis, Y., Katz, J., Xu, S., Yung, M.: Key-insulated public key cryptosystems. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol. 2332, pp. 65\u201382. Springer, Heidelberg (2002). \n                      https:\/\/doi.org\/10.1007\/3-540-46035-7_5"},{"key":"3_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/3-540-47721-7_12","volume-title":"Advances in Cryptology","author":"A Fiat","year":"1987","unstructured":"Fiat, A., Shamir, A.: How To prove yourself: practical solutions to identification and signature problems. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 186\u2013194. Springer, Heidelberg (1987). \n                      https:\/\/doi.org\/10.1007\/3-540-47721-7_12"},{"key":"3_CR24","doi-asserted-by":"crossref","unstructured":"Gentry, C., Peikert, C., Vaikuntanathan, V.: How to use a short basis: trapdoors for hard lattices and new cryptographic constructions. In: STOC 2008, pp. 197\u2013206. ACM (2008)","DOI":"10.1145\/1374376.1374407"},{"key":"3_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/978-3-642-17373-8_23","volume-title":"Advances in Cryptology - ASIACRYPT 2010","author":"SD Gordon","year":"2010","unstructured":"Gordon, S.D., Katz, J., Vaikuntanathan, V.: A group signature scheme from lattice assumptions. In: Abe, M. (ed.) ASIACRYPT 2010. LNCS, vol. 6477, pp. 395\u2013412. Springer, Heidelberg (2010). \n                      https:\/\/doi.org\/10.1007\/978-3-642-17373-8_23"},{"key":"3_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1007\/3-540-44647-8_20","volume-title":"Advances in Cryptology \u2014 CRYPTO 2001","author":"G Itkis","year":"2001","unstructured":"Itkis, G., Reyzin, L.: Forward-secure signatures with optimal signing and verifying. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 332\u2013354. Springer, Heidelberg (2001). \n                      https:\/\/doi.org\/10.1007\/3-540-44647-8_20"},{"key":"3_CR27","unstructured":"Kansal, M., Dutta, R., Mukhopadhyay, S.: Forward Secure Efficient Group Signature in Dynamic Setting using Lattices. IACR Cryptology ePrint Archive, 2017:1128. \n                      https:\/\/eprint.iacr.org\/2017\/1128"},{"key":"3_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1007\/978-3-540-89255-7_23","volume-title":"Advances in Cryptology - ASIACRYPT 2008","author":"A Kawachi","year":"2008","unstructured":"Kawachi, A., Tanaka, K., Xagawa, K.: Concurrently secure identification schemes based on the worst-case hardness of lattice problems. In: Pieprzyk, J. (ed.) ASIACRYPT 2008. LNCS, vol. 5350, pp. 372\u2013389. Springer, Heidelberg (2008). \n                      https:\/\/doi.org\/10.1007\/978-3-540-89255-7_23"},{"key":"3_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1007\/978-3-540-24676-3_34","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"A Kiayias","year":"2004","unstructured":"Kiayias, A., Tsiounis, Y., Yung, M.: Traceable signatures. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 571\u2013589. Springer, Heidelberg (2004). \n                      https:\/\/doi.org\/10.1007\/978-3-540-24676-3_34"},{"issue":"1\/2","key":"3_CR30","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1504\/IJSN.2006.010821","volume":"1","author":"Aggelos Kiayias","year":"2006","unstructured":"Kiayias, A., Yung, M.: Secure scalable group signature with dynamic joins and separable authorities. IJSN 1(1), 24\u201345 (2006)","journal-title":"International Journal of Security and Networks"},{"key":"3_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/978-3-642-42045-0_3","volume-title":"Advances in Cryptology - ASIACRYPT 2013","author":"F Laguillaumie","year":"2013","unstructured":"Laguillaumie, F., Langlois, A., Libert, B., Stehl\u00e9, D.: Lattice-based group signatures with logarithmic signature size. In: Sako, K., Sarkar, P. (eds.) ASIACRYPT 2013. LNCS, vol. 8270, pp. 41\u201361. Springer, Heidelberg (2013). \n                      https:\/\/doi.org\/10.1007\/978-3-642-42045-0_3"},{"key":"3_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/978-3-642-54631-0_20","volume-title":"Public-Key Cryptography \u2013 PKC 2014","author":"A Langlois","year":"2014","unstructured":"Langlois, A., Ling, S., Nguyen, K., Wang, H.: Lattice-based group signature scheme with verifier-local revocation. In: Krawczyk, H. (ed.) PKC 2014. LNCS, vol. 8383, pp. 345\u2013361. Springer, Heidelberg (2014). \n                      https:\/\/doi.org\/10.1007\/978-3-642-54631-0_20\n                      \n                    . \n                      http:\/\/eprint.iacr.org\/2014\/033"},{"key":"3_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/978-3-662-53890-6_13","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2016","author":"B Libert","year":"2016","unstructured":"Libert, B., Ling, S., Mouhartem, F., Nguyen, K., Wang, H.: Signature schemes with efficient protocols and dynamic group signatures from lattice assumptions. In: Cheon, J.H., Takagi, T. (eds.) ASIACRYPT 2016. LNCS, vol. 10032, pp. 373\u2013403. Springer, Heidelberg (2016). \n                      https:\/\/doi.org\/10.1007\/978-3-662-53890-6_13"},{"key":"3_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/978-3-662-53890-6_4","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2016","author":"B Libert","year":"2016","unstructured":"Libert, B., Ling, S., Mouhartem, F., Nguyen, K., Wang, H.: Zero-knowledge arguments for matrix-vector relations and lattice-based group encryption. In: Cheon, J.H., Takagi, T. (eds.) ASIACRYPT 2016. LNCS, vol. 10032, pp. 101\u2013131. Springer, Heidelberg (2016). \n                      https:\/\/doi.org\/10.1007\/978-3-662-53890-6_4"},{"key":"3_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1007\/978-3-319-70694-8_19","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2017","author":"B Libert","year":"2017","unstructured":"Libert, B., Ling, S., Mouhartem, F., Nguyen, K., Wang, H.: Adaptive oblivious transfer with access control from lattice assumptions. In: Takagi, T., Peyrin, T. (eds.) ASIACRYPT 2017. LNCS, vol. 10624, pp. 533\u2013563. Springer, Cham (2017). \n                      https:\/\/doi.org\/10.1007\/978-3-319-70694-8_19"},{"key":"3_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-662-49896-5_1","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2016","author":"B Libert","year":"2016","unstructured":"Libert, B., Ling, S., Nguyen, K., Wang, H.: Zero-knowledge arguments for lattice-based accumulators: logarithmic-size ring signatures and group signatures without trapdoors. In: Fischlin, M., Coron, J.-S. (eds.) EUROCRYPT 2016. LNCS, vol. 9666, pp. 1\u201331. Springer, Heidelberg (2016). \n                      https:\/\/doi.org\/10.1007\/978-3-662-49896-5_1"},{"key":"3_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1007\/978-3-319-70700-6_11","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2017","author":"B Libert","year":"2017","unstructured":"Libert, B., Ling, S., Nguyen, K., Wang, H.: Zero-knowledge arguments for lattice-based PRFs and applications to e-cash. In: Takagi, T., Peyrin, T. (eds.) ASIACRYPT 2017. LNCS, vol. 10626, pp. 304\u2013335. Springer, Cham (2017). \n                      https:\/\/doi.org\/10.1007\/978-3-319-70700-6_11"},{"key":"3_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"700","DOI":"10.1007\/978-3-319-96881-0_24","volume-title":"Advances in Cryptology \u2013 CRYPTO 2018","author":"B Libert","year":"2018","unstructured":"Libert, B., Ling, S., Nguyen, K., Wang, H.: Lattice-based zero-knowledge arguments for integer relations. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018. LNCS, vol. 10992, pp. 700\u2013732. Springer, Cham (2018). \n                      https:\/\/doi.org\/10.1007\/978-3-319-96881-0_24"},{"key":"3_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/978-3-319-39555-5_8","volume-title":"Applied Cryptography and Network Security","author":"B Libert","year":"2016","unstructured":"Libert, B., Mouhartem, F., Nguyen, K.: A lattice-based group signature scheme with message-dependent opening. In: Manulis, M., Sadeghi, A.-R., Schneider, S. (eds.) ACNS 2016. LNCS, vol. 9696, pp. 137\u2013155. Springer, Cham (2016). \n                      https:\/\/doi.org\/10.1007\/978-3-319-39555-5_8"},{"key":"3_CR40","doi-asserted-by":"crossref","unstructured":"Libert, B., Quisquater, J.-J., Yung, M.: Forward-secure signatures in untrusted update environments: efficient and generic constructions. In: ACM-CCS 2007, pp. 266\u2013275. ACM (2007)","DOI":"10.1145\/1315245.1315279"},{"issue":"4","key":"3_CR41","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1880022.1880031","volume":"13","author":"Beno\u00eet Libert","year":"2010","unstructured":"Libert, B., Quisquater, J.-J., Yung, M.: Key evolution systems in untrusted update environments. ACM Trans. Inf. Syst. Secur. (TISSEC) 13(4), 37 (2010)","journal-title":"ACM Transactions on Information and System Security"},{"key":"3_CR42","doi-asserted-by":"crossref","unstructured":"Libert, B., Yung, M.: Dynamic fully forward-secure group signatures. In: Asia-CCS 2010, pp. 70\u201381. ACM (2010)","DOI":"10.1145\/1755688.1755698"},{"key":"3_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/978-3-642-36362-7_8","volume-title":"Public-Key Cryptography \u2013 PKC 2013","author":"S Ling","year":"2013","unstructured":"Ling, S., Nguyen, K., Stehl\u00e9, D., Wang, H.: Improved zero-knowledge proofs of knowledge for the ISIS problem, and applications. In: Kurosawa, K., Hanaoka, G. (eds.) PKC 2013. LNCS, vol. 7778, pp. 107\u2013124. Springer, Heidelberg (2013). \n                      https:\/\/doi.org\/10.1007\/978-3-642-36362-7_8"},{"key":"3_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/978-3-662-46447-2_19","volume-title":"Public-Key Cryptography \u2013 PKC 2015","author":"S Ling","year":"2015","unstructured":"Ling, S., Nguyen, K., Wang, H.: Group signatures from lattices: simpler, tighter, shorter, ring-based. In: Katz, J. (ed.) PKC 2015. LNCS, vol. 9020, pp. 427\u2013449. Springer, Heidelberg (2015). \n                      https:\/\/doi.org\/10.1007\/978-3-662-46447-2_19"},{"key":"3_CR45","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/978-3-319-61204-1_15","volume-title":"Applied Cryptography and Network Security","author":"S Ling","year":"2017","unstructured":"Ling, S., Nguyen, K., Wang, H., Xu, Y.: Lattice-based group signatures: achieving full dynamicity with ease. In: Gollmann, D., Miyaji, A., Kikuchi, H. (eds.) ACNS 2017. LNCS, vol. 10355, pp. 293\u2013312. Springer, Cham (2017). \n                      https:\/\/doi.org\/10.1007\/978-3-319-61204-1_15"},{"key":"3_CR46","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"556","DOI":"10.1007\/978-3-030-12612-4_28","volume-title":"Topics in Cryptology \u2013 CT-RSA 2019","author":"S Ling","year":"2019","unstructured":"Ling, S., Nguyen, K., Wang, H., Xu, Y.: Accountable tracing signatures from lattices. In: Matsui, M. (ed.) CT-RSA 2019. LNCS, vol. 11405, pp. 556\u2013576. Springer, Cham (2019). \n                      https:\/\/doi.org\/10.1007\/978-3-030-12612-4_28"},{"key":"3_CR47","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1007\/978-3-319-76581-5_3","volume-title":"Public-Key Cryptography \u2013 PKC 2018","author":"S Ling","year":"2018","unstructured":"Ling, S., Nguyen, K., Wang, H., Xu, Y.: Constant-size group signatures from\u00a0lattices. In: Abdalla, M., Dahab, R. (eds.) PKC 2018. LNCS, vol. 10770, pp. 58\u201388. Springer, Cham (2018). \n                      https:\/\/doi.org\/10.1007\/978-3-319-76581-5_3"},{"key":"3_CR48","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-642-40041-4_2","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"D Micciancio","year":"2013","unstructured":"Micciancio, D., Peikert, C.: Hardness of SIS and LWE with small parameters. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013. LNCS, vol. 8042, pp. 21\u201339. Springer, Heidelberg (2013). \n                      https:\/\/doi.org\/10.1007\/978-3-642-40041-4_2"},{"issue":"1","key":"3_CR49","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1137\/S0097539705447360","volume":"37","author":"Daniele Micciancio","year":"2007","unstructured":"Micciancio, D., Regev, O.: Worst-case to average-case reductions based on Gaussian measures. SIAM J. Comput. 37(1), 267\u2013302 (2007)","journal-title":"SIAM Journal on Computing"},{"key":"3_CR50","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/978-3-642-03298-1_12","volume-title":"Pairing-Based Cryptography \u2013 Pairing 2009","author":"T Nakanishi","year":"2009","unstructured":"Nakanishi, T., Hira, Y., Funabiki, N.: Forward-secure group signatures from pairings. In: Shacham, H., Waters, B. (eds.) Pairing 2009. LNCS, vol. 5671, pp. 171\u2013186. Springer, Heidelberg (2009). \n                      https:\/\/doi.org\/10.1007\/978-3-642-03298-1_12"},{"key":"3_CR51","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/978-3-319-69659-1_6","volume-title":"Lecture Notes in Computer Science","author":"Khoa Nguyen","year":"2017","unstructured":"Nguyen, K., Tan, B.H.M., Wang, H.: Zero-knowledge password policy check from lattices. In: Nguyen, P., Zhou, J. (eds.) ISC 2017. LNCS, vol. 10599, pp. 92\u2013113. Springer, Heidelberg (2017). \n                      https:\/\/doi.org\/10.1007\/978-3-319-69659-1_6"},{"key":"3_CR52","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/978-3-662-46447-2_18","volume-title":"Public-Key Cryptography \u2013 PKC 2015","author":"PQ Nguyen","year":"2015","unstructured":"Nguyen, P.Q., Zhang, J., Zhang, Z.: Simpler efficient group signatures from lattices. In: Katz, J. (ed.) PKC 2015. LNCS, vol. 9020, pp. 401\u2013426. Springer, Heidelberg (2015). \n                      https:\/\/doi.org\/10.1007\/978-3-662-46447-2_18"},{"key":"3_CR53","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/11681878_8","volume-title":"Theory of Cryptography","author":"C Peikert","year":"2006","unstructured":"Peikert, C., Rosen, A.: Efficient collision-resistant hashing from worst-case assumptions on cyclic lattices. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol. 3876, pp. 145\u2013166. Springer, Heidelberg (2006). \n                      https:\/\/doi.org\/10.1007\/11681878_8"},{"key":"3_CR54","doi-asserted-by":"crossref","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. In: STOC 2005, pp. 84\u201393. ACM (2005)","DOI":"10.1145\/1060590.1060603"},{"key":"3_CR55","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1007\/978-3-642-36334-4_18","volume-title":"Pairing-Based Cryptography \u2013 Pairing 2012","author":"Y Sakai","year":"2013","unstructured":"Sakai, Y., Emura, K., Hanaoka, G., Kawai, Y., Matsuda, T., Omote, K.: Group signatures with message-dependent opening. In: Abdalla, M., Lange, T. (eds.) Pairing 2012. LNCS, vol. 7708, pp. 270\u2013294. Springer, Heidelberg (2013). \n                      https:\/\/doi.org\/10.1007\/978-3-642-36334-4_18"},{"key":"3_CR56","doi-asserted-by":"crossref","unstructured":"Song, D.X.: Practical forward secure group signature schemes. In: ACM-CCS 2001, pp. 225\u2013234. ACM (2001)","DOI":"10.1145\/501983.502015"},{"issue":"6","key":"3_CR57","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. Inf. Theory 42(6), 1757\u20131768 (1996)","journal-title":"IEEE Transactions on Information Theory"}],"container-title":["Lecture Notes in Computer Science","Post-Quantum Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-25510-7_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,13]],"date-time":"2019-07-13T07:03:02Z","timestamp":1563001382000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-25510-7_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030255091","9783030255107"],"references-count":57,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-25510-7_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"14 July 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PQCrypto","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Post-Quantum Cryptography","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Chongquin","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 May 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 May 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pqcrypto0","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"66","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"22","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"33% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3-5","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3-5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}