{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T05:04:32Z","timestamp":1725771872474},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642546303"},{"type":"electronic","value":"9783642546310"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-642-54631-0_23","type":"book-chapter","created":{"date-parts":[[2014,2,20]],"date-time":"2014-02-20T05:04:17Z","timestamp":1392872657000},"page":"399-410","source":"Crossref","is-referenced-by-count":0,"title":["Solving Random Subset Sum Problem by l p -norm SVP Oracle"],"prefix":"10.1007","author":[{"given":"Gengran","family":"Hu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yanbin","family":"Pan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Feng","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"23_CR1","first-page":"99","volume-title":"STOC 1996","author":"M. Ajtai","year":"1996","unstructured":"Ajtai, M.: Gennerating hard instances of lattice problems. In: STOC 1996, pp. 99\u2013108. ACM Press, New York (1996)"},{"key":"23_CR2","first-page":"284","volume-title":"STOC 1997","author":"M. Ajtai","year":"1997","unstructured":"Ajtai, M., Dwork, C.: A public-key cryptosystem with worst-case\/average-case equivalence. In: STOC 1997, pp. 284\u2013293. ACM Press, New York (1997)"},{"key":"23_CR3","first-page":"266","volume-title":"30th Annual ACM Symposium on Theory of Computing","author":"M. Ajtai","year":"1998","unstructured":"Ajtai, M.: The shortest vector problem in L2 is NP-hard for randomized reductions(extended abstract). In: 30th Annual ACM Symposium on Theory of Computing, pp. 266\u2013275. ACM Press, New York (1998)"},{"issue":"1","key":"23_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02579403","volume":"6","author":"L. Babai","year":"1986","unstructured":"Babai, L.: On Lovasz\u2019 lattice reduction and the nearest lattice point problem. Combinatorica\u00a06(1), 1\u201313 (1986)","journal-title":"Combinatorica"},{"key":"23_CR5","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/BF01201999","volume":"2","author":"M.J. Coster","year":"1992","unstructured":"Coster, M.J., Joux, A., Lamacchia, B.A., Odlyzko, A.M., Schnorr, C.P., Stern, J.: An improved low-density subset sum algorithm. Computational Complexity\u00a02, 111\u2013128 (1992)","journal-title":"Computational Complexity"},{"doi-asserted-by":"crossref","unstructured":"Dadush, D., Peikert, C., Vempala, S.: Enumerative lattice algorithms in any norm via M -ellipsoid coverings. In: FOCS 2011, pp. 580\u2013589. IEEE Computer Society Press (2011)","key":"23_CR6","DOI":"10.1109\/FOCS.2011.31"},{"key":"23_CR7","doi-asserted-by":"publisher","first-page":"550","DOI":"10.1137\/0218037","volume":"18","author":"A.M. Frieze","year":"1989","unstructured":"Frieze, A.M.: On the Lagarias-Odlyzko algorithm for the subset sum problem. SIAM J. Comput.\u00a018, 550\u2013558 (1989)","journal-title":"SIAM J. Comput."},{"key":"23_CR8","first-page":"169","volume-title":"STOC 2009","author":"C. Gentry","year":"2009","unstructured":"Gentry, C.: Fully homomorphic encryption using ideal lattices. In: STOC 2009, pp. 169\u2013178. ACM Press, New York (2009)"},{"key":"23_CR9","first-page":"197","volume-title":"STOC 2008","author":"C. Gentry","year":"2008","unstructured":"Gentry, C., Peikert, C., Vaikuntanathan, V.: Trapdoors for hard lattices and new cryptographic constructions. In: STOC 2008, pp. 197\u2013206. ACM Press, New York (2008)"},{"issue":"2","key":"23_CR10","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/S0020-0190(99)00083-6","volume":"71","author":"D. Goldreich","year":"1999","unstructured":"Goldreich, D., Micciancio, D., Safra, S., Seifert, J.P.: Approximating shortest lattice vectors is not harder than approximating closest lattice vectors. Information Processing Letters\u00a071(2), 55\u201361 (1999)","journal-title":"Information Processing Letters"},{"key":"23_CR11","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.\u00a01423, pp. 267\u2013288. Springer, Heidelberg (1998)"},{"key":"23_CR12","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 - 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.\u00a02612, pp. 122\u2013140. Springer, Heidelberg (2003)"},{"key":"23_CR13","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/s001459900012","volume":"9","author":"R. Impagliazzo","year":"1996","unstructured":"Impagliazzo, R., Naor, M.: Efficient Cryptographic Schemes Provably as Secure as Subset Sum. Journal of Cryptology\u00a09, 199\u2013216 (1996)","journal-title":"Journal of Cryptology"},{"key":"23_CR14","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1007\/BF01457454","volume":"261","author":"A.K. Lenstra","year":"1982","unstructured":"Lenstra, A.K., Lenstra Jr., H.W., Lovasz, L.: Factoring polynomials with rational coefficients. Mathematische Annalen\u00a0261, 513\u2013534 (1982)","journal-title":"Mathematische Annalen"},{"issue":"1","key":"23_CR15","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1145\/2455.2461","volume":"32","author":"J.C. Lagarias","year":"1985","unstructured":"Lagarias, J.C., Odlyzko, A.M.: Solving low-density subset sum problems. J. Assoc. Comp. Mach.\u00a032(1), 229\u2013246 (1985)","journal-title":"J. Assoc. Comp. Mach."},{"key":"23_CR16","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.\u00a05086, pp. 54\u201372. Springer, Heidelberg (2008)"},{"doi-asserted-by":"crossref","unstructured":"Micciancio, D., Goldwasser, S.: Complexity of Lattice Problems: A Cryptography Perspective. Kluwer Academic Publishes (2002)","key":"23_CR17","DOI":"10.1007\/978-1-4615-0897-7"},{"key":"23_CR18","first-page":"351","volume-title":"STOC 2010","author":"D. Micciancio","year":"2010","unstructured":"Micciancio, D., Voulgaris, P.: A deterministic single exponential time algorithm for most lattice problems based on Voronoi cell computations. In: STOC 2010, pp. 351\u2013358. ACM Press, New York (2010)"},{"issue":"1","key":"23_CR19","doi-asserted-by":"publisher","first-page":"487","DOI":"10.4086\/toc.2012.v008a022","volume":"8","author":"D. Micciancio","year":"2012","unstructured":"Micciancio, D.: Inapproximability of the Shortest Vector Problem: Toward a Deterministic Reduction. Theory of Computing\u00a08(1), 487\u2013512 (2012)","journal-title":"Theory of Computing"},{"unstructured":"Regev, O.: Lattices in computer science. Lecture notes of a course given in Tel Aviv University (2004)","key":"23_CR20"},{"key":"23_CR21","first-page":"84","volume-title":"STOC 2005","author":"O. Regev","year":"2005","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. In: STOC 2005, pp. 84\u201393. ACM Press, New York (2005)"},{"key":"23_CR22","first-page":"447","volume-title":"STOC 2006","author":"O. Regev","year":"2006","unstructured":"Regev, O., Rosen, R.: Lattice problems and norm embeddings. In: STOC 2006, pp. 447\u2013456. ACM Press, New York (2006)"}],"container-title":["Lecture Notes in Computer Science","Public-Key Cryptography \u2013 PKC 2014"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-54631-0_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T04:44:22Z","timestamp":1558845862000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-54631-0_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783642546303","9783642546310"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-54631-0_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}