{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,4]],"date-time":"2026-08-04T15:24:15Z","timestamp":1785857055835,"version":"3.56.0"},"reference-count":68,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2020,7,7]],"date-time":"2020-07-07T00:00:00Z","timestamp":1594080000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,7,7]],"date-time":"2020-07-07T00:00:00Z","timestamp":1594080000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Sci. China Inf. Sci."],"published-print":{"date-parts":[[2020,8]]},"DOI":"10.1007\/s11432-019-9861-3","type":"journal-article","created":{"date-parts":[[2020,7,11]],"date-time":"2020-07-11T04:35:11Z","timestamp":1594442111000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Improved lattice-based CCA2-secure PKE in the standard model"],"prefix":"10.1007","volume":"63","author":[{"given":"Jiang","family":"Zhang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yu","family":"Yu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shuqin","family":"Fan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhenfeng","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,7,7]]},"reference":[{"key":"9861_CR1","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"22","author":"W Diffie","year":"1976","unstructured":"Diffie W, Hellman M. New directions in cryptography. IEEE Trans Inform Theor, 1976, 22: 644\u2013654","journal-title":"IEEE Trans Inform Theor"},{"key":"9861_CR2","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"R L Rivest","year":"1978","unstructured":"Rivest R L, Shamir A, Adleman L. A method for obtaining digital signatures and public-key cryptosystems. Commun ACM, 1978, 21: 120\u2013126","journal-title":"Commun ACM"},{"key":"9861_CR3","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/0022-0000(84)90070-9","volume":"28","author":"S Goldwasser","year":"1984","unstructured":"Goldwasser S, Micali S. Probabilistic encryption. J Comput Syst Sci, 1984, 28: 270\u2013299","journal-title":"J Comput Syst Sci"},{"key":"9861_CR4","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":"9861_CR5","first-page":"433","volume-title":"Advances in Cryptology-CRYPTO\u201991","author":"C Rackoff","year":"1992","unstructured":"Rackoff C, Simon D R. Non-interactive zero-knowledge proof of knowledge and chosen ciphertext attack. In: Advances in Cryptology-CRYPTO\u201991. Berlin: Springer, 1992. 433\u2013444"},{"key":"9861_CR6","unstructured":"NIST. Post-quantum cryptography standardization. 2016. http:\/\/csrc.nist.gov\/groups\/ST\/post-quantum-crypto\/submission-requirements\/index.html"},{"key":"9861_CR7","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/s00145-011-9114-1","volume":"26","author":"E Fujisaki","year":"2013","unstructured":"Fujisaki E, Okamoto T. Secure integration of asymmetric and symmetric encryption schemes. J Cryptol, 2013, 26: 80\u2013101","journal-title":"J Cryptol"},{"key":"9861_CR8","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/978-3-540-46588-1_10","volume-title":"Public Key Cryptography","author":"D Pointcheval","year":"2000","unstructured":"Pointcheval D. Chosen-ciphertext security for any one-way cryptosystem. In: Public Key Cryptography. Berlin: Springer, 2000. 129\u2013146"},{"key":"9861_CR9","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1007\/978-3-662-53644-5_8","volume-title":"Theory of Cryptography","author":"E E Targhi","year":"2016","unstructured":"Targhi E E, Unruh D. Post-quantum security of the Fujisaki-Okamoto and OAEP transforms. In: Theory of Cryptography. Berlin: Springer, 2016. 192\u2013216"},{"key":"9861_CR10","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1145\/1008731.1008734","volume":"51","author":"R Canetti","year":"2004","unstructured":"Canetti R, Goldreich O, Halevi S. The random oracle methodology, revisited. J ACM, 2004, 51: 557\u2013594","journal-title":"J ACM"},{"key":"9861_CR11","doi-asserted-by":"publisher","first-page":"434","DOI":"10.1007\/978-3-540-70936-7_24","volume-title":"Theory of Cryptography","author":"Y Gertner","year":"2007","unstructured":"Gertner Y, Malkin T, Myers S. Towards a separation of semantic and CCA security for public key encryption. In: Theory of Cryptography. Berlin: Springer, 2007. 434\u2013455"},{"key":"9861_CR12","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 City, 1999. 543\u2013553"},{"key":"9861_CR13","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1137\/S0097539795291562","volume":"30","author":"D Dolev","year":"2000","unstructured":"Dolev D, Dwork C, Naor M. Non-malleable cryptography. SIAM J Comput, 2000, 30: 391\u2013437","journal-title":"SIAM J Comput"},{"key":"9861_CR14","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1137\/S0097539702403773","volume":"33","author":"R Cramer","year":"2001","unstructured":"Cramer R, Shoup V. Design and analysis of practical public-key encryption schemes secure against adaptive chosen ciphertext attack. SIAM J Comput, 2001, 33: 167\u2013226","journal-title":"SIAM J Comput"},{"key":"9861_CR15","first-page":"314","volume-title":"Proceedings of the 30th Annual Conference on Advances in Cryptology","author":"H Wee","year":"2010","unstructured":"Wee H. Efficient chosen-ciphertext security via extractable hash proofs. In: Proceedings of the 30th Annual Conference on Advances in Cryptology. Berlin: Springer, 2010. 314\u2013332"},{"key":"9861_CR16","doi-asserted-by":"publisher","first-page":"1301","DOI":"10.1137\/S009753970544713X","volume":"36","author":"D Boneh","year":"2006","unstructured":"Boneh D, Canetti R, Halevi S, et al. Chosen-ciphertext security from identity-based encryption. SIAM J Comput, 2006, 36: 1301\u20131328","journal-title":"SIAM J Comput"},{"key":"9861_CR17","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1007\/11681878_30","volume-title":"Theory of Cryptography","author":"E Kiltz","year":"2006","unstructured":"Kiltz E. Chosen-ciphertext security from tag-based encryption. In: Theory of Cryptography. Berlin: Springer, 2006. 581\u2013600"},{"key":"9861_CR18","first-page":"187","volume-title":"Proceedings of STOC 2008","author":"C Peikert","year":"2008","unstructured":"Peikert C, Waters B. Lossy trapdoor functions and their applications. In: Proceedings of STOC 2008. New York: ACM, 2008. 187\u2013196"},{"key":"9861_CR19","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1007\/978-3-642-00457-5_25","volume-title":"Theory of Cryptography","author":"A Rosen","year":"2009","unstructured":"Rosen A, Segev G. Chosen-ciphertext security via correlated products. In: Theory of Cryptography. Berlin: Springer, 2009. 419\u2013436"},{"key":"9861_CR20","doi-asserted-by":"publisher","first-page":"673","DOI":"10.1007\/978-3-642-13190-5_34","volume-title":"Advances in Cryptology-EUROCRYPT 2010","author":"E Kiltz","year":"2010","unstructured":"Kiltz E, Mohassel P, O\u2019Neill A. Adaptive trapdoor functions and chosen-ciphertext security. In: Advances in Cryptology-EUROCRYPT 2010. Berlin: Springer, 2010. 673\u2013692"},{"key":"9861_CR21","doi-asserted-by":"publisher","first-page":"1484","DOI":"10.1137\/S0097539795293172","volume":"26","author":"P W Shor","year":"1997","unstructured":"Shor P W. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J Comput, 1997, 26: 1484\u20131509","journal-title":"SIAM J Comput"},{"key":"9861_CR22","first-page":"13","volume-title":"Advances in Cryptology-CRYPTO\u201998","author":"R Cramer","year":"1998","unstructured":"Cramer R, Shoup V. A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack. In: Advances in Cryptology-CRYPTO\u201998. Berlin: Springer, 1998. 13\u201325"},{"key":"9861_CR23","doi-asserted-by":"publisher","first-page":"636","DOI":"10.1007\/978-3-642-10366-7_37","volume-title":"Advances in Cryptology-ASIACRYPT 2009","author":"J Katz","year":"2009","unstructured":"Katz J, Vaikuntanathan V. Smooth projective hashing and password-based authenticated key exchange from lattices. In: Advances in Cryptology-ASIACRYPT 2009. Berlin: Springer, 2009. 636\u2013652"},{"key":"9861_CR24","doi-asserted-by":"publisher","first-page":"554","DOI":"10.1007\/978-3-540-85174-5_31","volume-title":"Advances in Cryptology-CRYPTO 2008","author":"C Peikert","year":"2008","unstructured":"Peikert C, Vaikuntanathan V, Waters B. A framework for efficient and composable oblivious transfer. In: Advances in Cryptology-CRYPTO 2008. Berlin: Springer, 2008. 554\u2013571"},{"key":"9861_CR25","doi-asserted-by":"crossref","unstructured":"Benhamouda F, Blazy O, Ducas L, et al. Hash proof systems over lattices revisited. In: Public-Key Cryptography-PKC 2018. Berlin: Springer, 644\u2013674","DOI":"10.1007\/978-3-319-76581-5_22"},{"key":"9861_CR26","doi-asserted-by":"publisher","first-page":"099103","DOI":"10.1007\/s11432-017-9369-9","volume":"61","author":"G Han","year":"2018","unstructured":"Han G, Li H, Qin B D, et al. Chameleon all-but-one extractable hash proof and its applications. Sci China Inf Sci, 2018, 61: 099103","journal-title":"Sci China Inf Sci"},{"key":"9861_CR27","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/978-3-319-70700-6_2","volume-title":"Advances in Cryptology-ASIACRYPT 2017","author":"J Zhang","year":"2017","unstructured":"Zhang J, Yu Y. Two-round pake from approximate SPH and instantiations from lattices. In: Advances in Cryptology-ASIACRYPT 2017. Berlin: Springer, 2017. 37\u201367"},{"key":"9861_CR28","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1007\/978-3-319-96881-0_25","volume-title":"Advances in Cryptology-CRYPTO 2018","author":"S Kim","year":"2018","unstructured":"Kim S, Wu D J. Multi-theorem preprocessing NIZKs from lattices. In: Advances in Cryptology-CRYPTO 2018. Berlin: Springer, 2018. 733\u2013765"},{"key":"9861_CR29","doi-asserted-by":"crossref","unstructured":"Peikert C. Public-key cryptosystems from the worst-case shortest vector problem: extended abstract. In: Proceedings of the Annual ACM Symposium on Theory of Computing, Bethesda, 2009. 333\u2013342","DOI":"10.1145\/1536414.1536461"},{"key":"9861_CR30","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1007\/978-3-642-30057-8_16","volume-title":"Public Key Cryptography-PKC 2012","author":"H Wee","year":"2012","unstructured":"Wee H. Public key encryption against related key attacks. In: Public Key Cryptography-PKC 2012. Berlin: Springer, 2012. 262\u2013279"},{"key":"9861_CR31","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/978-3-642-30057-8_21","volume-title":"Public Key Cryptography-PKC 2012","author":"R Steinfeld","year":"2012","unstructured":"Steinfeld R, Ling S, Pieprzyk J, et al. NTRUCCA: how to strengthen ntruencrypt to chosen-ciphertext security in the standard model. In: Public Key Cryptography-PKC 2012. Berlin: Springer, 2012. 353\u2013371"},{"key":"9861_CR32","doi-asserted-by":"crossref","unstructured":"Dowsley R, Hanaoka G, Imai H, et al. Reducing the ciphertext size of Dolev-Dwork-Naor like public key cryptosystems. Cryptology ePrint Archive, Report 2009\/271, 2009","DOI":"10.5753\/sbseg.2010.20602"},{"key":"9861_CR33","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1007\/978-3-642-13190-5_28","volume-title":"Advances in Cryptology-EUROCRYPT 2010","author":"S Agrawal","year":"2010","unstructured":"Agrawal S, Boneh D, Boyen X. Efficient lattice (H)IBE in the standard model. In: Advances in Cryptology-EUROCRYPT 2010. Berlin: Springer, 2010. 553\u2013572"},{"key":"9861_CR34","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/978-3-642-14623-7_6","volume-title":"Advances in Cryptology-CRYPTO 2010","author":"S Agrawal","year":"2010","unstructured":"Agrawal S, Boneh D, Boyen X. Lattice basis delegation in fixed dimension and shorter-ciphertext hierarchical IBE. In: Advances in Cryptology-CRYPTO 2010. Berlin: Springer, 2010. 98\u2013115"},{"key":"9861_CR35","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1007\/978-3-642-13190-5_27","volume-title":"Advances in Cryptology-EUROCRYPT 2010","author":"D Cash","year":"2010","unstructured":"Cash D, Hofheinz D, Kiltz E, et al. Bonsai trees, or how to delegate a lattice basis. In: Advances in Cryptology-EUROCRYPT 2010. Berlin: Springer, 2010. 523\u2013552"},{"key":"9861_CR36","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/978-3-662-49896-5_2","volume-title":"Advances in Cryptology-EUROCRYPT 2016","author":"S Yamada","year":"2016","unstructured":"Yamada S. Adaptively secure identity-based encryption from lattices with asymptotically shorter public parameters. In: Advances in Cryptology-EUROCRYPT 2016. Berlin: Springer, 2016. 32\u201362"},{"key":"9861_CR37","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/978-3-662-53015-3_11","volume-title":"Advances in Cryptology-CRYPTO 2016","author":"J Zhang","year":"2016","unstructured":"Zhang J, Chen Y, Zhang Z. Programmable hash functions from lattices: short signatures and IBEs with small key sizes. In: Advances in Cryptology-CRYPTO 2016. Berlin: Springer, 2016. 303\u2013332"},{"key":"9861_CR38","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/978-3-319-63697-9_6","volume-title":"Advances in Cryptology-CRYPTO 2017","author":"S Yamada","year":"2017","unstructured":"Yamada S. Asymptotically compact adaptively secure lattice IBEs and verifiable random functions via generalized partitioning techniques. In: Advances in Cryptology-CRYPTO 2017. Berlin: Springer, 2017. 161\u2013193"},{"key":"9861_CR39","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-76578-5_1","volume-title":"Public-Key Cryptography-PKC 2018","author":"N Dottling","year":"2018","unstructured":"Dottling N, Garg S, Hajiabadi M, et al. New constructions of identity-based and key-dependent message secure encryption schemes. In: Public-Key Cryptography-PKC 2018. Berlin: Springer, 2018. 3\u201331"},{"key":"9861_CR40","doi-asserted-by":"publisher","first-page":"700","DOI":"10.1007\/978-3-642-29011-4_41","volume-title":"Advances in Cryptology-EUROCRYPT 2012","author":"D Micciancio","year":"2012","unstructured":"Micciancio D, Peikert C. Trapdoors for lattices: Simpler, tighter, faster, smaller. In: Advances in Cryptology-EUROCRYPT 2012. Berlin: Springer, 2012. 700\u2013718"},{"key":"9861_CR41","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/978-3-540-24676-3_13","volume-title":"Proceedings of EUROCRYPT 2004","author":"R Canetti","year":"2004","unstructured":"Canetti R, Halevi S, Katz J. Chosen-ciphertext security from identity-based encryption. In: Proceedings of EUROCRYPT 2004. Berlin: Springer, 2004. 207\u2013222"},{"key":"9861_CR42","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/978-3-540-30574-3_8","volume-title":"Topics in Cryptology-CT-RSA 2005","author":"D Boneh","year":"2005","unstructured":"Boneh D, Katz J. Improved efficiency for CCA-secure cryptosystems built using identity-based encryption. In: Topics in Cryptology-CT-RSA 2005. Berlin: Springer, 2005. 87\u2013103"},{"key":"9861_CR43","doi-asserted-by":"publisher","first-page":"774","DOI":"10.1007\/s00145-017-9270-z","volume":"31","author":"V Lyubashevsky","year":"2018","unstructured":"Lyubashevsky V, Micciancio D. Asymptotically efficient lattice-based digital signatures. J Cryptol, 2018, 31: 774\u2013797","journal-title":"J Cryptol"},{"key":"9861_CR44","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 Cryptol, 2015, 9: 169\u2013203","journal-title":"J Math Cryptol"},{"key":"9861_CR45","first-page":"706","volume-title":"Automata, Languages and Programming","author":"M Ajtai","year":"1999","unstructured":"Ajtai M. Generating hard instances of the short basis problem. In: Automata, Languages and Programming. Berlin: Springer, 1999. 706"},{"key":"9861_CR46","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":"9861_CR47","first-page":"84","volume-title":"Proceedings of the 37th Annual ACM Symposium on Theory of Computing","author":"O Regev","year":"2005","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. New York: ACM, 2005. 84\u201393"},{"key":"9861_CR48","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, et al. Fast cryptographic primitives and circular-secure encryption based on hard learning problems. In: Advances in Cryptology-CRYPTO 2009. Berlin: Springer, 2009. 595\u2013618"},{"key":"9861_CR49","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/978-3-642-19074-2_21","volume-title":"Topics in Cryptology-CT-RSA 2011","author":"R Lindner","year":"2011","unstructured":"Lindner R, Peikert C. Better key sizes (and attacks) for LWE-based encryption. In: Topics in Cryptology-CT-RSA 2011. Berlin: Springer, 2011. 6558: 319\u2013339"},{"key":"9861_CR50","doi-asserted-by":"publisher","first-page":"1006","DOI":"10.1145\/2976749.2978425","volume-title":"Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security","author":"J Bos","year":"2016","unstructured":"Bos J, Costello C, Ducas L, et al. Frodo: take off the ring! practical, quantum-secure key exchange from LWE. In: Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security. New York: ACM, 2016. 1006\u20131018"},{"key":"9861_CR51","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1007\/978-3-642-10366-7_36","volume-title":"Advances in Cryptology \u2014 ASIACRYPT 2009","author":"D Stehle","year":"2009","unstructured":"Stehle D, Steinfeld R, Tanaka K, et al. Efficient public key encryption based on ideal lattices. In: Advances in Cryptology \u2014 ASIACRYPT 2009. Berlin: Springer, 2009. 617\u2013635"},{"key":"9861_CR52","first-page":"1","volume-title":"Advances in Cryptology-EUROCRYPT 2010","author":"V Lyubashevsky","year":"2010","unstructured":"Lyubashevsky V, Peikert C, Regev O. On ideal lattices and learning with errors over rings. In: Advances in Cryptology-EUROCRYPT 2010. Berlin: Springer, 2010. 1\u201323"},{"key":"9861_CR53","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/978-3-642-20465-4_4","volume-title":"Advances in Cryptology-EUROCRYPT 2011","author":"D Stehle","year":"2011","unstructured":"Stehle D, Steinfeld R. Making NTRU as secure as worst-case problems over ideal lattices. In: Advances in Cryptology-EUROCRYPT 2011. Berlin: Springer, 2011. 27\u201347"},{"key":"9861_CR54","unstructured":"Alkim E, Ducas L, P\u00f6ppelmann T, et al. Post-quantum key exchange-a new hope. In: Proceedings of the 25th USENIX Security Symposium, Austin, 2016"},{"key":"9861_CR55","unstructured":"Alkim E, Ducas L, Po\u00f6ppelmann T, et al. Newhope Without Reconciliation. Cryptology ePrint Archive, Report 2016\/1157, 2016"},{"key":"9861_CR56","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/978-3-642-25385-0_3","volume-title":"Advances in Cryptology-ASIACRYPT 2011","author":"D Boneh","year":"2011","unstructured":"Boneh D, Dagdelen \u00d6, Fischlin M, et al. Random oracles in a quantum world. In: Advances in Cryptology-ASIACRYPT 2011. Berlin: Springer, 2011. 41\u201369"},{"key":"9861_CR57","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1007\/978-3-319-96878-0_4","volume-title":"Advances in Cryptology \u2014 CRYPTO 2018","author":"H Jiang","year":"2018","unstructured":"Jiang H, Zhang Z, Chen L, et al. IND-CCA-secure key encapsulation mechanism in the quantum random oracle model, revisted. In: Advances in Cryptology \u2014 CRYPTO 2018. Berlin: Springer, 2018. 96\u2013125"},{"key":"9861_CR58","doi-asserted-by":"publisher","first-page":"520","DOI":"10.1007\/978-3-319-78372-7_17","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2018","author":"T Saito","year":"2018","unstructured":"Saito T, Xagawa K, Yamakawa T. Tightly-secure key-encapsulation mechanism in the quantum random oracle model. In: Advances in Cryptology \u2014 EUROCRYPT 2018. Berlin: Springer, 2018. 520\u2013551"},{"key":"9861_CR59","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1007\/978-3-319-63697-9_12","volume-title":"Advances in Cryptology \u2014 CRYPTO 2017","author":"B Libert","year":"2017","unstructured":"Libert B, Sakzad A, Stehle D, et al. All-but-many lossy trapdoor functions and selective opening chosen-ciphertext security from LWE. In: Advances in Cryptology \u2014 CRYPTO 2017. Berlin: Springer, 2017. 332\u2013364"},{"key":"9861_CR60","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1007\/BF01445125","volume":"296","author":"W Banaszczyk","year":"1993","unstructured":"Banaszczyk W. New bounds in some transference theorems in the geometry of numbers. Math Ann, 1993, 296: 625\u2013635","journal-title":"Math Ann"},{"key":"9861_CR61","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/978-3-642-14623-7_5","volume-title":"Advances in Cryptology-CRYPTO 2010","author":"C Peikert","year":"2010","unstructured":"Peikert C. An efficient and parallel Gaussian sampler for lattices. In: Advances in Cryptology-CRYPTO 2010. Berlin: Springer, 2010. 80\u201397"},{"key":"9861_CR62","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/978-3-662-44371-2_19","volume-title":"Advances in Cryptology-CRYPTO 2014","author":"L Ducas","year":"2014","unstructured":"Ducas L, Micciancio D. Improved short lattice signatures in the standard model. In: Advances in Cryptology-CRYPTO 2014. Berlin: Springer, 2014. 335\u2013352"},{"key":"9861_CR63","unstructured":"Vershynin R. Introduction to the non-asymptotic analysis of random matrices. 2010. ArXiv: 10113027"},{"key":"9861_CR64","doi-asserted-by":"crossref","unstructured":"Peikert C, Regev O, Stephens-Davidowitz N. Pseudorandomness of ring-LWE for any ring and modulus. In: STOC 2017. ACM, 2017. 461\u2013473","DOI":"10.1145\/3055399.3055489"},{"key":"9861_CR65","unstructured":"Alwen J, Peikert C. Generating shorter bases for hard random lattices. In: Proceedings of STACS, 2009. 75\u201386"},{"key":"9861_CR66","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/978-3-642-03356-8_11","volume-title":"Proceedings of CRYPTO 2009","author":"R Cramer","year":"2009","unstructured":"Cramer R, Damgard I. On the amortized complexity of zero-knowledge protocols. In: Proceedings of CRYPTO 2009. Berlin: Springer, 2009. 177\u2013191"},{"key":"9861_CR67","unstructured":"Shoup V. Sequences of Games: a Taming Complexity in Security Proofs. Cryptology ePrint Archive, Report 2004\/332, 2004"},{"key":"9861_CR68","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1109\/FOCS.2011.12","volume-title":"Proceedings of the 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science","author":"Z Brakerski","year":"2011","unstructured":"Brakerski Z, Vaikuntanathan V. Efficient fully homomorphic encryption from (standard) LWE. In: Proceedings of the 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science. Washington: IEEE Computer Society, 2011. 97\u2013106"}],"container-title":["Science China Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-019-9861-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11432-019-9861-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-019-9861-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,2]],"date-time":"2022-11-02T10:08:27Z","timestamp":1667383707000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11432-019-9861-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,7]]},"references-count":68,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2020,8]]}},"alternative-id":["9861"],"URL":"https:\/\/doi.org\/10.1007\/s11432-019-9861-3","relation":{},"ISSN":["1674-733X","1869-1919"],"issn-type":[{"value":"1674-733X","type":"print"},{"value":"1869-1919","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,7,7]]},"assertion":[{"value":"12 February 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 April 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 July 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"182101"}}