{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:51:27Z","timestamp":1740099087709,"version":"3.37.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319935621"},{"type":"electronic","value":"9783319935638"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-93563-8_4","type":"book-chapter","created":{"date-parts":[[2018,6,22]],"date-time":"2018-06-22T07:30:02Z","timestamp":1529652602000},"page":"39-50","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The Search Successive Minima Problem Is Equivalent to Its Optimization Version"],"prefix":"10.1007","author":[{"given":"Haoyu","family":"Li","sequence":"first","affiliation":[]},{"given":"Yanbin","family":"Pan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,6,23]]},"reference":[{"key":"4_CR1","doi-asserted-by":"publisher","unstructured":"Ajtai, M.: Generating hard instances of lattice problems (extended abstract). In: Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing, STOC 1996, pp. 99\u2013108. ACM, New York (1996). \nhttps:\/\/doi.org\/10.1145\/237814.237838","DOI":"10.1145\/237814.237838"},{"key":"4_CR2","doi-asserted-by":"publisher","unstructured":"Ajtai, M.: The shortest vector problem in L2 is NP-hard for randomized reductions (extended abstract). In: Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing, STOC 1998, pp. 10\u201319. ACM, New York (1998). \nhttps:\/\/doi.org\/10.1145\/276698.276705","DOI":"10.1145\/276698.276705"},{"key":"4_CR3","doi-asserted-by":"publisher","unstructured":"Ajtai, M., Dwork, C.: A public-key cryptosystem with worst-case\/average-case equivalence. In: Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, STOC 1997, pp. 284\u2013293. ACM, New York (1997). \nhttps:\/\/doi.org\/10.1145\/258533.258604","DOI":"10.1145\/258533.258604"},{"key":"4_CR4","unstructured":"Alkim, E., Bindel, N., Buchmann, J.A., Dagdelen, \u00d6., Schwabe, P.: TESLA: Tightly-Secure Efficient Signatures from Standard Lattices. IACR Cryptology ePrint Archive 2015, 755 (2015). \nhttps:\/\/eprint.iacr.org\/2015\/755.pdf"},{"key":"4_CR5","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). \nhttps:\/\/doi.org\/10.1007\/978-3-540-73420-8_8"},{"key":"4_CR6","unstructured":"Boas, P.V.E.: Another NP-complete problem and the complexity of computing short vectors in lattices. Mathematics Department Report 81-04. University of Amsterdam (1981)"},{"issue":"2","key":"4_CR7","doi-asserted-by":"publisher","first-page":"831","DOI":"10.1137\/120868669","volume":"43","author":"Z Brakerski","year":"2014","unstructured":"Brakerski, Z., Vaikuntanathan, V.: Efficient fully homomorphic encryption from (standard) LWE. SIAM J. Comput. 43(2), 831\u2013871 (2014). \nhttps:\/\/doi.org\/10.1137\/120868669","journal-title":"SIAM J. Comput."},{"key":"4_CR8","unstructured":"Cai, J.Y., Nerurkar, A.: Approximating the SVP to within a factor (1\u20131\/dim$$^\\epsilon $$\u03f5) is NP-hard under randomized conditions. In: Proceedings of the Thirteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat. No.98CB36247), pp. 46\u201355, June 1998"},{"key":"4_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1007\/978-3-642-40041-4_3","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"L Ducas","year":"2013","unstructured":"Ducas, L., Durmus, A., Lepoint, T., Lyubashevsky, V.: Lattice signatures and bimodal Gaussians. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013. LNCS, vol. 8042, pp. 40\u201356. Springer, Heidelberg (2013). \nhttps:\/\/doi.org\/10.1007\/978-3-642-40041-4_3"},{"key":"4_CR10","doi-asserted-by":"publisher","unstructured":"Gentry, C.: Fully homomorphic encryption using ideal lattices. In: Proceedings of the Forty-First Annual ACM Symposium on Theory of Computing, STOC 2009, pp. 169\u2013178. ACM, New York (2009). \nhttps:\/\/doi.org\/10.1145\/1536414.1536440","DOI":"10.1145\/1536414.1536440"},{"key":"4_CR11","doi-asserted-by":"publisher","unstructured":"Gentry, C., Peikert, C., Vaikuntanathan, V.: Trapdoors for hard lattices and new cryptographic constructions. In: Proceedings of the Fortieth Annual ACM Symposium on Theory of Computing, STOC 2008, pp. 197\u2013206. ACM, New York (2008). \nhttps:\/\/doi.org\/10.1145\/1374376.1374407","DOI":"10.1145\/1374376.1374407"},{"key":"4_CR12","unstructured":"Goldreich, O., Micciancio, D., Safra, S., Seifert, J.P.: Approximating shortest lattice vectors is not harder than approximating closest lattice vectors 71, 55\u201361 (1999). \nhttp:\/\/www.sciencedirect.com\/science\/article\/pii\/S0020019099000836"},{"key":"4_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/3-540-36563-X_9","volume-title":"Topics in Cryptology \u2014 CT-RSA 2003","author":"J Hoffstein","year":"2003","unstructured":"Hoffstein, J., Howgrave-Graham, N., Pipher, J., Silverman, J.H., Whyte, W.: NTRUSign: digital signatures using the NTRU lattice. In: Joye, M. (ed.) CT-RSA 2003. LNCS, vol. 2612, pp. 122\u2013140. Springer, Heidelberg (2003). \nhttps:\/\/doi.org\/10.1007\/3-540-36563-X_9"},{"key":"4_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/BFb0054868","volume-title":"Algorithmic Number Theory","author":"J Hoffstein","year":"1998","unstructured":"Hoffstein, J., Pipher, J., Silverman, J.H.: NTRU: a ring-based public key cryptosystem. In: Buhler, J.P. (ed.) ANTS 1998. LNCS, vol. 1423, pp. 267\u2013288. Springer, Heidelberg (1998). \nhttps:\/\/doi.org\/10.1007\/BFb0054868"},{"key":"4_CR15","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139020411","volume-title":"Matrix Analysis","author":"RA Horn","year":"2012","unstructured":"Horn, R.A., Johnson, C.R.: Matrix Analysis. Cambridge University Press, Cambridge (2012)"},{"key":"4_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/978-3-319-05149-9_3","volume-title":"Information Security Applications","author":"G Hu","year":"2014","unstructured":"Hu, G., Pan, Y.: Improvements on reductions among different variants of SVP and CVP. In: Kim, Y., Lee, H., Perrig, A. (eds.) WISA 2013. LNCS, vol. 8267, pp. 39\u201351. Springer, Cham (2014). \nhttps:\/\/doi.org\/10.1007\/978-3-319-05149-9_3"},{"issue":"2","key":"4_CR17","doi-asserted-by":"publisher","first-page":"762","DOI":"10.1137\/070704770","volume":"30","author":"ICF Ipsen","year":"2008","unstructured":"Ipsen, I.C.F., Rehman, R.: Perturbation bounds for determinants and characteristic polynomials. SIAM J. Matrix Anal. Appl. 30(2), 762\u2013776 (2008). \nhttps:\/\/doi.org\/10.1137\/070704770","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"3","key":"4_CR18","doi-asserted-by":"publisher","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. Math. Oper. Res. 12(3), 415\u2013440 (1987). \nhttps:\/\/doi.org\/10.1287\/moor.12.3.415","journal-title":"Math. Oper. Res."},{"key":"4_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/11787006_13","volume-title":"Automata, Languages and Programming","author":"V Lyubashevsky","year":"2006","unstructured":"Lyubashevsky, V., Micciancio, D.: Generalized compact knapsacks are collision resistant. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol. 4052, pp. 144\u2013155. Springer, Heidelberg (2006). \nhttps:\/\/doi.org\/10.1007\/11787006_13"},{"key":"4_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1007\/978-3-540-71039-4_4","volume-title":"Fast Software Encryption","author":"V Lyubashevsky","year":"2008","unstructured":"Lyubashevsky, V., Micciancio, D., Peikert, C., Rosen, A.: SWIFFT: a modest proposal for FFT hashing. In: Nyberg, K. (ed.) FSE 2008. LNCS, vol. 5086, pp. 54\u201372. Springer, Heidelberg (2008). \nhttps:\/\/doi.org\/10.1007\/978-3-540-71039-4_4"},{"key":"4_CR21","unstructured":"Micciancio, D.: Efficient reductions among lattice problems. In: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, pp. 84\u201393. Society for Industrial and Applied Mathematics, Philadelphia (2008). \nhttp:\/\/dl.acm.org\/citation.cfm?id=1347082.1347092"},{"key":"4_CR22","series-title":"The Kluwer International Series in Engineering and Computer Science","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. The Kluwer International Series in Engineering and Computer Science, vol. 671. Kluwer Academic Publishers, Boston (2002)"},{"key":"4_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/11681878_8","volume-title":"Theory of Cryptography","author":"C Peikert","year":"2006","unstructured":"Peikert, C., Rosen, A.: Efficient collision-resistant hashing from worst-case assumptions on cyclic lattices. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol. 3876, pp. 145\u2013166. Springer, Heidelberg (2006). \nhttps:\/\/doi.org\/10.1007\/11681878_8"},{"issue":"1","key":"4_CR24","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/S0377-0427(02)00396-5","volume":"143","author":"G Piazza","year":"2002","unstructured":"Piazza, G., Politi, T.: An upper bound for the condition number of a matrix in spectral norm. J. Comput. Appl. Math. 143(1), 141\u2013144 (2002). \nhttp:\/\/www.sciencedirect.com\/science\/article\/pii\/S0377042702003965","journal-title":"J. Comput. Appl. Math."},{"key":"4_CR25","doi-asserted-by":"publisher","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. In: Proceedings of the Thirty-Seventh Annual ACM Symposium on Theory of Computing, STOC 2005, pp. 84\u201393. ACM, New York (2005). \nhttps:\/\/doi.org\/10.1145\/1060590.1060603","DOI":"10.1145\/1060590.1060603"}],"container-title":["Lecture Notes in Computer Science","Information Security Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-93563-8_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,6,22]],"date-time":"2018-06-22T07:32:16Z","timestamp":1529652736000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-93563-8_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319935621","9783319935638"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-93563-8_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}