{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,25]],"date-time":"2026-01-25T02:18:21Z","timestamp":1769307501866,"version":"3.49.0"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2022,7,12]],"date-time":"2022-07-12T00:00:00Z","timestamp":1657584000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,7,12]],"date-time":"2022-07-12T00:00:00Z","timestamp":1657584000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Australian Research Council Discovery Grant","award":["DP180102199"],"award-info":[{"award-number":["DP180102199"]}]},{"name":"Australian Research Council Discovery Grant","award":["DP180102199"],"award-info":[{"award-number":["DP180102199"]}]},{"DOI":"10.13039\/501100006021","name":"Direction G\u00e9n\u00e9rale de l\u2019Armement","doi-asserted-by":"publisher","award":["P\u00f4le de Recherche CYBER"],"award-info":[{"award-number":["P\u00f4le de Recherche CYBER"]}],"id":[{"id":"10.13039\/501100006021","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2022,8]]},"DOI":"10.1007\/s10623-022-01083-7","type":"journal-article","created":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T09:03:38Z","timestamp":1657703018000},"page":"1899-1936","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Vandermonde meets Regev: public key encryption schemes based on partial Vandermonde problems"],"prefix":"10.1007","volume":"90","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3971-9368","authenticated-orcid":false,"given":"Katharina","family":"Boudgoust","sequence":"first","affiliation":[]},{"given":"Amin","family":"Sakzad","sequence":"additional","affiliation":[]},{"given":"Ron","family":"Steinfeld","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,7,12]]},"reference":[{"key":"1083_CR1","doi-asserted-by":"crossref","unstructured":"Albrecht M.R., Curtis B.R., Deo A., Davidson A., Player R., Postlethwaite E.W., Virdia F., Wunderer T.: Estimate all the LWE, NTRU schemes! In: SCN. Lecture Notes in Computer Science, vol. 11035, pp. 351\u2013367. Springer, New York (2018).","DOI":"10.1007\/978-3-319-98113-0_19"},{"key":"1083_CR2","doi-asserted-by":"crossref","unstructured":"Ajtai M., Dwork C.: A public-key cryptosystem with worst-case\/average-case equivalence. In: STOC, pp. 284\u2013293. ACM, New York (1997).","DOI":"10.1145\/258533.258604"},{"key":"1083_CR3","unstructured":"Alkim E., Ducas L., P\u00f6ppelmann T., Schwabe P.: Post-quantum key exchange: a new hope. In: USENIX Security Symposium, pp. 327\u2013343. USENIX Association (2016)."},{"key":"1083_CR4","doi-asserted-by":"crossref","unstructured":"Ajtai M.: Generating hard instances of lattice problems (extended abstract). In: STOC, pp. 99\u2013108. ACM, New York (1996).","DOI":"10.1145\/237814.237838"},{"key":"1083_CR5","doi-asserted-by":"crossref","unstructured":"Cramer R., Ducas L., Peikert C., Regev O.: Recovering short generators of principal ideals in cyclotomic rings. In: EUROCRYPT (2). Lecture Notes in Computer Science, vol. 9666, pp. 559\u2013585. Springer, New York (2016).","DOI":"10.1007\/978-3-662-49896-5_20"},{"key":"1083_CR6","doi-asserted-by":"crossref","unstructured":"Cramer R., Ducas L., Wesolowski B.: Short stickelberger class relations and application to ideal-svp. In: EUROCRYPT (1). Lecture Notes in Computer Science, vol. 10210, pp. 324\u2013348 (2017).","DOI":"10.1007\/978-3-319-56620-7_12"},{"key":"1083_CR7","doi-asserted-by":"crossref","unstructured":"Dachman-Soled D., Ducas L., Gong H., Rossi M.: LWE with side information: attacks and concrete security estimation. In: CRYPTO (2). Lecture Notes in Computer Science, vol. 12171, pp. 329\u2013358. Springer, New York (2020).","DOI":"10.1007\/978-3-030-56880-1_12"},{"key":"1083_CR8","unstructured":"Dor\u00f6z Y., Hoffstein J., Silverman J.H., Sunar B.: MMSAT: a scheme for multimessage multiuser signature aggregation. IACR Cryptol. (2020)."},{"key":"1083_CR9","doi-asserted-by":"crossref","unstructured":"Ducas L., van Woerden, W.P.J.: NTRU fatigue: how stretched is overstretched? In: ASIACRYPT (4) Lecture Notes in Computer Science, vol. 13093, pp. 3\u201332. Springer, New York (2021).","DOI":"10.1007\/978-3-030-92068-5_1"},{"key":"1083_CR10","unstructured":"Gachon E., Pellet-Mary A.: Private communication (2021)."},{"key":"1083_CR11","doi-asserted-by":"crossref","unstructured":"Gentry C., Peikert C., Vaikuntanathan V. Trapdoors for hard lattices and new cryptographic constructions. In: STOC, pp. 197\u2013206. ACM, New York (2008).","DOI":"10.1145\/1374376.1374407"},{"key":"1083_CR12","doi-asserted-by":"crossref","unstructured":"Gentry C., Sahai A., Waters B.. Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based. In: CRYPTO (1). Lecture Notes in Computer Science, vol. 8042, pp. 75\u201392. Springer, New York (2013).","DOI":"10.1007\/978-3-642-40041-4_5"},{"issue":"1","key":"1083_CR13","first-page":"55","volume":"5","author":"Ted Hurley","year":"2018","unstructured":"Hurley Ted, Hurley Donny: Coding theory: the unit-derived methodology. Int. J. Inf. Coding Theory 5(1), 55\u201380 (2018).","journal-title":"Int. J. Inf. Coding Theory"},{"key":"1083_CR14","doi-asserted-by":"crossref","unstructured":"Hoffstein J., Pipher J., Silverman J.H.: NTRU: a ring-based public key cryptosystem. In: ANTS. Lecture Notes in Computer Science, vol. 1423, pp. 267\u2013288. Springer, New York (1998).","DOI":"10.1007\/BFb0054868"},{"key":"1083_CR15","doi-asserted-by":"crossref","unstructured":"Hoffstein J., Pipher J., Schanck J.M., Silverman J.H., Whyte W.: Practical signatures from the partial Fourier recovery problem. In: ACNS. Lecture Notes in Computer Science, vol. 8479, pp. 476\u2013493. Springer, New York (2014).","DOI":"10.1007\/978-3-319-07536-5_28"},{"issue":"2\u20133","key":"1083_CR16","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1007\/s10623-015-0089-z","volume":"77","author":"J Hoffstein","year":"2015","unstructured":"Hoffstein J., Silverman J.H.: Pass-encrypt: a public key cryptosystem based on partial evaluation of polynomials. Des. Codes Cryptogr. 77(2\u20133), 541\u2013552 (2015).","journal-title":"Des. Codes Cryptogr."},{"key":"1083_CR17","unstructured":"Laarhoven T.: Search problems in cryptography. (2015). http:\/\/www.thijs.com\/docs\/phd-final.pdf. Accessed 08 Jul 2021."},{"key":"1083_CR18","doi-asserted-by":"crossref","unstructured":"Lyubashevsky V., Micciancio D.: Generalized compact knapsacks are collision resistant. In: ICALP (2). Lecture Notes in Computer Science, vol. 4052, pp. 144\u2013155. Springer, New York (2006).","DOI":"10.1007\/11787006_13"},{"key":"1083_CR19","doi-asserted-by":"crossref","unstructured":"Lindner R., Peikert C.: Better key sizes (and attacks) for lwe-based encryption. In: CT-RSA. Lecture Notes in Computer Science, vol. 6558, pp. 319\u2013339. Springer, New York (2011).","DOI":"10.1007\/978-3-642-19074-2_21"},{"key":"1083_CR20","doi-asserted-by":"crossref","unstructured":"Lyubashevsky V., Peikert C., Regev O.: On ideal lattices and learning with errors over rings. In: EUROCRYPT. Lecture Notes in Computer Science, vol. 6110, pp. 1\u201323. Springer, New York (2010).","DOI":"10.1007\/978-3-642-13190-5_1"},{"issue":"6","key":"1083_CR21","doi-asserted-by":"publisher","first-page":"43:1","DOI":"10.1145\/2535925","volume":"60","author":"V Lyubashevsky","year":"2013","unstructured":"Lyubashevsky V., Peikert C., Regev O.: On ideal lattices and learning with errors over rings. J. ACM 60(6), 43:1-43:35 (2013).","journal-title":"J. ACM"},{"key":"1083_CR22","doi-asserted-by":"crossref","unstructured":"L\u00f3pez-Alt A., Tromer E., Vaikuntanathan V.: On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption. In: STOC, pp. 1219\u20131234. ACM, New York (2012).","DOI":"10.1145\/2213977.2214086"},{"key":"1083_CR23","doi-asserted-by":"crossref","unstructured":"Lu X., Zhang Z., Au M.H.: Practical signatures from the partial fourier recovery problem revisited: a provably-secure and Gaussian-distributed construction. In: ACISP. Lecture Notes in Computer Science, vol. 10946, pp. 813\u2013820. Springer, New York (2018).","DOI":"10.1007\/978-3-319-93638-3_50"},{"key":"1083_CR24","doi-asserted-by":"crossref","unstructured":"Micciancio D., Mol P.: Pseudorandom knapsacks and the sample complexity of LWE search-to-decision reductions. In: CRYPTO. Lecture Notes in Computer Science, vol. 6841, pp. 465\u2013484. Springer, New York (2011).","DOI":"10.1007\/978-3-642-22792-9_26"},{"key":"1083_CR25","doi-asserted-by":"crossref","unstructured":"Micciancio D., Regev O.: Lattice-based cryptography. In: Post-Quantum Cryptography, pp. 147\u2013191. Springer, New York (2010).","DOI":"10.1007\/978-3-540-88702-7_5"},{"issue":"4","key":"1083_CR26","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1561\/0400000074","volume":"10","author":"C Peikert","year":"2016","unstructured":"Peikert C.: A decade of lattice cryptography. Found. Trends Theor. Comput. Sci. 10(4), 283\u2013424 (2016).","journal-title":"Found. Trends Theor. Comput. Sci."},{"key":"1083_CR27","doi-asserted-by":"crossref","unstructured":"Pellet-Mary A., Hanrot G., Stehl\u00e9 D.: Approx-svp in ideal lattices with pre-processing. In: EUROCRYPT (2). Lecture Notes in Computer Science, vol. 11477, pp. 685\u2013716. Springer, New York (2019).","DOI":"10.1007\/978-3-030-17656-3_24"},{"key":"1083_CR28","doi-asserted-by":"crossref","unstructured":"Peikert C., Rosen A.: Efficient collision-resistant hashing from worst-case assumptions on cyclic lattices. In: TCC. Lecture Notes in Computer Science, vol. 3876, pp. 145\u2013166. Springer, New York (2006).","DOI":"10.1007\/11681878_8"},{"key":"1083_CR29","doi-asserted-by":"crossref","unstructured":"Pan Y., Xu J., Wadleigh N., Cheng Q.: On the ideal shortest vector problem over random rational primes. In: EUROCRYPT (1). Lecture Notes in Computer Science, vol. 12696, pp. 559\u2013583. Springer, New York (2021).","DOI":"10.1007\/978-3-030-77870-5_20"},{"key":"1083_CR30","doi-asserted-by":"crossref","unstructured":"Regev O.: On lattices, learning with errors, random linear codes, and cryptography. In: STOC, pp. 84\u201393. ACM (2005).","DOI":"10.1145\/1060590.1060603"},{"key":"1083_CR31","volume-title":"Roth. Introduction to Coding Theory","author":"M Ron","year":"2006","unstructured":"Ron M.: Roth. Introduction to Coding Theory. Cambridge University Press, Cambridge (2006)."},{"key":"1083_CR32","doi-asserted-by":"crossref","unstructured":"Stehl\u00e9 D., Steinfeld R.. Making NTRU as secure as worst-case problems over ideal lattices. In: EUROCRYPT. Lecture Notes in Computer Science, vol. 6632, pp. 27\u201347. Springer, New York (2011).","DOI":"10.1007\/978-3-642-20465-4_4"},{"key":"1083_CR33","doi-asserted-by":"crossref","unstructured":"Stehl\u00e9 D., Steinfeld R., Tanaka K., Xagawa K.: Efficient public key encryption based on ideal lattices. In: ASIACRYPT. Lecture Notes in Computer Science, vol. 5912, pp. 617\u2013635. Springer, New York (2009).","DOI":"10.1007\/978-3-642-10366-7_36"},{"key":"1083_CR34","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1515\/9783110317916.179","volume":"16","author":"R Steinfeld","year":"2014","unstructured":"Steinfeld R.: Ntru cryptosystem: recent developments and emerging mathematical problems in finite polynomial rings. Algebr. Curv. Finite Fields 16, 179 (2014).","journal-title":"Algebr. Curv. Finite Fields"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-022-01083-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-022-01083-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-022-01083-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,30]],"date-time":"2022-07-30T19:29:20Z","timestamp":1659209360000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-022-01083-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,12]]},"references-count":34,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2022,8]]}},"alternative-id":["1083"],"URL":"https:\/\/doi.org\/10.1007\/s10623-022-01083-7","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,7,12]]},"assertion":[{"value":"28 September 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 April 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 June 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 July 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}