{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T20:11:35Z","timestamp":1743019895478,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319298139"},{"type":"electronic","value":"9783319298146"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-29814-6_4","type":"book-chapter","created":{"date-parts":[[2016,3,7]],"date-time":"2016-03-07T09:04:46Z","timestamp":1457341486000},"page":"37-49","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On Promise Problem of the Generalized Shortest Vector Problem"],"prefix":"10.1007","author":[{"given":"Wenwen","family":"Wang","sequence":"first","affiliation":[]},{"given":"Kewei","family":"Lv","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,3,5]]},"reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Ajtai, M.: The shortest vector problem in l2 is NP-hard for randomized reductions. In: 30th ACM Symposium on Theory of Computing, pp. 10\u201319 (1998)","DOI":"10.1145\/276698.276705"},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"Ajtai, M., Kumar, R., Sivakumar, D.: A sieve algorithm for the shortest lattice vector problem. In: Proceedings of the 33th ACM Symposium on Theory of Computing, pp. 601\u2013610 (2001)","DOI":"10.1145\/380752.380857"},{"issue":"5","key":"4_CR3","doi-asserted-by":"publisher","first-page":"749","DOI":"10.1145\/1089023.1089025","volume":"52","author":"D Aharonov","year":"2005","unstructured":"Aharonov, D., Regev, O.: Lattice problems in NP intersect coNP. J. ACM 52(5), 749\u2013765 (2005). Preliminary version in FOCS04","journal-title":"J. ACM"},{"key":"4_CR4","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\u2013635 (1993)","journal-title":"Math. Ann."},{"key":"4_CR5","doi-asserted-by":"publisher","first-page":"1648","DOI":"10.1016\/j.tcs.2008.12.045","volume":"410","author":"J Bl\u00f6mer","year":"2009","unstructured":"Bl\u00f6mer, J., Naewe, S.: Sampling methods for shortest vectors, closest vectors and successive minima. Theor. Comput. Sci. 410, 1648\u20131665 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"4_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/978-3-540-73420-8_8","volume-title":"Automata, Languages and Programming","author":"J Bl\u00f6mer","year":"2007","unstructured":"Bl\u00f6mer, J., Naewe, S.: Sampling methods for shortest vectors, closest vectors and successive minima. In: Arge, L., Cachin, C., Jurdzi\u0144ski, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol. 4596, pp. 65\u201377. Springer, Heidelberg (2007)"},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"Bl\u00f6er, J., Seifert, J.P.: On the complexity of computing short linearly independent vectors and short bases in a lattice. In: Thirty-First Annual ACM Symposium on Theory of Computing, pp. 711\u2013720. ACM (1999)","DOI":"10.1145\/301250.301441"},{"key":"4_CR8","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/0020-0190(87)90232-8","volume":"25","author":"R Boppana","year":"1987","unstructured":"Boppana, R., H\u00e5stad, J., Zachos, S.: Does co-NP have short interactive proofs? Inf. Process. Lett. 25, 127\u2013132 (1987)","journal-title":"Inf. Process. Lett."},{"key":"4_CR9","unstructured":"Cai, J.Y.: A New Transference Theorem and Applications to Ajtais Connection Factor, Electronic Colloquium on Computational Complexity, TR, pp. 98\u201305 (1998)"},{"key":"4_CR10","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/S0166-218X(02)00216-0","volume":"126","author":"JY Cai","year":"2003","unstructured":"Cai, J.Y.: A new transference theorem in the geometry of numbers and new bounds for Ajtais connection factor. Discrete Appl. Math. 126, 9\u201331 (2003)","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"4_CR11","doi-asserted-by":"publisher","first-page":"540","DOI":"10.1006\/jcss.1999.1686","volume":"60","author":"O Goldreich","year":"2000","unstructured":"Goldreich, O., Goldwasser, S.: On the limits of nonapproximability of lattice problems. J. Comput. Syst. Sci. 60(3), 540\u2013563 (2000)","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"4_CR12","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 on lattices and codes. Comput. Complexity 14(2), 90\u2013121 (2005). Preliminary version in CCC 2004","journal-title":"Comput. Complexity"},{"key":"4_CR13","doi-asserted-by":"publisher","first-page":"513","DOI":"10.4086\/toc.2012.v008a023","volume":"8","author":"I Haviv","year":"2012","unstructured":"Haviv, I., Regev, O.: Tensor-based hardness of the shortest vector problem to within almost polynomial factors. Theory Comput. 8, 513\u2013531 (2012)","journal-title":"Theory Comput."},{"issue":"5","key":"4_CR14","doi-asserted-by":"publisher","first-page":"789","DOI":"10.1145\/1089023.1089027","volume":"52","author":"S Khot","year":"2005","unstructured":"Khot, S.: Hardness of approximating the shortest vector problem in lattices. J. ACM 52(5), 789\u2013808 (2005)","journal-title":"J. ACM"},{"key":"4_CR15","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/BF02128669","volume":"10","author":"C Lgarias","year":"1990","unstructured":"Lgarias, C., Lenstra, H., Schnorr, C.P.: Korkin-Zolotarev bases and successive minima of a lattice and its reciprocial lattice. Combinatorica 10, 333\u2013348 (1990)","journal-title":"Combinatorica"},{"key":"4_CR16","unstructured":"Micciancio, D.: Efficient reductions among lattice problems. In: 19th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, pp. 84\u201393. Society for Industrial and Applied Mathematics (2008)"},{"key":"4_CR17","unstructured":"Regev, O.: Lecture Note on Lattices in Computer Science. Lecture 8: Dual Lattice (2004)"}],"container-title":["Lecture Notes in Computer Science","Information and Communications Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-29814-6_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,16]],"date-time":"2021-06-16T06:13:25Z","timestamp":1623824005000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-29814-6_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319298139","9783319298146"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-29814-6_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"5 March 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}