{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T02:40:30Z","timestamp":1767321630760,"version":"3.48.0"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032105356","type":"print"},{"value":"9783032105363","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-10536-3_17","type":"book-chapter","created":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T02:38:36Z","timestamp":1767321516000},"page":"456-485","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Public-Key Encryption and\u00a0Injective Trapdoor Functions from\u00a0LWE with\u00a0Large Noise Rate"],"prefix":"10.1007","author":[{"given":"Liheng","family":"Ji","sequence":"first","affiliation":[]},{"given":"Yilei","family":"Chen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,1,2]]},"reference":[{"key":"17_CR1","doi-asserted-by":"crossref","unstructured":"Aggarwal, D., et al.: Lattice problems beyond polynomial time. In: STOC, pp. 1516\u20131526. ACM (2023)","DOI":"10.1145\/3564246.3585227"},{"issue":"1","key":"17_CR2","first-page":"1","volume":"6","author":"L Babai","year":"1986","unstructured":"Babai, L.: On lov\u00e1sz\u2019 lattice reduction and the nearest lattice point problem. Comb. 6(1), 1\u201313 (1986)","journal-title":"Comb."},{"key":"17_CR3","doi-asserted-by":"crossref","unstructured":"Bartusek, J., Khurana, D., Poremba, A.: Publicly-verifiable deletion via target-collapsing functions. In: CRYPTO (5), volume 14085 of Lecture Notes in Computer Science, pp. 99\u2013128. Springer (2023)","DOI":"10.1007\/978-3-031-38554-4_4"},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"Brakerski, Z., Vaikuntanathan, V.: Efficient fully homomorphic encryption from (standard) LWE. In: FOCS, pp. 97\u2013106. IEEE Computer Society (2011)","DOI":"10.1109\/FOCS.2011.12"},{"key":"17_CR5","doi-asserted-by":"crossref","unstructured":"Chen, Y., Zihan, H., Liu, Q., Luo, H., Tu, Y.: Algorithm, hardness, and oblivious sampling. In: CRYPTO, LWE with Quantum Amplitudes (2025)","DOI":"10.1007\/978-3-032-01878-6_17"},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"Gertner, Y., Kannan, S., Malkin, T., Reingold, O., Viswanathan, M.: The relationship between public key encryption and oblivious transfer. In: FOCS, pp. 325\u2013335. IEEE Computer Society (2000)","DOI":"10.1109\/SFCS.2000.892121"},{"key":"17_CR7","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 (2008)","DOI":"10.1145\/1374376.1374407"},{"key":"17_CR8","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), volume 8042 of Lecture Notes in Computer Science, pp. 75\u201392. Springer (2013)","DOI":"10.1007\/978-3-642-40041-4_5"},{"key":"17_CR9","doi-asserted-by":"crossref","unstructured":"Gorbunov, S., Vaikuntanathan, V., Wee, H.: Attribute-based encryption for circuits. In: STOC, pp. 545\u2013554. ACM (2013)","DOI":"10.1145\/2488608.2488677"},{"key":"17_CR10","doi-asserted-by":"crossref","unstructured":"Impagliazzo, R., Levin, L.A., Luby, M.: Pseudo-random generation from one-way functions (extended abstracts). In: STOC, pp. 12\u201324. ACM (1989)","DOI":"10.1145\/73007.73009"},{"issue":"5","key":"17_CR11","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1109\/TIT.1972.1054893","volume":"18","author":"J Justesen","year":"1972","unstructured":"Justesen, J.: Class of constructive asymptotically good algebraic codes. IEEE Trans. Inf. Theory 18(5), 652\u2013656 (1972)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"17_CR12","doi-asserted-by":"crossref","unstructured":"Laurent, B., Massart, P.: Adaptive estimation of a quadratic functional by model selection. Ann. Stat. 1302\u20131338 (2000)","DOI":"10.1214\/aos\/1015957395"},{"key":"17_CR13","doi-asserted-by":"crossref","unstructured":"Micciancio, D., Peikert, C.: Trapdoors for lattices: simpler, tighter, faster, smaller. In: EUROCRYPT, volume 7237 of Lecture Notes in Computer Science, pp. 700\u2013718. Springer (2012)","DOI":"10.1007\/978-3-642-29011-4_41"},{"key":"17_CR14","doi-asserted-by":"crossref","unstructured":"Peikert, C., Regev, O., Stephens-Davidowitz, N.: Pseudorandomness of ring-LWE for any ring and modulus. In: STOC, pp. 461\u2013473. ACM (2017)","DOI":"10.1145\/3055399.3055489"},{"key":"17_CR15","doi-asserted-by":"crossref","unstructured":"Peikert, C., Vaikuntanathan, V., Waters, B.: A framework for efficient and composable oblivious transfer. In: CRYPTO, volume 5157 of Lecture Notes in Computer Science, pp. 554\u2013571. Springer (2008)","DOI":"10.1007\/978-3-540-85174-5_31"},{"key":"17_CR16","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":"17_CR17","unstructured":"Vaikuntanathan, V.: CS 294-168 Lattices, Learning with Errors and Post-Quantum Cryptography: Lecture 1 (2020). https:\/\/people.csail.mit.edu\/vinodv\/CS294\/lecture1.pdf"},{"key":"17_CR18","doi-asserted-by":"crossref","unstructured":"Yu, Y., Zhang, J.: Cryptography with auxiliary input and trapdoor from constant-noise LPN. In: CRYPTO (1), volume 9814 of Lecture Notes in Computer Science, pp. 214\u2013243. Springer (2016)","DOI":"10.1007\/978-3-662-53018-4_9"}],"container-title":["Lecture Notes in Computer Science","Selected Areas in Cryptography \u2013 SAC 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-10536-3_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T02:38:37Z","timestamp":1767321517000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-10536-3_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032105356","9783032105363"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-10536-3_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"2 January 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SAC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Selected Areas in Cryptography","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Toronto, ON","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 August 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 August 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"32","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sacrypt2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sacworkshop.org\/SAC25\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}