{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,8]],"date-time":"2026-10-08T04:36:17Z","timestamp":1791434177333,"version":"4.3.3"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2017,8,28]],"date-time":"2017-08-28T00:00:00Z","timestamp":1503878400000},"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 Cryptol"],"published-print":{"date-parts":[[2018,4]]},"DOI":"10.1007\/s00145-017-9265-9","type":"journal-article","created":{"date-parts":[[2017,8,28]],"date-time":"2017-08-28T20:04:10Z","timestamp":1503950650000},"page":"610-640","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":69,"title":["Improved Security Proofs in Lattice-Based Cryptography: Using the R\u00e9nyi Divergence Rather than the Statistical Distance"],"prefix":"10.1007","volume":"31","author":[{"given":"Shi","family":"Bai","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tancr\u00e8de","family":"Lepoint","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Adeline","family":"Roux-Langlois","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Amin","family":"Sakzad","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Damien","family":"Stehl\u00e9","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ron","family":"Steinfeld","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2017,8,28]]},"reference":[{"key":"9265_CR1","unstructured":"E.\u00a0Alkim, L.\u00a0Ducas, T. P\u00f6ppelmann, P.\u00a0Schwabe, Post-quantum key exchange\u2014a new hope, in 25th USENIX Security Symposium (USENIX Security 16) (USENIX Association, Austin, 2016), pp. 327\u2013343"},{"key":"9265_CR2","doi-asserted-by":"crossref","unstructured":"M.\u00a0Ajtai, Generating hard instances of lattice problems (extended abstract), in Proceedings of STOC (ACM, 1996), pp. 99\u2013108","DOI":"10.1145\/237814.237838"},{"key":"9265_CR3","doi-asserted-by":"crossref","unstructured":"J.\u00a0Alwen, S.\u00a0Krenn, K.\u00a0Pietrzak, D.\u00a0Wichs, Learning with rounding, revisited\u2014new reduction, properties and applications, in Proceedings of CRYPTO. LNCS, vol. 8042 (Springer, 2013), pp. 57\u201374","DOI":"10.1007\/978-3-642-40041-4_4"},{"key":"9265_CR4","doi-asserted-by":"crossref","unstructured":"A.\u00a0Bogdanov, S.\u00a0Guo, D.\u00a0Masny, S.\u00a0Richelson, A.\u00a0Rosen, On the hardness of learning with rounding over small modulus, in Proceedings of TCC A. LNCS, vol. 9562 (Springer, 2016), pp. 209\u2013224","DOI":"10.1007\/978-3-662-49096-9_9"},{"key":"9265_CR5","doi-asserted-by":"crossref","unstructured":"S.\u00a0Bai, A.\u00a0Langlois, T.\u00a0Lepoint, D.\u00a0Stehl\u00e9, R.\u00a0Steinfeld, Improved security proofs in lattice-based cryptography: using the R\u00e9nyi divergence rather than the statistical distance, in Proceedings of ASIACRYPT, Part I. LNCS, vol. 9452 (Springer, 2015), pp. 3\u201324","DOI":"10.1007\/978-3-662-48797-6_1"},{"key":"9265_CR6","doi-asserted-by":"crossref","unstructured":"Z.\u00a0Brakerski, A.\u00a0Langlois, C.\u00a0Peikert, O.\u00a0Regev, D.\u00a0Stehl\u00e9, Classical hardness of learning with errors, in Proceedings of STOC (ACM, 2013), pp. 575\u2013584","DOI":"10.1145\/2488608.2488680"},{"key":"9265_CR7","doi-asserted-by":"crossref","unstructured":"A.\u00a0Banerjee, C.\u00a0Peikert, A.\u00a0Rosen, Pseudorandom functions and lattices, in Proceedings of EUROCRYPT. LNCS, vol. 7237 (Springer, 2012), pp. 719\u2013737","DOI":"10.1007\/978-3-642-29011-4_42"},{"key":"9265_CR8","doi-asserted-by":"crossref","unstructured":"Z.\u00a0Brakerski, V.\u00a0Vaikuntanathan, Efficient fully homomorphic encryption from (standard) LWE, in Proceedings of FOCS (IEEE Computer Society Press, 2011), pp. 97\u2013106","DOI":"10.1109\/FOCS.2011.12"},{"key":"9265_CR9","doi-asserted-by":"crossref","unstructured":"M.\u00a0Chiani, D.\u00a0Dardari, M.K. Simon, New exponential bounds and approximations for the computation of error probability in fading channels. IEEE Trans. Wireless. Commun.\n                    2(4):840\u2013845 (2003)","DOI":"10.1109\/TWC.2003.814350"},{"key":"9265_CR10","unstructured":"C.-W. Chow, On Algorithmic Aspects of the Learning with Errors Problem and Its Variants, Masters thesis, The Chinese University of Hong Kong (2003)"},{"key":"9265_CR11","doi-asserted-by":"crossref","unstructured":"L.\u00a0Ducas, A.\u00a0Durmus, T.\u00a0Lepoint, V.\u00a0Lyubashevsky, Lattice signatures and bimodal Gaussians, in Proceedings of CRYPTO. LNCS, vol. 8042 (Springer, 2013), pp. 40\u201356","DOI":"10.1007\/978-3-642-40041-4_3"},{"key":"9265_CR12","doi-asserted-by":"crossref","unstructured":"N.\u00a0D\u00f6ttling, J.\u00a0M\u00fcller-Quade, Lossy codes and a new variant of the learning-with-errors problem, in Proceedings of EUROCRYPT. LNCS, (Springer, 2013), pp. 18\u201334","DOI":"10.1007\/978-3-642-38348-9_2"},{"key":"9265_CR13","unstructured":"L.\u00a0Ducas, Accelerating Bliss: The Geometry of Ternary Polynomials. Cryptology ePrint Archive, Report 2014\/874 (2014). \n                    http:\/\/eprint.iacr.org\/"},{"key":"9265_CR14","doi-asserted-by":"crossref","unstructured":"S.\u00a0Garg, C.\u00a0Gentry, S.\u00a0Halevi, Candidate multilinear maps from ideal lattices, in Proceedings of EUROCRYPT. LNCS, vol. 7881 (Springer, 2013), pp. 1\u201317","DOI":"10.1007\/978-3-642-38348-9_1"},{"key":"9265_CR15","unstructured":"S.\u00a0Goldwasser, Y.T. Kalai, C.\u00a0Peikert, V.\u00a0Vaikuntanathan, Robustness of the learning with errors assumption, in Proceedings of ICS (Tsinghua University Press, 2010), pp. 230\u2013240"},{"key":"9265_CR16","doi-asserted-by":"crossref","unstructured":"C.\u00a0Gentry, C.\u00a0Peikert, V.\u00a0Vaikuntanathan, Trapdoors for hard lattices and new cryptographic constructions, in Proceedings of STOC (ACM, 2008), pp. 197\u2013206","DOI":"10.1145\/1374376.1374407"},{"key":"9265_CR17","doi-asserted-by":"crossref","unstructured":"W. Hoeffding, Probability inequalities for sums of bounded random variables. J. Am. Stat. Assoc.\u00a058(301):13\u201330 (1963)","DOI":"10.1080\/01621459.1963.10500830"},{"key":"9265_CR18","unstructured":"B.\u00a0Libert, S.\u00a0Ling, F.\u00a0Mouhartem, K.\u00a0Nguyen, H.\u00a0Wang, Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions. Cryptology ePrint Archive, Report 2016\/101 (2016). \n                    http:\/\/eprint.iacr.org\/"},{"key":"9265_CR19","doi-asserted-by":"crossref","unstructured":"V.\u00a0Lyubashevsky, C.\u00a0Peikert, O.\u00a0Regev, On ideal lattices and learning with errors over rings. J. ACM\u00a060(6):43 (2013)","DOI":"10.1145\/2535925"},{"key":"9265_CR20","doi-asserted-by":"crossref","unstructured":"S.\u00a0Ling, D.H. Phan, D.\u00a0Stehl\u00e9, R.\u00a0Steinfeld, Hardness of \n                    \n                      \n                    \n                    $$k$$\n                    \n                      \n                        k\n                      \n                    \n                  -LWE and applications in traitor tracing, in Proceedings of CRYPTO, Part I. LNCS, vol. 8616 (Springer, 2014), pp. 315\u2013334. Full version available at\u00a0\n                    http:\/\/eprint.iacr.org\/2014\/494","DOI":"10.1007\/978-3-662-44371-2_18"},{"key":"9265_CR21","doi-asserted-by":"crossref","unstructured":"A.\u00a0Langlois, D.\u00a0Stehl\u00e9, R.\u00a0Steinfeld, GGHLite: more efficient multilinear maps from ideal lattices, in Proceedings of EUROCRYPT. LNCS (Springer, 2014), pp. 239\u2013256. Full version available at\u00a0\n                    http:\/\/eprint.iacr.org\/2014\/487","DOI":"10.1007\/978-3-642-55220-5_14"},{"key":"9265_CR22","doi-asserted-by":"crossref","unstructured":"V.\u00a0Lyubashevsky, Lattice signatures without trapdoors, in Proceedings of EUROCRYPT. LNCS, vol. 7237, ed. By D. Pointcheval, T. Johansson (Springer, 2012), pp. 738\u2013755","DOI":"10.1007\/978-3-642-29011-4_43"},{"key":"9265_CR23","doi-asserted-by":"crossref","unstructured":"D.\u00a0Micciancio, P.\u00a0Mol. Pseudorandom knapsacks and the sample complexity of LWE search-to-decision reductions, in Proceeding of CRYPTO. LNCS, vol. 6841 (Springer, 2011), pp. 465\u2013484","DOI":"10.1007\/978-3-642-22792-9_26"},{"key":"9265_CR24","doi-asserted-by":"crossref","unstructured":"D.\u00a0Micciancio, C.\u00a0Peikert. Hardness of SIS and LWE with small parameters, in Proceeding of CRYPTO. LNCS, vol. 8042 (Springer, 2013) pp. 21\u201339","DOI":"10.1007\/978-3-642-40041-4_2"},{"key":"9265_CR25","doi-asserted-by":"crossref","unstructured":"D.\u00a0Micciancio, O.\u00a0Regev, Worst-case to average-case reductions based on Gaussian measures. SIAM J. Comput.\u00a037(1):267\u2013302 (2007)","DOI":"10.1137\/S0097539705447360"},{"key":"9265_CR26","doi-asserted-by":"crossref","unstructured":"D.\u00a0Micciancio, O.\u00a0Regev, Lattice-based cryptography, in Post-Quantum Cryptography, ed By D.J.\u00a0Bernstein, J.\u00a0Buchmann, E.\u00a0Dahmen (Springer, 2009), pp. 147\u2013191","DOI":"10.1007\/978-3-540-88702-7_5"},{"key":"9265_CR27","unstructured":"T.\u00a0P\u00f6ppelmann, L.\u00a0Ducas, T.\u00a0G\u00fcneysu, Enhanced lattice-based signatures on reconfigurable hardware, in Proceeding of CHES (2014), pp. 353\u2013370"},{"key":"9265_CR28","doi-asserted-by":"crossref","unstructured":"C.\u00a0Peikert, Public-key cryptosystems from the worst-case shortest vector problem, in Proceeding of STOC (ACM, 2009), pp. 333\u2013342","DOI":"10.1145\/1536414.1536461"},{"key":"9265_CR29","unstructured":"C.\u00a0Peikert, A Decade of Lattice Cryptography. Cryptology ePrint Archive, Report 2015\/939 (2015). \n                    http:\/\/eprint.iacr.org\/"},{"key":"9265_CR30","unstructured":"O.\u00a0Regev, On lattices, learning with errors, random linear codes, and cryptography, in Proceeding of STOC (2005), pp. 84\u201393"},{"key":"9265_CR31","unstructured":"O.\u00a0Regev, Lecture Notes of Lattices in Computer Science, Computer Science Tel Aviv University (2009). Available at \n                    http:\/\/www.cims.nyu.edu\/~regev"},{"key":"9265_CR32","doi-asserted-by":"crossref","unstructured":"O.\u00a0Regev, On lattices, learning with errors, random linear codes, and cryptography. J. ACM,\u00a056(6) (2009)","DOI":"10.1145\/1568318.1568324"},{"key":"9265_CR33","unstructured":"A.\u00a0R\u00e9nyi, On measures of entropy and information, in Proceeding of the Fourth Berkeley Symposium on Mathematical Statistics and Probability, vol.\u00a01 (1961), pp. 547\u2013561"},{"key":"9265_CR34","doi-asserted-by":"crossref","unstructured":"K.\u00a0Takashima, A.\u00a0Takayasu, Tighter security for efficient lattice cryptography via the r\u00e9nyi divergence of optimized orders, in Proceeding of ProvSec. LNCS (Springer, 2015), pp. 412\u2013431","DOI":"10.1007\/978-3-319-26059-4_23"},{"key":"9265_CR35","doi-asserted-by":"crossref","unstructured":"T.\u00a0van Erven, P.\u00a0Harremoes, R\u00e9nyi divergence and Kullback\u2013Leibler divergence. IEEE Trans. Inf. Theory\u00a060(7):3797\u20133820 (2014)","DOI":"10.1109\/TIT.2014.2320500"}],"container-title":["Journal of Cryptology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00145-017-9265-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-017-9265-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-017-9265-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,8]],"date-time":"2020-04-08T08:05:42Z","timestamp":1586333142000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00145-017-9265-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,8,28]]},"references-count":35,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2018,4]]}},"alternative-id":["9265"],"URL":"https:\/\/doi.org\/10.1007\/s00145-017-9265-9","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"value":"0933-2790","type":"print"},{"value":"1432-1378","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,8,28]]},"assertion":[{"value":"19 May 2016","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 July 2017","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 August 2017","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}