{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:42:56Z","timestamp":1740109376860,"version":"3.37.3"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2024,3,5]],"date-time":"2024-03-05T00:00:00Z","timestamp":1709596800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,3,5]],"date-time":"2024-03-05T00:00:00Z","timestamp":1709596800000},"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":["Theory Comput Syst"],"published-print":{"date-parts":[[2024,4]]},"DOI":"10.1007\/s00224-024-10162-2","type":"journal-article","created":{"date-parts":[[2024,3,5]],"date-time":"2024-03-05T08:02:02Z","timestamp":1709625722000},"page":"283-298","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["New Results on the Remote Set Problem and Its Applications in Complexity Study"],"prefix":"10.1007","volume":"68","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3924-2587","authenticated-orcid":false,"given":"Yijie","family":"Chen","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8733-2870","authenticated-orcid":false,"given":"Kewei","family":"Lv","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,3,5]]},"reference":[{"key":"10162_CR1","doi-asserted-by":"publisher","unstructured":"Alon, N., Panigrahy, R., Yekhanin, S.: Deterministic approximation algorithms for the nearest codeword problem. In: Dinur, I., Jansen, K., Naor, J., Rolim, J.D.P. (eds.) Algorithms and Techniques, 12th International Workshop, APPROX 2009, and 13th International Workshop, vol. 5687, pp. 339\u2013351. Springer, Berkeley, CA, USA (2009). https:\/\/doi.org\/10.1007\/978-3-642-03685-9_26","DOI":"10.1007\/978-3-642-03685-9_26"},{"issue":"2","key":"10162_CR2","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/s00037-005-0193-y","volume":"14","author":"V Guruswami","year":"2005","unstructured":"Guruswami, V., Micciancio, D., Regev, O.: The complexity of the covering radius problem. Comput. Complex. 14(2), 90\u2013121 (2005)","journal-title":"Comput. Complex."},{"issue":"1","key":"10162_CR3","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/s00454-008-9123-5","volume":"41","author":"I Haviv","year":"2009","unstructured":"Haviv, I., Lyubashevsky, V., Regev, O.: A note on the distribution of the distance from a lattice. Discret. Comput. Geom. 41(1), 162\u2013176 (2009)","journal-title":"Discret. Comput. Geom."},{"key":"10162_CR4","unstructured":"Haviv, I., Regev, O.: Hardness of the covering radius problem on lattices. Chic. J. Theor. Comput. Sci. 2012 (2012)"},{"issue":"1","key":"10162_CR5","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1137\/S0097539703433511","volume":"34","author":"D Micciancio","year":"2004","unstructured":"Micciancio, D.: Almost perfect lattices, the covering radius problem, and applications to ajtai\u2019s connection factor. SIAM J. Comput. 34(1), 118\u2013169 (2004)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"10162_CR6","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/s00037-014-0094-z","volume":"24","author":"I Haviv","year":"2015","unstructured":"Haviv, I.: The remote set problem on lattices. Comput. Complex. 24(1), 103\u2013131 (2015)","journal-title":"Comput. Complex."},{"key":"10162_CR7","doi-asserted-by":"publisher","unstructured":"Wang, W., Lv, K., Liu, J.: The variant of remote set problem on lattices. In: Lam, K., Chi, C., Qing, S. (eds.) Information and Communications Security, vol. 9977, pp. 124\u2013133. Springer, Singapore (2016). https:\/\/doi.org\/10.1007\/978-3-319-50011-9_10","DOI":"10.1007\/978-3-319-50011-9_10"},{"key":"10162_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0821-1","volume-title":"Applied Functional Analysis","author":"E Zeidler","year":"1995","unstructured":"Zeidler, E.: Applied Functional Analysis, 1st edn. Springer, New York (1995)","edition":"1"},{"key":"10162_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-0897-7","volume-title":"Complexity of Lattice Problems - a Cryptographic Perspective","author":"D Micciancio","year":"2002","unstructured":"Micciancio, D., Goldwasser, S.: Complexity of Lattice Problems - a Cryptographic Perspective, vol. 671. Springer, Boston (2002)"},{"key":"10162_CR10","doi-asserted-by":"publisher","unstructured":"Aggarwal, D., Dadush, D., Stephens-Davidowitz, N.: Solving the closest vector problem in 2 $$\\hat{}$$ n the discrete gaussian strikes again! In: Guruswami, V. (ed.) IEEE 56th Annual Symposium on Foundations of Computer Science, pp. 563\u2013582. IEEE Computer Society, Berkeley, CA, USA (2015). https:\/\/doi.org\/10.1109\/FOCS.2015.41","DOI":"10.1109\/FOCS.2015.41"},{"key":"10162_CR11","doi-asserted-by":"publisher","unstructured":"Ajtai, M., Kumar, R., Sivakumar, D.: A sieve algorithm for the shortest lattice vector problem. In: Vitter, J.S., Spirakis, P.G., Yannakakis, M. (eds.) Proceedings on 33rd Annual ACM Symposium on Theory of Computing, pp. 601\u2013610. ACM, Heraklion, Crete, Greece (2001). https:\/\/doi.org\/10.1145\/380752.380857","DOI":"10.1145\/380752.380857"},{"key":"10162_CR12","doi-asserted-by":"publisher","unstructured":"Becker, A., Ducas, L., Gama, N., Laarhoven, T.: New directions in nearest neighbor searching with applications to lattice sieving. In: Krauthgamer, R. (ed.) Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 10\u201324. SIAM, Arlington, VA, USA (2016). https:\/\/doi.org\/10.1137\/1.9781611974331.ch2","DOI":"10.1137\/1.9781611974331.ch2"},{"key":"10162_CR13","doi-asserted-by":"publisher","unstructured":"Micciancio, D., Voulgaris, P.: Faster exponential time algorithms for the shortest vector problem. In: Charikar, M. (ed.) Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1468\u20131480. SIAM, Austin, Texas, USA (2010). https:\/\/doi.org\/10.1137\/1.9781611973075.119","DOI":"10.1137\/1.9781611973075.119"},{"key":"10162_CR14","doi-asserted-by":"publisher","unstructured":"Doulgerakis, E., Laarhoven, T., Weger, B.: Finding closest lattice vectors using approximate voronoi cells. In: Ding, J., Steinwandt, R. (eds.) Post-Quantum Cryptography - 10th International Conference, vol. 11505, pp. 3\u201322. Springer, Chongqing, China (2019). https:\/\/doi.org\/10.1007\/978-3-030-25510-7_1","DOI":"10.1007\/978-3-030-25510-7_1"},{"key":"10162_CR15","doi-asserted-by":"publisher","unstructured":"Laarhoven, T., Mariano, A.: Progressive lattice sieving. In: Lange, T., Steinwandt, R. (eds.) Post-Quantum Cryptography - 9th International Conference, PQCrypto, vol. 10786, pp. 292\u2013311. Springer, Fort Lauderdale, FL, USA (2018). https:\/\/doi.org\/10.1007\/978-3-319-79063-3_14","DOI":"10.1007\/978-3-319-79063-3_14"},{"key":"10162_CR16","doi-asserted-by":"publisher","unstructured":"Laarhoven, T.: Sieving for shortest vectors in lattices using angular localitysensitive hashing. In: Gennaro, R., Robshaw, M. (eds.) Advances in Cryptology - CRYPTO 2015 - 35th Annual Cryptology Conference, vol. 9215, pp. 3\u201322. Springer, Santa Barbara, CA, USA (2015). https:\/\/doi.org\/10.1007\/978-3-662-47989-6_1","DOI":"10.1007\/978-3-662-47989-6_1"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-024-10162-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00224-024-10162-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-024-10162-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,5]],"date-time":"2024-04-05T04:02:29Z","timestamp":1712289749000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00224-024-10162-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,3,5]]},"references-count":16,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,4]]}},"alternative-id":["10162"],"URL":"https:\/\/doi.org\/10.1007\/s00224-024-10162-2","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"type":"print","value":"1432-4350"},{"type":"electronic","value":"1433-0490"}],"subject":[],"published":{"date-parts":[[2024,3,5]]},"assertion":[{"value":"11 January 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 March 2024","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}]}}