{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,25]],"date-time":"2025-07-25T10:11:51Z","timestamp":1753438311289,"version":"3.37.3"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2020,1,28]],"date-time":"2020-01-28T00:00:00Z","timestamp":1580169600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,28]],"date-time":"2020-01-28T00:00:00Z","timestamp":1580169600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["2013-StG-335086-LATTAC"],"award-info":[{"award-number":["2013-StG-335086-LATTAC"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100010663","name":"H2020 European Research Council","doi-asserted-by":"publisher","award":["780701"],"award-info":[{"award-number":["780701"]}],"id":[{"id":"10.13039\/100010663","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2020,5]]},"DOI":"10.1007\/s10623-020-00719-w","type":"journal-article","created":{"date-parts":[[2020,1,28]],"date-time":"2020-01-28T20:41:30Z","timestamp":1580244090000},"page":"931-950","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["On the smoothing parameter and last minimum of random orthogonal lattices"],"prefix":"10.1007","volume":"88","author":[{"given":"Elena","family":"Kirshanova","sequence":"first","affiliation":[]},{"given":"Huyen","family":"Nguyen","sequence":"additional","affiliation":[]},{"given":"Damien","family":"Stehl\u00e9","sequence":"additional","affiliation":[]},{"given":"Alexandre","family":"Wallet","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,1,28]]},"reference":[{"key":"719_CR1","first-page":"1","volume":"7","author":"D Aggarwal","year":"2016","unstructured":"Aggarwal D., Regev O.: A note on discrete Gaussian combinations of lattice vectors. Chic. J. Theor. Comput. Sci. 7, 1\u201311 (2016).","journal-title":"Chic. J. Theor. Comput. Sci."},{"key":"719_CR2","first-page":"97","volume":"2013","author":"S Agrawal","year":"2013","unstructured":"Agrawal S., Gentry C., Halevi S., Sahai A.: Discrete Gaussian leftover hash lemma over infinite domains. Adv. Cryptol. 2013, 97\u2013116 (2013).","journal-title":"Adv. Cryptol."},{"key":"719_CR3","first-page":"333","volume":"2016","author":"S Agrawal","year":"2016","unstructured":"Agrawal S., Libert B., Stehl\u00e9 D.: Fully secure functional encryption for inner products, from standard assumptions. Adv. Cryptol. 2016, 333\u2013362 (2016).","journal-title":"Adv. Cryptol."},{"key":"719_CR4","first-page":"619","volume":"2018","author":"N Alamati","year":"2018","unstructured":"Alamati N., Peikert C., Stephens-Davidowitz N.: New (and old) proof systems for lattice problems. Public-Key Cryptogr. 2018, 619\u2013643 (2018).","journal-title":"Public-Key Cryptogr."},{"key":"719_CR5","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. 296, 625\u2013636 (1993).","journal-title":"Math. Ann."},{"key":"719_CR6","doi-asserted-by":"crossref","unstructured":"Belfiore J.-C.: Lattice codes for the compute-and-forward protocol: the flatness factor. In: 2011 IEEE Information Theory Workshop, ITW 2011, vol. 10 (2011)","DOI":"10.1109\/ITW.2011.6089376"},{"key":"719_CR7","doi-asserted-by":"crossref","unstructured":"Chen J., Stehl\u00e9 D., Villard G.: A new view on HJLS and PSLQ: Sums and projections of lattices. In: Proceedings of the 38th International Symposium on Symbolic and Algebraic Computation, pp. 149\u2013156 (2013)","DOI":"10.1145\/2465506.2465936"},{"key":"719_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-2249-9","volume-title":"Sphere Packings, Lattices, and Groups","author":"JH Conway","year":"1993","unstructured":"Conway J.H., Sloane N.J.A.: Sphere Packings, Lattices, and Groups, Third edn. Springer-Verlag, New York (1993).","edition":"Third"},{"key":"719_CR9","doi-asserted-by":"crossref","unstructured":"Dadush D., Regev O., Stephens-Davidowitz N.: On the closest vector problem with a distance guarantee. In: Proceedings of the 2014 IEEE 29th Conference on Computational Complexity, pp. 98\u2013109 (2014)","DOI":"10.1109\/CCC.2014.18"},{"key":"719_CR10","first-page":"1","volume":"2013","author":"S Garg","year":"2013","unstructured":"Garg S., Gentry C., Halevi S.: Candidate multilinear maps from ideal lattices. Adv. Cryptol. 2013, 1\u201317 (2013).","journal-title":"Adv. Cryptol."},{"key":"719_CR11","doi-asserted-by":"crossref","unstructured":"Gentry C., Peikert C., Vaikuntanathan V.: Trapdoors for hard lattices and new cryptographic constructions. In: Proceedings of the 14th Annual ACM Symposium on Theory of Computing, pp. 197\u2013206 (2008)","DOI":"10.1145\/1374376.1374407"},{"issue":"2","key":"719_CR12","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1080\/10586458.1998.10504362","volume":"7","author":"G Havas","year":"1998","unstructured":"Havas G., Majewski B.S., Matthews K.R.: Extended GCD and Hermite normal form algorithms via lattice basis reduction. Exp. Math. 7(2), 125\u2013136 (1998).","journal-title":"Exp. Math."},{"key":"719_CR13","first-page":"22","volume":"389","author":"DR Heath-Brown","year":"1988","unstructured":"Heath-Brown D.R.: The number of primes in a short interval. J. Reine Angew. Math. 389, 22\u201363 (1988).","journal-title":"J. Reine Angew. Math."},{"key":"719_CR14","doi-asserted-by":"crossref","unstructured":"Impagliazzo R., Levin L.A., Luby M.: Pseudo-random generation from one-way functions. In: Proceedings of the 21st Annual ACM Symposium on Theory of Computing, pp. 12\u201324. ACM (1989)","DOI":"10.1145\/73007.73009"},{"key":"719_CR15","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/BF01457454","volume":"261","author":"AK Lenstra","year":"1982","unstructured":"Lenstra A.K., Lenstra H.W., Lov\u00e1sz L.: Factoring polynomials with rational coefficients. Math. Ann. 261, 515\u2013534 (1982).","journal-title":"Math. Ann."},{"key":"719_CR16","doi-asserted-by":"crossref","unstructured":"Ling S., Phan D.H., Stehl\u00e9 D., Steinfeld R.: Hardness of $$k$$-LWE and applications in traitor tracing. In: Algorithmica, pp. 1318\u20131352 (2017)","DOI":"10.1007\/s00453-016-0251-7"},{"issue":"1","key":"719_CR17","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1137\/S0097539705447360","volume":"37","author":"D 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). Preliminary version in FOCS 2004.","journal-title":"SIAM J. Comput."},{"key":"719_CR18","unstructured":"Nguyen P.: La g\u00e9om\u00e9trie des nombres en cryptologie. PhD thesis, Universit\u00e9 Paris, vol. 7 (1999)"},{"key":"719_CR19","volume-title":"The LLL Algorithm: Survey and Applications","author":"P Nguyen","year":"2009","unstructured":"Nguyen P.: The LLL Algorithm: Survey and Applications, 1st edn. Springer, New York (2009).","edition":"1"},{"key":"719_CR20","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1007\/BFb0052236","volume":"1997","author":"P Nguyen","year":"1997","unstructured":"Nguyen P., Stern J.: Merkle-Hellman revisited: a cryptanalysis of the Qu-Vanstone cryptosystem based on group factorizations. Adv. Cryptol. 1997, 198\u2013212 (1997).","journal-title":"Adv. Cryptol."},{"key":"719_CR21","doi-asserted-by":"crossref","unstructured":"Nguyen P., Stern J.: The hardness of the hidden subset sum problem and its cryptographic implications. In: Advances in Cryptology\u2014CRYPTO 1999, pp. 31\u201346 (1999)","DOI":"10.1007\/3-540-48405-1_3"},{"issue":"2","key":"719_CR22","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1007\/s00037-008-0251-3","volume":"17","author":"C Peikert","year":"2008","unstructured":"Peikert C.: Limits on the hardness of lattice problems in $$\\ell _p$$ norms. Comput. Complex. 17(2), 300\u2013351 (2008).","journal-title":"Comput. Complex."},{"key":"719_CR23","doi-asserted-by":"crossref","unstructured":"Peikert C., Regev O., Stephens-Davidowitz N.: Pseudorandomness of ring-LWE for any ring and modulus. In: Proceedings of the 49th Annual ACM Symposium on Theory of Computing, pp. 461\u2013473. ACM (2017)","DOI":"10.1145\/3055399.3055489"},{"key":"719_CR24","doi-asserted-by":"crossref","unstructured":"van\u00a0Dijk M., Gentry C., Halevi S., Vaikuntanathan V.: Fully homomorphic encryption over the integers. In: Advances in Cryptology\u2014EUROCRYPT 2010, pp. 24\u201343 (2010)","DOI":"10.1007\/978-3-642-13190-5_2"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-020-00719-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-020-00719-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-020-00719-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,1,27]],"date-time":"2021-01-27T00:07:15Z","timestamp":1611706035000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-020-00719-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,1,28]]},"references-count":24,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2020,5]]}},"alternative-id":["719"],"URL":"https:\/\/doi.org\/10.1007\/s10623-020-00719-w","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[2020,1,28]]},"assertion":[{"value":"8 December 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 January 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 January 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 January 2020","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}