{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,21]],"date-time":"2026-05-21T14:07:37Z","timestamp":1779372457689,"version":"3.53.1"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2026,5,21]],"date-time":"2026-05-21T00:00:00Z","timestamp":1779321600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,5,21]],"date-time":"2026-05-21T00:00:00Z","timestamp":1779321600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Syst Sci Complex"],"published-print":{"date-parts":[[2026,8]]},"DOI":"10.1007\/s11424-026-4537-9","type":"journal-article","created":{"date-parts":[[2026,5,21]],"date-time":"2026-05-21T13:22:10Z","timestamp":1779369730000},"page":"1815-1838","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Monotonic Optimization with Application to the Selection of Parameters for LWE-Based Encryption Schemes"],"prefix":"10.1007","volume":"39","author":[{"given":"Juan","family":"Xu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wenyuan","family":"Wu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yong","family":"Feng","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rina","family":"Dong","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,5,21]]},"reference":[{"issue":"3","key":"4537_CR1","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1080\/02331930108844530","volume":"49","author":"A Rubinov","year":"2001","unstructured":"Rubinov A, Tuy H, and Mays H, An algorithm for monotonic global optimization problems, Optimization, 2001, 49(3): 205\u2013221.","journal-title":"Optimization"},{"issue":"2","key":"4537_CR2","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1137\/S1052623499359828","volume":"11","author":"H Tuy","year":"2000","unstructured":"Tuy H, Monotonic optimization: Problems and solution approaches, SIAM J. Optim., 2000, 11(2): 464\u2013494.","journal-title":"SIAM J. Optim."},{"key":"4537_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-31484-6","volume-title":"Convex Analysis and Global Optimization","author":"H Tuy","year":"2016","unstructured":"Tuy H, Convex Analysis and Global Optimization, Springer International Publishing, New York, 2016."},{"key":"4537_CR4","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/0-387-25570-2_2","volume-title":"Essays and Surveys in Global Optimization","author":"H Tuy","year":"2005","unstructured":"Tuy H, Al-Khayyal F, and Thach P T, Monotonic optimization: Branch and cut methods, Essays and Surveys in Global Optimization, Springer, New York, 2005, 39\u201378."},{"key":"4537_CR5","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1007\/s10898-009-9475-2","volume":"47","author":"H Tuy","year":"2010","unstructured":"Tuy H, D(C)-optimization and robust global optimization, J. Glob. Optim., 2010, 47: 485\u2013501.","journal-title":"J. Glob. Optim."},{"key":"4537_CR6","series-title":"PhD Thesis","volume-title":"Efficient globally optimal resource allocation in wireless interference networks","author":"B Matthiesen","year":"2019","unstructured":"Matthiesen B, Efficient globally optimal resource allocation in wireless interference networks, PhD Thesis, Technische Universit\u00e4t Dresden, Dresden, 2019."},{"issue":"1","key":"4537_CR7","first-page":"1","volume":"7","author":"Y J Zhang","year":"2012","unstructured":"Zhang Y J, Qian L, Huang J, et al. Monotonic optimization in communication and networking systems, Now Foundations and Trends, 2012, 7(1): 1\u201375.","journal-title":"Now Foundations and Trends"},{"issue":"23","key":"4537_CR8","first-page":"113","volume":"9","author":"E Bj\u00f6rnson","year":"2012","unstructured":"Bj\u00f6rnson E and Jorswieck E, Optimal resource allocation in coordinated multi-cell systems, Now Foundations and Trends, 2012, 9(23): 113\u2013381.","journal-title":"Now Foundations and Trends"},{"issue":"4","key":"4537_CR9","doi-asserted-by":"publisher","first-page":"1899","DOI":"10.1109\/TSP.2011.2182343","volume":"60","author":"W Utschick","year":"2012","unstructured":"Utschick W and Brehmer J, Monotonic optimization framework for coordinated beamforming in multicell networks, IEEE Transactions on Signal Processing, 2012, 60(4): 1899\u20131909.","journal-title":"IEEE Transactions on Signal Processing"},{"issue":"6","key":"4537_CR10","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1145\/1568318.1568324","volume":"56","author":"O Regev","year":"2009","unstructured":"Regev O, On lattices, learning with errors, random linear codes, and cryptography, J. ACM, 2009, 56(6): 34, arXiv: 2401.03703.","journal-title":"J. ACM"},{"issue":"6","key":"4537_CR11","doi-asserted-by":"publisher","first-page":"43.1","DOI":"10.1145\/2535925","volume":"60","author":"V Lyubashevsky","year":"2013","unstructured":"Lyubashevsky V, Peikert C, and Regev O, On ideal lattices and learning with errors over rings, J. ACM, 2013, 60(6): 43.1\u201343.35.","journal-title":"J. ACM"},{"issue":"3","key":"4537_CR12","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1515\/jmc-2015-0016","volume":"9","author":"M R Albrecht","year":"2015","unstructured":"Albrecht M R, Player R, and Scott S, On the concrete hardness of learning with errors, J. Math. Cryptol., 2015, 9(3): 169\u2013203.","journal-title":"J. Math. Cryptol."},{"key":"4537_CR13","first-page":"293","volume-title":"Information Security and Cryptology \u2013 ICISC 2013","author":"M R Albrecht","year":"2013","unstructured":"Albrecht M R, Fitzpatrick R, and G\u00f6pfert F, On the efficacy of solving LWE by reduction to Unique-SVP, Edited by Lee H S and Han D G, Information Security and Cryptology \u2013 ICISC 2013, Springer International Publishing, Cham, 2013, 293\u2013310."},{"key":"4537_CR14","first-page":"297","volume-title":"Advances in Cryptology \u2013 ASIACRYPT","author":"M R Albrecht","year":"2017","unstructured":"M R Albrecht, G\u00f6pfert F, Virdia F, et al., Revisiting the expected cost of solving uSVP and applications to LWE, Edited by Takagi T and Peyrin T, Advances in Cryptology \u2013 ASIACRYPT, Springer International Publishing, Cham, 2017, 297\u2013322."},{"issue":"5","key":"4537_CR15","doi-asserted-by":"publisher","first-page":"2240","DOI":"10.1007\/s11424-024-3221-1","volume":"37","author":"G Ma","year":"2024","unstructured":"Ma G and Li H, On the security of homomorphic encryption schemes with restricted decryption oracles, Journal of Systems Science & Complexity, 2024, 37(5): 2240\u20132261.","journal-title":"Journal of Systems Science & Complexity"},{"key":"4537_CR16","doi-asserted-by":"publisher","unstructured":"Bossuat J P, Cammarota R, Chillotti I, et al., Security guidelines for implementing homomorphic encryption, IACR Communications in Cryptology, 2025, 1(4), https:\/\/doi.org\/10.62056\/anxra69p1.","DOI":"10.62056\/anxra69p1"},{"key":"4537_CR17","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/978-3-030-77287-1_2","volume-title":"Protecting Privacy Through Homomorphic Encryption","author":"M Albrecht","year":"2021","unstructured":"Albrecht M, Chase M, Chen H, et al., Homomorphic encryption standard, Protecting Privacy Through Homomorphic Encryption, 2021, 31\u201362."},{"key":"4537_CR18","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/BF02328447","volume":"2","author":"W T Wu","year":"1986","unstructured":"Wu W T, Basic principles of mechanical theorem proving in elementary geometries, J. Autom. Reasoning., 1986, 2: 221\u2013252.","journal-title":"J. Autom. Reasoning."},{"issue":"4","key":"4537_CR19","doi-asserted-by":"publisher","first-page":"802","DOI":"10.1007\/s11424-012-2048-3","volume":"2","author":"J Jiang","year":"2012","unstructured":"Jiang J and Zhang J, A review and prospect of readable machine proofs for geometry theorems, Journal of Systems Science & Complexity, 2012, 2(4): 802\u2013820.","journal-title":"Journal of Systems Science & Complexity"},{"key":"4537_CR20","doi-asserted-by":"publisher","first-page":"2529","DOI":"10.1109\/TSP.2020.2983284","volume":"68","author":"B Matthiesen","year":"2020","unstructured":"Matthiesen B, Hellings C, Jorswieck E A, et al., Mixed monotonic programming for fast global optimization, IEEE Trans. Signal Process., 2020, 68: 2529\u20132544.","journal-title":"IEEE Trans. Signal Process."},{"issue":"1","key":"4537_CR21","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/j.jlap.2004.07.006","volume":"64","author":"C Li","year":"2005","unstructured":"Li C, Pion S, and Yap C, Recent progress in exact geometric computation, J. Logic Algebraic Program., 2005, 64(1): 85\u2013111.","journal-title":"J. Logic Algebraic Program."},{"key":"4537_CR22","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/978-3-319-98113-0_19","volume-title":"Security and Cryptography for Networks","author":"M R Albrecht","year":"2018","unstructured":"Albrecht M R, Curtis B R, Deo A, et al., Estimate all the LWE, NTRU schemes!, Edited by Catalano D and De Prisco R, Security and Cryptography for Networks, Springer International Publishing, Cham, 2018, 351\u2013367."},{"key":"4537_CR23","series-title":"PhD Thesis","volume-title":"Parameter selection in lattice-based cryptography","author":"R Player","year":"2018","unstructured":"Player R, Parameter selection in lattice-based cryptography, PhD Thesis, Royal Holloway, University of London, 2018."},{"key":"4537_CR24","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/978-3-319-56614-6_4","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2017","author":"M R Albrecht","year":"2017","unstructured":"Albrecht M R, On dual lattice attacks against small-secret LWE and parameter choices in HElib and SEAL, Edited by Coron J S and Nielsen J B, Advances in Cryptology \u2013 EUROCRYPT 2017, Springer International Publishing, Cham, 2017, 103\u2013129."},{"issue":"2","key":"4537_CR25","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1145\/2815111.2815158","volume":"49","author":"M R Albrecht","year":"2015","unstructured":"Albrecht M R, Cid C, Faug\u00e8re J C, et al., Algebraic algorithms for LWE problems, ACM Commun. Comput. Algebra, 2015, 49(2): 62, DOI: https:\/\/doi.org\/10.1145\/2815111.2815158.","journal-title":"ACM Commun. Comput. Algebra"},{"key":"4537_CR26","first-page":"327","volume-title":"Proceedings of the 25th USENIX Conference on Security Symposium, SEC\u201916","author":"E Alkim","year":"2016","unstructured":"Alkim E, Ducas L, P\u00f6ppelmann T, et al., Post-quantum key exchange: A new hope, Proceedings of the 25th USENIX Conference on Security Symposium, SEC\u201916, USA, USENIX Association, 2016, 327\u2013343."},{"key":"4537_CR27","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/978-3-540-78967-3_3","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2008","author":"N Gama","year":"2008","unstructured":"Gama N and Nguyen P Q, Predicting lattice reduction, Edited by Smart N, Advances in Cryptology \u2013 EUROCRYPT 2008, Springer Berlin, Heidelberg, 2008, 31\u201351."},{"key":"4537_CR28","first-page":"1","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2011","author":"Y Chen","year":"2011","unstructured":"Chen Y and Nguyen P Q, Bkz 2.0: Better lattice security estimates, Edited by Lee D H and Wang X, Advances in Cryptology \u2013 ASIACRYPT 2011, Springer Berlin, Heidelberg, 2011, 1\u201320."},{"key":"4537_CR29","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/978-3-319-78381-9_5","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2018","author":"L Ducas","year":"2018","unstructured":"Ducas L, Shortest vector from lattice sieving: A few dimensions for free, Edited by Nielsen J B and Rijmen V, Advances in Cryptology \u2013 EUROCRYPT 2018, Springer International Publishing, Cham, 2018, 125\u2013145"}],"container-title":["Journal of Systems Science and Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11424-026-4537-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11424-026-4537-9","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11424-026-4537-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,21]],"date-time":"2026-05-21T13:22:12Z","timestamp":1779369732000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11424-026-4537-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5,21]]},"references-count":29,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2026,8]]}},"alternative-id":["4537"],"URL":"https:\/\/doi.org\/10.1007\/s11424-026-4537-9","relation":{},"ISSN":["1009-6124","1559-7067"],"issn-type":[{"value":"1009-6124","type":"print"},{"value":"1559-7067","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,5,21]]},"assertion":[{"value":"30 October 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 February 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 May 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"WU Wenyuan is an editorial board member for Journal of Systems Science & Complexity and was not involved in the editorial review or the decision to publish this article. All authors declare that there are no competing interests.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of Interest"}}]}}