{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T22:58:19Z","timestamp":1740178699585,"version":"3.37.3"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2019,6,10]],"date-time":"2019-06-10T00:00:00Z","timestamp":1560124800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2019,6,10]],"date-time":"2019-06-10T00:00:00Z","timestamp":1560124800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"National Key R&D Program of China","award":["2017YFB0802400"],"award-info":[{"award-number":["2017YFB0802400"]}]},{"DOI":"10.13039\/501100001809","name":"National Science Foundation of China","doi-asserted-by":"crossref","award":["61373171"],"award-info":[{"award-number":["61373171"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"The 111 Project","award":["B08038"],"award-info":[{"award-number":["B08038"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["EURASIP J. on Info. Security"],"published-print":{"date-parts":[[2019,12]]},"DOI":"10.1186\/s13635-019-0088-0","type":"journal-article","created":{"date-parts":[[2019,6,10]],"date-time":"2019-06-10T14:02:58Z","timestamp":1560175378000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A new method of generating hard random lattices with short bases"],"prefix":"10.1186","volume":"2019","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5290-9094","authenticated-orcid":false,"given":"Chengli","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenping","family":"Ma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hefeng","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Feifei","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,6,10]]},"reference":[{"key":"88_CR1","first-page":"80","volume-title":"Annual Cryptology Conference","author":"C Peikert","year":"2010","unstructured":"C. Peikert, in Annual Cryptology Conference. An efficient and parallel Gaussian sampler for lattices (Springer, Berlin, 2010), pp. 80\u201397"},{"key":"88_CR2","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1007\/978-3-642-22792-9_29","volume-title":"Adannces in Cryptology -CRYPTO 2011","author":"Z Brakerski","year":"2011","unstructured":"Z. Brakerski, V. Vaikuntanathan, in Adannces in Cryptology -CRYPTO 2011. Fully homomorphic encryption from ring-LWE and security for key dependent message (2011), pp. 505\u2013524"},{"key":"88_CR3","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":"S Dov Gordon","year":"2010","unstructured":"S. Dov Gordon, J. Katz, V. Vaikuntanathan, in Advances in cryptology -ASIACRYPT 2010, Lecture Notes in Computer Science. A group signature scheme from lattice assumptions, vol 6477 (2010), pp. 395\u2013412"},{"key":"88_CR4","first-page":"1","volume-title":"Advances in Cryptology C EUROCRYPT 2010","author":"V Lyubashevsky","year":"2010","unstructured":"V. Lyubashevsky, C. Peikert, O. Regev, in Advances in Cryptology C EUROCRYPT 2010. On ideal lattices and learning with errors over rings (2010), pp. 1\u201323"},{"key":"88_CR5","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/978-3-642-38348-9_3","volume-title":"Advances in Cryptology C EUROCRYPT 2013","author":"V Lyubashevsky","year":"2013","unstructured":"V. Lyubashevsky, C. Peikert, O. Regev, in Advances in Cryptology C EUROCRYPT 2013. A Toolkit for Ring-LWE Cryptography (2013), pp. 35\u201354"},{"key":"88_CR6","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/978-3-642-36362-7_8","volume-title":"Public-Key CryptographyCPKC 2013","author":"S Ling","year":"2013","unstructured":"S. Ling, K. Nguyen, D. Stehl, et al., in Public-Key CryptographyCPKC 2013. Improved zero-knowledge proofs of knowledge for the ISIS problem, and applications (Springer, Berlin, 2013), pp. 107\u2013124"},{"key":"88_CR7","doi-asserted-by":"publisher","first-page":"700","DOI":"10.1007\/978-3-642-29011-4_41","volume-title":"Advances in Cryptology C EUROCRYPT 2012","author":"D Micciancio","year":"2012","unstructured":"D. Micciancio, C. Peikert, in Advances in Cryptology C EUROCRYPT 2012. Trapdoor for lattices: simpler, tighter, faster, smaller (2012), pp. 700\u2013718"},{"key":"88_CR8","doi-asserted-by":"crossref","unstructured":"O. Regev, Lattice-based cryptography[C]. Annual International Cryptology Conference. (Springer, Berlin, Heidelberg, 2006), pp. 131\u2013141","DOI":"10.1007\/11818175_8"},{"issue":"6","key":"88_CR9","doi-asserted-by":"publisher","first-page":"1803","DOI":"10.1137\/080733954","volume":"40","author":"Chris Peikert","year":"2011","unstructured":"C. Peikert, B. Waters, Lossy trapdoor functions and their applications[J]. SIAM J. Comput. 40(6), 1803\u20131844 (2011)","journal-title":"SIAM Journal on Computing"},{"issue":"6","key":"88_CR10","first-page":"305","volume":"59","author":"T Poppelmann","year":"2017","unstructured":"T. Poppelmann, Efficient implementation of ideal lattice-based cryptography. Inf. Technol. 59(6), 305\u2013309 (2017)","journal-title":"Inf. Technol."},{"key":"88_CR11","first-page":"1","volume-title":"International Colloquium on Automata, Languages, and Programming","author":"M Ajtai","year":"1999","unstructured":"M. Ajtai, in International Colloquium on Automata, Languages, and Programming. Generating hard instances of the short basis problem (1999), pp. 1\u20139"},{"issue":"3","key":"88_CR12","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1007\/s00224-010-9278-3","volume":"48","author":"J Alwen","year":"2011","unstructured":"J. Alwen, C. Peikert, Generating shorter bases for hard random lattices. Theory Comput. Syst. 48(3), 535\u2013553 (2011)","journal-title":"Theory Comput. Syst."},{"key":"88_CR13","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1007\/978-3-642-03356-8_34","volume-title":"Advances in Cryptology-CRYPTO 2009","author":"V Lyubashevsky","year":"2009","unstructured":"V. Lyubashevsky, D. Micciancio, in Advances in Cryptology-CRYPTO 2009. On bounded distance decoding, unique shortest vectors, and the minimum distance problem (2009), pp. 577\u2013594"},{"issue":"2\u20133","key":"88_CR14","first-page":"375400","volume":"77","author":"T Laarhoven","year":"2015","unstructured":"T. Laarhoven, M. Mosca, J. Van De Pol, Finding shortest lattice vectors faster using quantum search. Des. Codes Crypt. 77(2\u20133), 375400 (2015)","journal-title":"Des. Codes Crypt."},{"key":"88_CR15","first-page":"99","volume-title":"ACM Symposium on Theory of Computing -STOC","author":"M Ajtai","year":"1996","unstructured":"M. Ajtai, in ACM Symposium on Theory of Computing -STOC. Generating hard instances of lattice problem-s (1996), pp. 99\u2013108"},{"key":"88_CR16","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1145\/1374376.1374407","volume-title":"Proceedings of the fortieth annual ACM symposium on Theory of computing","author":"C Gentry","year":"2008","unstructured":"C. Gentry, C. Peikert, V. Vaikuntanathan, in Proceedings of the fortieth annual ACM symposium on Theory of computing. Trapdoors for hard lattices and new cryptographic constructions (2008), pp. 197\u2013206"},{"issue":"1","key":"88_CR17","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1137\/S0097539705447360","volume":"37","author":"Daniele Micciancio","year":"2007","unstructured":"D. Micciancio, O. Regev, Worst-case to average-case reductions based on Gaussian measures. SIAM J. Comput. 37(1), 267\u2013302 (2007)","journal-title":"SIAM Journal on Computing"}],"container-title":["EURASIP Journal on Information Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s13635-019-0088-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1186\/s13635-019-0088-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s13635-019-0088-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,18]],"date-time":"2020-12-18T03:22:43Z","timestamp":1608261763000},"score":1,"resource":{"primary":{"URL":"https:\/\/jis-eurasipjournals.springeropen.com\/articles\/10.1186\/s13635-019-0088-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6,10]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,12]]}},"alternative-id":["88"],"URL":"https:\/\/doi.org\/10.1186\/s13635-019-0088-0","relation":{},"ISSN":["2510-523X"],"issn-type":[{"type":"electronic","value":"2510-523X"}],"subject":[],"published":{"date-parts":[[2019,6,10]]},"assertion":[{"value":"22 January 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 April 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 June 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors declare that they have no competing interests.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}},{"value":"Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Publisher\u2019s Note"}}],"article-number":"8"}}