{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T15:58:33Z","timestamp":1783007913139,"version":"3.54.5"},"publisher-location":"Singapore","reference-count":29,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819550982","type":"print"},{"value":"9789819550999","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,12,8]],"date-time":"2025-12-08T00:00:00Z","timestamp":1765152000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,12,8]],"date-time":"2025-12-08T00:00:00Z","timestamp":1765152000000},"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-981-95-5099-9_9","type":"book-chapter","created":{"date-parts":[[2025,12,7]],"date-time":"2025-12-07T11:38:14Z","timestamp":1765107494000},"page":"265-296","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Partial Lattice Trapdoors: How to\u00a0Split Lattice Trapdoors, Literally"],"prefix":"10.1007","author":[{"given":"Martin R.","family":"Albrecht","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9126-1887","authenticated-orcid":false,"given":"Russell W. F.","family":"Lai","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Oleksandra","family":"Lapiha","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8905-1207","authenticated-orcid":false,"given":"Ivy K. Y.","family":"Woo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,12,8]]},"reference":[{"key":"9_CR1","doi-asserted-by":"publisher","unstructured":"Agrawal, S., Boneh, D., Boyen, X.: Efficient lattice (H)IBE in the standard model. In: Gilbert, H., ed., EUROCRYPT\u00a02010, volume 6110 of LNCS, pp. 553\u2013572. Springer, Berlin, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13190-5_28","DOI":"10.1007\/978-3-642-13190-5_28"},{"key":"9_CR2","doi-asserted-by":"publisher","unstructured":"Albrecht, M.R., Cini, V., Lai, R.W.F., Malavolta, G., Thyagarajan, S.A.K.: Lattice-based SNARKs: publicly verifiable, preprocessing, and recursively composable - (extended abstract). In: Dodis, Y., Shrimpton, T., eds., CRYPTO\u00a02022, Part\u00a0II, volume 13508 of LNCS, pp. 102\u2013132. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15979-4_4","DOI":"10.1007\/978-3-031-15979-4_4"},{"key":"9_CR3","unstructured":"Attema, T., Cramer, R., Xing, C.: A note on short invertible ring elements and applications to cyclotomic and trinomials number fields. Math. Cryptol. 1(1), 45\u201370 (2021). https:\/\/journals.flvc.org\/mathcryptology\/article\/view\/123014"},{"key":"9_CR4","doi-asserted-by":"publisher","unstructured":"Ajtai, M.: Generating hard instances of lattice problems (extended abstract). In: 28th ACM STOC, pp. 99\u2013108. ACM Press (1996). https:\/\/doi.org\/10.1145\/237814.237838","DOI":"10.1145\/237814.237838"},{"key":"9_CR5","doi-asserted-by":"publisher","unstructured":"Albrecht, M.R., Lai, R.W.F.: Subtractive sets over cyclotomic rings - limits of Schnorr-like arguments over lattices. In: Malkin, T., Peikert, C., eds., CRYPTO\u00a02021, Part\u00a0II, volume 12826 of LNCS, pp. 519\u2013548, Virtual Event, August 2021. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84245-1_18","DOI":"10.1007\/978-3-030-84245-1_18"},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"Albrecht, M.R., Lai, R.W.F., Lapiha, O., Woo, I.K.Y.: Partial lattice trapdoors: how to split lattice trapdoors, literally. Cryptology ePrint Archive, Report 2025\/367 (2025). https:\/\/eprint.iacr.org\/2025\/367","DOI":"10.1007\/978-981-95-5099-9_9"},{"key":"9_CR7","doi-asserted-by":"publisher","unstructured":"Boneh, D., Freeman, D.M.: Linearly homomorphic signatures over binary fields and new tools for lattice-based signatures. In: Catalano, D., Fazio, N., Gennaro, R., Nicolosi, A., eds., PKC\u00a02011, volume 6571 of LNCS, pp. 1\u201316. Springer, Berlin, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-19379-8_1","DOI":"10.1007\/978-3-642-19379-8_1"},{"key":"9_CR8","doi-asserted-by":"publisher","unstructured":"Boneh, D., et al.: Fully key-homomorphic encryption, arithmetic circuit ABE and compact garbled circuits. In: Nguyen, P.Q., Oswald, E., eds., EUROCRYPT\u00a02014, volume 8441 of LNCS, pp. 533\u2013556. Springer, Berlin, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-55220-5_30","DOI":"10.1007\/978-3-642-55220-5_30"},{"key":"9_CR9","doi-asserted-by":"publisher","unstructured":"Boneh, D., et al.: Threshold cryptosystems from threshold fully homomorphic encryption. In: Shacham, H., Boldyreva, A., eds., CRYPTO\u00a02018, Part\u00a0I, volume 10991 of LNCS, pp. 565\u2013596. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96884-1_19","DOI":"10.1007\/978-3-319-96884-1_19"},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"Boschini, C., Kaviani, D., Lai, R.W.F., Malavolta, G., Takahashi, A., Tibouchi, M.: Ringtail: practical two-round threshold signatures from learning with errors. In: 2025 IEEE Symposium on Security and Privacy, SP 2025. IEEE Computer Society (2025)","DOI":"10.1109\/SP61157.2025.00070"},{"key":"9_CR11","doi-asserted-by":"publisher","unstructured":"Bendlin, R., Krehbiel, S., Peikert, C.: How to share a lattice trapdoor: threshold protocols for signatures and (H)IBE. In: Jacobson, M.J., Locasto, M.E., Mohassel, P., Safavi-Naini, R., eds., ACNS 2013, volume 7954 of LNCS, pp. 218\u2013236. Springer, Berlin, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38980-1_14","DOI":"10.1007\/978-3-642-38980-1_14"},{"key":"9_CR12","doi-asserted-by":"publisher","unstructured":"Beullens, W., Seiler, G.: LaBRADOR: compact proofs for R1CS from module-SIS. In: Handschuh, H., Lysyanskaya, A., eds., CRYPTO\u00a02023, Part\u00a0V, volume 14085 of LNCS, pp. 518\u2013548. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38554-4_17","DOI":"10.1007\/978-3-031-38554-4_17"},{"key":"9_CR13","doi-asserted-by":"publisher","unstructured":"D\u00f6ttling, N., Kolonelos, D., Lai, R.W.F., Lin, C., Malavolta, G., Rahimi, A.: Efficient laconic cryptography from learning with errors. In: Hazay, C., Stam, M., eds., EUROCRYPT\u00a02023, Part\u00a0III, volume 14006 of LNCS, pp. 417\u2013446. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30620-4_14","DOI":"10.1007\/978-3-031-30620-4_14"},{"key":"9_CR14","doi-asserted-by":"publisher","unstructured":"Pino, R.D., Katsumata, S., Maller, M., Mouhartem, F., Prest, T., Saarinen, M.-J.O.: Threshold raccoon: practical threshold signatures from standard lattice assumptions. In: Joye, M., Leander, G., eds., EUROCRYPT\u00a02024, Part\u00a0II, volume 14652 of LNCS, pp. 219\u2013248. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-58723-8_8","DOI":"10.1007\/978-3-031-58723-8_8"},{"key":"9_CR15","doi-asserted-by":"publisher","unstructured":"Datta, P., Komargodski, I., Waters, B.: Decentralized multi-authority ABE for DNFs from LWE. In: Canteaut, A., Standaert, F.-X., eds., EUROCRYPT\u00a02021, Part\u00a0I, volume 12696 of LNCS, pp. 177\u2013209. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77870-5_7","DOI":"10.1007\/978-3-030-77870-5_7"},{"key":"9_CR16","doi-asserted-by":"publisher","unstructured":"Espitau, T., Katsumata, S., Takemure, K.: Two-round threshold signature from algebraic one-more learning with errors. In: Reyzin, L., Stebila, D., eds., CRYPTO\u00a02024, Part\u00a0VII, volume 14926 of LNCS, pp. 387\u2013424. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-68394-7_13","DOI":"10.1007\/978-3-031-68394-7_13"},{"key":"9_CR17","doi-asserted-by":"publisher","unstructured":"Espitau, T., Niot, G., Prest, T.: Flood and submerse: distributed key generation and robust threshold signature from lattices. In: Reyzin, L., Stebila, D., eds., CRYPTO\u00a02024, Part\u00a0VII, volume 14926 of LNCS, pp. 425\u2013458. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-68394-7_14","DOI":"10.1007\/978-3-031-68394-7_14"},{"key":"9_CR18","doi-asserted-by":"publisher","unstructured":"G\u00fcr, K.D., Katz, J., Silde, T.: Two-round threshold lattice-based signatures from threshold homomorphic encryption. In: Saarinen, M.-J., Smith-Tone, D., eds., Post-Quantum Cryptography - 15th International Workshop, PQCrypto 2024, Part\u00a0II, pp. 266\u2013300. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-62746-0_12","DOI":"10.1007\/978-3-031-62746-0_12"},{"key":"9_CR19","doi-asserted-by":"publisher","unstructured":"Gentry, C., Peikert, C., Vaikuntanathan, V.: Trapdoors for hard lattices and new cryptographic constructions. In: Ladner, R.E., Dwork, C., eds., 40th ACM STOC, pp. 197\u2013206. ACM Press (2008). https:\/\/doi.org\/10.1145\/1374376.1374407","DOI":"10.1145\/1374376.1374407"},{"key":"9_CR20","doi-asserted-by":"publisher","unstructured":"Gorbunov, S., Vaikuntanathan, V., Wichs, D.: Leveled fully homomorphic signatures from standard lattices. In: Servedio, R.A., Rubinfeld, R., eds., 47th ACM STOC, pp. 469\u2013477. ACM Press (2015). https:\/\/doi.org\/10.1145\/2746539.2746576","DOI":"10.1145\/2746539.2746576"},{"key":"9_CR21","doi-asserted-by":"publisher","unstructured":"Katsumata, S., Reichle, M., Takemure, K.: Adaptively secure 5 round threshold signatures from MLWE\/MSIS and DL with rewinding. In: Reyzin, L., Stebila, D., eds., CRYPTO\u00a02024, Part\u00a0VII, volume 14926 of LNCS, pp. 459\u2013491. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-68394-7_15","DOI":"10.1007\/978-3-031-68394-7_15"},{"key":"9_CR22","doi-asserted-by":"publisher","unstructured":"Lyubashevsky, V., Nguyen, N.K., Plan\u00e7on, M.: Lattice-based zero-knowledge proofs and applications: shorter, simpler, and more general. In: Dodis, Y., Shrimpton, T., eds., CRYPTO\u00a02022, Part\u00a0II, volume 13508 of LNCS, pp. 71\u2013101. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15979-4_3","DOI":"10.1007\/978-3-031-15979-4_3"},{"key":"9_CR23","doi-asserted-by":"publisher","unstructured":"Ling, S., Phan, D.H., Stehl\u00e9, D., Steinfeld, R.: Hardness of k-LWE and applications in traitor tracing. In: Garay, J.A., Gennaro, R., eds., CRYPTO\u00a02014, Part\u00a0I, volume 8616 of LNCS, pp. 315\u2013334. Springer, Berlin, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44371-2_18","DOI":"10.1007\/978-3-662-44371-2_18"},{"key":"9_CR24","doi-asserted-by":"publisher","unstructured":"Lyubashevsky, V., Seiler, G., Steuer, P.: The LaZer library: Lattice-based zero knowledge and succinct proofs for quantum-safe privacy. In: Luo, B., Liao, X., Xu, J., Kirda, E., Lie, D., eds., ACM CCS 2024, pp. 3125\u20133137. ACM Press (2024). https:\/\/doi.org\/10.1145\/3658644.3690330","DOI":"10.1145\/3658644.3690330"},{"key":"9_CR25","doi-asserted-by":"publisher","unstructured":"Micciancio, D., Peikert, C.: Trapdoors for lattices: simpler, tighter, faster, smaller. In: Pointcheval, D., Johansson, T., eds., EUROCRYPT\u00a02012, volume 7237 of LNCS, pp. 700\u2013718. Springer, Berlin, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29011-4_41","DOI":"10.1007\/978-3-642-29011-4_41"},{"key":"9_CR26","doi-asserted-by":"publisher","unstructured":"Peikert, C., Tang, Y.: Cryptanalysis of lattice-based sequentiality assumptions and proofs of sequential work. In: Reyzin, L., Stebila, D., eds., CRYPTO\u00a02024, Part\u00a0V, volume 14924 of LNCS, pp. 129\u2013157. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-68388-6_6","DOI":"10.1007\/978-3-031-68388-6_6"},{"key":"9_CR27","doi-asserted-by":"publisher","unstructured":"Wee, H.: ABE for DFA from LWE against bounded collusions, revisited. In: Nissim, K., Waters, B., eds., TCC\u00a02021, Part\u00a0II, volume 13043 of LNCS, pp. 288\u2013309. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-90453-1_10","DOI":"10.1007\/978-3-030-90453-1_10"},{"key":"9_CR28","doi-asserted-by":"publisher","unstructured":"Wee, H.: Optimal broadcast encryption and CP-ABE from evasive lattice assumptions. In: Dunkelman, O., Dziembowski, S., eds., EUROCRYPT\u00a02022, Part\u00a0II, volume 13276 of LNCS, pp. 217\u2013241. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-07085-3_8","DOI":"10.1007\/978-3-031-07085-3_8"},{"key":"9_CR29","doi-asserted-by":"publisher","unstructured":"Wee, H., Wu, D.J.: Succinct vector, polynomial, and functional commitments from lattices. In: Hazay, C., Stam, M., eds., EUROCRYPT\u00a02023, Part\u00a0III, volume 14006 of LNCS, pp. 385\u2013416. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30620-4_13","DOI":"10.1007\/978-3-031-30620-4_13"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 ASIACRYPT 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-95-5099-9_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,9]],"date-time":"2026-02-09T17:48:57Z","timestamp":1770659337000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-5099-9_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,8]]},"ISBN":["9789819550982","9789819550999"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-5099-9_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,12,8]]},"assertion":[{"value":"8 December 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ASIACRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on the Theory and Application of Cryptology and Information Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Melbourne, VIC","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","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":"8 December 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 December 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"asiacrypt2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/asiacrypt.iacr.org\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}