{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T12:48:34Z","timestamp":1649076514005},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2015,11,1]],"date-time":"2015-11-01T00:00:00Z","timestamp":1446336000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J. Comput. Sci. Technol."],"published-print":{"date-parts":[[2015,11]]},"DOI":"10.1007\/s11390-015-1604-4","type":"journal-article","created":{"date-parts":[[2015,11,25]],"date-time":"2015-11-25T07:49:50Z","timestamp":1448437790000},"page":"1370-1377","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Solving Closest Vector Instances Using an Approximate Shortest Independent Vectors Oracle"],"prefix":"10.1007","volume":"30","author":[{"given":"Cheng-Liang","family":"Tian","sequence":"first","affiliation":[]},{"given":"Wei","family":"Wei","sequence":"additional","affiliation":[]},{"given":"Dong-Dai","family":"Lin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,11,20]]},"reference":[{"issue":"2","key":"1604_CR1","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/S0020-0190(99)00083-6","volume":"71","author":"O Goldreich","year":"1999","unstructured":"Goldreich O, Micciancio D, Safra S, Seifert J P. Approximating shortest lattice vectors is not harder than approxi mating closest lattice vectors. Information Processing Letters, 1999, 71(2): 55\u201361.","journal-title":"Information Processing Letters"},{"issue":"2","key":"1604_CR2","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1007\/s00493-003-0019-y","volume":"23","author":"I Dinur","year":"2003","unstructured":"Dinur I, Kindler G, Raz R, Safra S. Approximating CVP to within almost-polynomial factors is NP-hard. Combinatorica, 2003, 23(2): 205\u2013243.","journal-title":"Combinatorica"},{"key":"1604_CR3","doi-asserted-by":"crossref","unstructured":"Haviv I, Regev O. Tensor-based hardness of the shortest vector problem to within almost polynomial factors. In Proc. the 39th Annual ACM Symp. Theory of Computing, June 2007, pp.469-477.","DOI":"10.1145\/1250790.1250859"},{"issue":"3","key":"1604_CR4","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1287\/moor.12.3.415","volume":"12","author":"R Kannan","year":"1987","unstructured":"Kannan R. Minkowski\u2019s convex body theorem and integer programming. Mathematics of Operations Research, 1987, 12(3): 415\u2013440.","journal-title":"Mathematics of Operations Research"},{"key":"1604_CR5","doi-asserted-by":"crossref","unstructured":"Ajtai M, Kumar R, Sivakumar D. Sampling short lattice vectors and the closest lattice vector problem. In Proc. the 17th IEEE Annual Conf. Computational Complexity, May 2002, pp.41-45.","DOI":"10.1109\/CCC.2002.1004339"},{"key":"1604_CR6","doi-asserted-by":"crossref","unstructured":"Kannan R. Algorithmic geometry of numbers. Annual Review of Computer Science, 1987, 2: 231\u2013267.","DOI":"10.1146\/annurev.cs.02.060187.001311"},{"issue":"1","key":"1604_CR7","doi-asserted-by":"crossref","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. Mathematische Annalen, 1993, 296(1): 625\u2013635.","journal-title":"Mathematische Annalen"},{"key":"1604_CR8","first-page":"577","volume-title":"Lecture Notes in Computer Science 5677","author":"V Lyubashevsky","year":"2009","unstructured":"Lyubashevsky V, Micciancio D. On bounded distance decoding, unique shortest vectors, and the minimum distance problem. In Lecture Notes in Computer Science 5677, Halevi S (ed.), Springer Berlin Heidelberg, 2009, pp.577-594."},{"key":"1604_CR9","doi-asserted-by":"crossref","unstructured":"Dubey C, Holenstein T. Approximating the closest vector problem using an approximate shortest vector oracle. In Lecture Notes in Computer Science 6845, Goldberg L A, Jansen K, Ravi R, Rolim J D P (eds.), Springer Berlin Heidelberg, 2011, pp.184-193.","DOI":"10.1007\/978-3-642-22935-0_16"},{"key":"1604_CR10","doi-asserted-by":"crossref","unstructured":"Ajtai M. Generating hard instances of lattice problems (extended abstract). In Proc. the 28th ACM Annual Symp. Theory of Computing, May 1996, pp.99-108.","DOI":"10.1145\/237814.237838"},{"key":"1604_CR11","doi-asserted-by":"crossref","unstructured":"Regev O. On lattices, learning with errors, random linear codes, and cryptography. In Proc. the 37th Annual ACM Symp. Theory of Computing, May 2005, pp.84-93.","DOI":"10.1145\/1060590.1060603"},{"key":"1604_CR12","doi-asserted-by":"crossref","unstructured":"Bl\u00f6mer J, Seifert J. On the complexity of computing short linearly independent vectors and short bases in a lattice. In Proc. the 31st Annual ACM Symp. Theory of Computing, May 1999, pp.711-720.","DOI":"10.1145\/301250.301441"},{"key":"1604_CR13","unstructured":"Micciancio D. Efficient reductions among lattice problems. In Proc. the 19th Annual ACM-SIAM Symp. Discrete Algorithms, January 2008, pp.84-93."},{"issue":"1","key":"1604_CR14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02579403","volume":"6","author":"L Babai","year":"1986","unstructured":"Babai L. On lov\u00e1sz lattice reduction and the nearest lattice point problem. Combinatorica, 1986, 6(1): 1\u201313.","journal-title":"Combinatorica"},{"key":"1604_CR15","doi-asserted-by":"crossref","unstructured":"Micciancio D, Goldwasser S. Complexity of Lattice Problems: A Cryptographic Perspective. Kluwer Academic Publishers, 2002.","DOI":"10.1007\/978-1-4615-0897-7"},{"key":"1604_CR16","unstructured":"Klein P. Finding the closest lattice vector when it\u2019s unusually close. In Proc. the 11th Annual ACM-SIAM Symp. Discrete Algorithms, January 2000, pp.937-941."},{"issue":"1","key":"1604_CR17","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/S0166-218X(02)00216-0","volume":"126","author":"J Cai","year":"2003","unstructured":"Cai J. A new transference theorem in the geometry of numbers and new bounds for Ajtai\u2019s connection factor. Discrete Applied Mathematics, 2003, 126(1): 9\u201331.","journal-title":"Discrete Applied Mathematics"},{"key":"1604_CR18","first-page":"185","volume-title":"Lecture Notes in Computer Science 6858","author":"D Micciancio","year":"2011","unstructured":"Micciancio D. The geometry of lattice cryptography. In Lecture Notes in Computer Science 6858, Aldini A, Gorrieri R (eds.), Springer Berlin Heidelberg, 2011, pp.185-210."},{"issue":"2","key":"1604_CR19","doi-asserted-by":"crossref","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. Computational Complexity, 2005, 14(2): 90\u2013121.","journal-title":"Computational Complexity"}],"container-title":["Journal of Computer Science and Technology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11390-015-1604-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11390-015-1604-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11390-015-1604-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,1]],"date-time":"2019-09-01T22:10:39Z","timestamp":1567375839000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11390-015-1604-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,11]]},"references-count":19,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2015,11]]}},"alternative-id":["1604"],"URL":"https:\/\/doi.org\/10.1007\/s11390-015-1604-4","relation":{},"ISSN":["1000-9000","1860-4749"],"issn-type":[{"value":"1000-9000","type":"print"},{"value":"1860-4749","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,11]]}}}