{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,21]],"date-time":"2026-07-21T23:27:33Z","timestamp":1784676453706,"version":"3.55.0"},"publisher-location":"Cham","reference-count":47,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032018809","type":"print"},{"value":"9783032018816","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-3-032-01881-6_8","type":"book-chapter","created":{"date-parts":[[2025,8,16]],"date-time":"2025-08-16T08:59:34Z","timestamp":1755334774000},"page":"236-268","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Key-Homomorphic Computations for\u00a0RAM: Fully Succinct Randomised Encodings and\u00a0More"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0004-3916-7550","authenticated-orcid":false,"given":"Damiano","family":"Abram","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-9737-0094","authenticated-orcid":false,"given":"Giulio","family":"Malavolta","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-8436-0029","authenticated-orcid":false,"given":"Lawrence","family":"Roy","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,8,17]]},"reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"Abram, D.,\u00a0Malavolta, G.,\u00a0Roy, L.: Key-homomorphic computations for RAM: fully succinct randomised encodings and more. Cryptology ePrint Archive, Paper 2025\/339 (2025)","DOI":"10.1007\/978-3-032-01881-6_8"},{"key":"8_CR2","unstructured":"Abram, D.,\u00a0Malavolta, G.,\u00a0Roy, L.: Oblivious tensor evaluation and its applications. In: 57th ACM STOC (2025)"},{"key":"8_CR3","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1007\/978-3-031-68382-4_11","volume-title":"CRYPTO 2024, Part III","author":"S Agrawal","year":"2024","unstructured":"Agrawal, S., Kumari, S., Yamada, S.: Attribute based encryption for turing machines from lattices. In: Reyzin, L., Stebila, D. (eds.) CRYPTO 2024, Part III. LNCS, vol. 14922, pp. 352\u2013386. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-68382-4_11"},{"key":"8_CR4","unstructured":"Agrawal, S.,\u00a0Kumari, S.,\u00a0Yamada, S.: Compact pseudorandom functional encryption from evasive LWE. Cryptology ePrint Archive, Paper 2024\/1719 (2024)"},{"key":"8_CR5","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/978-3-030-45721-1_2","volume-title":"EUROCRYPT 2020, Part I","author":"S Agrawal","year":"2020","unstructured":"Agrawal, S., Yamada, S.: Optimal broadcast encryption from pairings and LWE. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020, Part I. LNCS, vol. 12105, pp. 13\u201343. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45721-1_2"},{"key":"8_CR6","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/978-3-031-68382-4_13","volume-title":"CRYPTO 2024, Part III","author":"S Agrawalr","year":"2024","unstructured":"Agrawalr, S., Malavolta, G., Zhang, T.: Time-lock puzzles from lattices. In: Reyzin, L., Stebila, D. (eds.) CRYPTO 2024, Part III. LNCS, vol. 14922, pp. 425\u2013456. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-68382-4_13"},{"key":"8_CR7","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1007\/978-3-031-22963-3_6","volume-title":"ASIACRYPT 2022, Part I","author":"P Ananth","year":"2022","unstructured":"Ananth, P., Chung, K.-M., Fan, X., Qian, L.: Collusion-resistant functional encryption for RAMs. In: Agrawal, S., Lin, D. (eds.) ASIACRYPT 2022, Part I. LNCS, vol. 13791, pp. 160\u2013194. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-22963-3_6"},{"key":"8_CR8","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1007\/978-3-030-03810-6_17","volume-title":"TCC 2018, Part II","author":"P Ananth","year":"2018","unstructured":"Ananth, P., Lombardi, A.: Succinct garbling schemes from functional encryption through a local simulation paradigm. In: Beimel, A., Dziembowski, S. (eds.) TCC 2018, Part II. LNCS, vol. 11240, pp. 455\u2013472. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03810-6_17"},{"issue":"3","key":"8_CR9","doi-asserted-by":"publisher","first-page":"1123","DOI":"10.1137\/15M1050963","volume":"47","author":"N Bitansky","year":"2018","unstructured":"Bitansky, N., et al.: Indistinguishability obfuscation for ram programs and succinct randomized encodings. SIAM J. Comput. 47(3), 1123\u20131210 (2018)","journal-title":"SIAM J. Comput."},{"key":"8_CR10","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1007\/978-3-031-91098-2_15","volume-title":"EUROCRYPT 2025","author":"N Bitansky","year":"2025","unstructured":"Bitansky, N., Garg, R.: Succinct randomized encodings from laconic function evaluation, faster and simpler. In: Fehr, S., Fouque, P.A. (eds.) EUROCRYPT 2025. LNCS, vol. 15607, pp. 406\u2013436. Springer, Cham (2025). https:\/\/doi.org\/10.1007\/978-3-031-91098-2_15"},{"key":"8_CR11","doi-asserted-by":"crossref","unstructured":"Bitansky, N.,\u00a0Garg, S.,\u00a0Lin, H.,\u00a0Pass, R.,\u00a0Telang, S.: Succinct randomized encodings and their applications. In: Proceedings of the Forty-Seventh Annual ACM Symposium on Theory of Computing, pp. 439\u2013448 (2015)","DOI":"10.1145\/2746539.2746574"},{"key":"8_CR12","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1007\/978-3-642-55220-5_30","volume-title":"EUROCRYPT 2014","author":"D Boneh","year":"2014","unstructured":"Boneh, D., et al.: Fully key-homomorphic encryption, arithmetic circuit ABE and compact garbled circuits. In: Nguyen, P.Q., Oswald, E. (eds.) EUROCRYPT 2014. LNCS, vol. 8441, pp. 533\u2013556. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-55220-5_30"},{"key":"8_CR13","unstructured":"Brakerski, Z.,\u00a0D\u00f6ttling, N.,\u00a0Garg, S.,\u00a0Malavolta, G. Factoring and pairings are not necessary for IO: circular-secure LWE suffices. In:\u00a0Bojanczyk, M.,\u00a0Merelli, E., Woodruff, D.P. (eds.) ICALP 2022. LIPIcs, vol. 229, pp. 28:1\u201328:20. Schloss Dagstuhl (2022)"},{"key":"8_CR14","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/978-3-662-53015-3_13","volume-title":"CRYPTO 2016Part III","author":"Z Brakerski","year":"2016","unstructured":"Brakerski, Z., Vaikuntanathan, V.: Circuit-ABE from LWE: unbounded attributes and semi-adaptive security. In: Robshaw, M., Katz, J. (eds.) CRYPTO 2016Part III. LNCS, vol. 9816, pp. 363\u2013384. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53015-3_13"},{"key":"8_CR15","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1007\/978-981-96-0894-2_14","volume-title":"ASIACRYPT 2024","author":"C Brzuska","year":"2024","unstructured":"Brzuska, C., \u00dcnal, A., Woo, I.K.Y.: Evasive LWE assumptions: definitions, classes, and counterexamples. In: Chung, K.M., Sasaki, Y. (eds.) ASIACRYPT 2024. LNCS, vol. 15487, pp. 418\u2013449. Springer, Singapore (2024). https:\/\/doi.org\/10.1007\/978-981-96-0894-2_14"},{"key":"8_CR16","doi-asserted-by":"crossref","unstructured":"Canetti, R.,\u00a0Holmgren, J.,\u00a0Jain, A.,\u00a0Vaikuntanathan, V.: Succinct garbling and indistinguishability obfuscation for ram programs. In: Proceedings of the Forty-Seventh Annual ACM Symposium on Theory of Computing, pp. 429\u2013437 (2015)","DOI":"10.1145\/2746539.2746621"},{"key":"8_CR17","doi-asserted-by":"crossref","unstructured":"Champion, J., Hsieh, Y.-C., Wu, D.J.: Registered ABE and adaptively-secure broadcast encryption from succinct LWE. Cryptology ePrint Archive, Paper 2025\/044 (2025)","DOI":"10.1007\/978-3-032-01881-6_1"},{"key":"8_CR18","doi-asserted-by":"crossref","unstructured":"Cini, V.,\u00a0Wee, H.: ABE for circuits with poly ($$\\lambda $$)-sized keys from LWE. In: 64th FOCS, pp. 435\u2013446. IEEE Computer Society Press (2023)","DOI":"10.1109\/FOCS57990.2023.00032"},{"key":"8_CR19","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1007\/978-3-031-91131-6_4","volume-title":"EUROCRYPT 2025","author":"V Cini","year":"2025","unstructured":"Cini, V., Wee, H.: Faster ABE for turing machines from circular evasive LWE. In: Fehr, S., Fouque, P.A. (eds.) EUROCRYPT 2025. LNCS, vol. 15603, pp. 94\u2013125. Springer, Cham. (2025). https:\/\/doi.org\/10.1007\/978-3-031-91131-6_4"},{"key":"8_CR20","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/978-3-031-68382-4_4","volume-title":"CRYPTO 2024, Part III","author":"F Dong","year":"2024","unstructured":"Dong, F., Hao, Z., Mook, E., Wee, H., Wichs, D.: Laconic function evaluation and ABE for RAMs from (ring-)LWE. In: Reyzin, L., Stebila, D. (eds.) CRYPTO 2024, Part III. LNCS, vol. 14922, pp. 107\u2013142. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-68382-4_4"},{"key":"8_CR21","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/978-3-031-58723-8_7","volume-title":"EUROCRYPT 2024, Part II","author":"F Dong","year":"2024","unstructured":"Dong, F., Hao, Z., Mook, E., Wichs, D.: Laconic function evaluation, functional encryption and obfuscation for RAMs with sublinear computation. In: Joye, M., Leander, G. (eds.) EUROCRYPT 2024, Part II. LNCS, vol. 14652, pp. 190\u2013218. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-58723-8_7"},{"key":"8_CR22","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1007\/978-3-031-38551-3_16","volume-title":"CRYPTO 2023, Part IV","author":"C Freitag","year":"2023","unstructured":"Freitag, C., Waters, B., Wu, D.J.: How to use (plain) witness encryption: registered ABE, flexible broadcast, and more. In: Handschuh, H., Lysyanskaya, A. (eds.) CRYPTO 2023, Part IV. LNCS, vol. 14084, pp. 498\u2013531. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38551-3_16"},{"key":"8_CR23","doi-asserted-by":"crossref","unstructured":"Garg, S.,\u00a0Gentry, C.,\u00a0Sahai, A.,\u00a0Waters, B.: Witness encryption and its applications. In:\u00a0Boneh, D.,\u00a0Roughgarden, T.,\u00a0Feigenbaum, J., (eds.) 45th ACM STOC, pp. 467\u2013476. ACM Press (2013)","DOI":"10.1145\/2488608.2488667"},{"key":"8_CR24","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/978-3-030-03810-6_16","volume-title":"TCC 2018, Part II","author":"S Garg","year":"2018","unstructured":"Garg, S., Srinivasan, A.: A simple construction of iO for Turing machines. In: Beimel, A., Dziembowski, S. (eds.) TCC 2018, Part II. LNCS, vol. 11240, pp. 425\u2013454. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03810-6_16"},{"key":"8_CR25","doi-asserted-by":"crossref","unstructured":"Gay, R.,\u00a0Pass, R.: Indistinguishability obfuscation from circular security. In: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, pp. 736\u2013749 (2021)","DOI":"10.1145\/3406325.3451070"},{"key":"8_CR26","doi-asserted-by":"crossref","unstructured":"Gentry, C.: Fully homomorphic encryption using ideal lattices. In: Mitzenmacher, M. (ed.) 41st ACM STOC, pp. 169\u2013178. ACM Press (2009)","DOI":"10.1145\/1536414.1536440"},{"key":"8_CR27","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/978-3-642-40041-4_5","volume-title":"CRYPTO 2013, Part I","author":"C Gentry","year":"2013","unstructured":"Gentry, C., Sahai, A., Waters, B.: Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013, Part I. LNCS, vol. 8042, pp. 75\u201392. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40041-4_5"},{"key":"8_CR28","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"536","DOI":"10.1007\/978-3-642-40084-1_30","volume-title":"CRYPTO 2013, Part II","author":"S Goldwasser","year":"2013","unstructured":"Goldwasser, S., Kalai, Y.T., Popa, R.A., Vaikuntanathan, V., Zeldovich, N.: How to run Turing machines on encrypted data. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013, Part II. LNCS, vol. 8043, pp. 536\u2013553. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40084-1_30"},{"key":"8_CR29","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Kalai, Y.T., Popa, R.A.,\u00a0Vaikuntanathan, V.,\u00a0Zeldovich, N.: Reusable garbled circuits and succinct functional encryption. In:\u00a0Boneh, D.,\u00a0Roughgarden, T.,\u00a0Feigenbaum, J. (eds.) 45th ACM STOC, pp. 555\u2013564. ACM Press (2013)","DOI":"10.1145\/2488608.2488678"},{"key":"8_CR30","doi-asserted-by":"crossref","unstructured":"Gorbunov, S.,\u00a0Vaikuntanathan, V.,\u00a0Wee, H.: Attribute-based encryption for circuits. In:\u00a0Boneh, D.,\u00a0Roughgarden, T.,\u00a0Feigenbaum, J. (eds.) 45th ACM STOC, pp. 545\u2013554. ACM Press (2013)","DOI":"10.1145\/2488608.2488677"},{"key":"8_CR31","doi-asserted-by":"crossref","unstructured":"Gorbunov, S.,\u00a0Vaikuntanathan, V.,\u00a0Wichs, D.: Leveled fully homomorphic signatures from standard lattices. In: Servedio, R.A.,\u00a0Rubinfeld, R. (eds.) 47th ACM STOC, pp. 469\u2013477. ACM Press (2015)","DOI":"10.1145\/2746539.2746576"},{"key":"8_CR32","doi-asserted-by":"crossref","unstructured":"Goyal, V.,\u00a0Pandey, O.,\u00a0Sahai, A.,\u00a0Waters, B.: Attribute-based encryption for fine-grained access control of encrypted data. In:\u00a0Juels, A., Wright, R.N.,\u00a0De Capitani di Vimercati, S. (eds.) ACM CCS 2006, pp. 89\u201398. ACM Press (2006). Cryptology ePrint Archive Report 2006\/309","DOI":"10.1145\/1180405.1180418"},{"key":"8_CR33","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1007\/978-3-030-26948-7_21","volume-title":"CRYPTO 2019, Part I","author":"A Hamlin","year":"2019","unstructured":"Hamlin, A., Holmgren, J., Weiss, M., Wichs, D.: On the plausibility of fully homomorphic encryption for RAMs. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019, Part I. LNCS, vol. 11692, pp. 589\u2013619. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26948-7_21"},{"key":"8_CR34","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1007\/978-3-031-30620-4_17","volume-title":"EUROCRYPT 2023, Part III","author":"S Hohenberger","year":"2023","unstructured":"Hohenberger, S., Lu, G., Waters, B., Wu, D.J.: Registered attribute-based encryption. In: Hazay, C., Stam, M. (eds.) EUROCRYPT 2023, Part III. LNCS, vol. 14006, pp. 511\u2013542. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30620-4_17"},{"key":"8_CR35","doi-asserted-by":"crossref","unstructured":"Hsieh, Y.-C.,\u00a0Lin, H., Luo, J.: Attribute-based encryption for circuits of unbounded depth from lattices. In: 64th FOCS, pp. 415\u2013434. IEEE Computer Society Press (2023)","DOI":"10.1109\/FOCS57990.2023.00031"},{"key":"8_CR36","doi-asserted-by":"crossref","unstructured":"Jain, A.,\u00a0Lin, H.,\u00a0Sahai, A.: Indistinguishability obfuscation from well-founded assumptions. In: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, pp. 60\u201373 (2021)","DOI":"10.1145\/3406325.3451093"},{"key":"8_CR37","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"670","DOI":"10.1007\/978-3-031-06944-4_23","volume-title":"EUROCRYPT 2022, Part I","author":"A Jain","year":"2022","unstructured":"Jain, A., Lin, H., Sahai, A.: Indistinguishability obfuscation from LPN over $$\\mathbb{F} _p$$, DLIN, and PRGs in $${NC}^0$$. In: Dunkelman, O., Dziembowski, S. (eds.) EUROCRYPT 2022, Part I. LNCS, vol. 13275, pp. 670\u2013699. Springer, Cham, May \/ June (2022). https:\/\/doi.org\/10.1007\/978-3-031-06944-4_23"},{"key":"8_CR38","doi-asserted-by":"crossref","unstructured":"Koppula, V., Lewko, A.B.,\u00a0Waters, B.: Indistinguishability obfuscation for Turing machines with unbounded memory. In: Servedio, R.A.,\u00a0Rubinfeld, R. (eds.) 47th ACM STOC, pp. 419\u2013428. ACM Press (2015)","DOI":"10.1145\/2746539.2746614"},{"key":"8_CR39","doi-asserted-by":"crossref","unstructured":"Lin, W.-K.,\u00a0Mook, E.,\u00a0Wichs, D.: Doubly efficient private information retrieval and fully homomorphic RAM computation from ring LWE. In:\u00a0Saha, B., Servedio, R.A. (eds.) 55th ACM STOC, pp. 595\u2013608. ACM Press (2023)","DOI":"10.1145\/3564246.3585175"},{"key":"8_CR40","unstructured":"Lombardi, A.,\u00a0Vaikuntanathan, V.: Correlation-intractable hash functions via shift-hiding. In:\u00a0Braverman, M. (ed.) ITCS 2022, vol. 215, pp. 102:1\u2013102:16. LIPIcs (2022)"},{"key":"8_CR41","doi-asserted-by":"crossref","unstructured":"Quach, W., Wee, H., Wichs, D.: Laconic function evaluation and applications. In: Thorup, M. (ed.) 59th FOCS, pp. 859\u2013870. IEEE Computer Society Press (2018)","DOI":"10.1109\/FOCS.2018.00086"},{"key":"8_CR42","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1007\/11426639_27","volume-title":"EUROCRYPT 2005","author":"A Sahai","year":"2005","unstructured":"Sahai, A., Waters, B.R.: Fuzzy identity-based encryption. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol. 3494, pp. 457\u2013473. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11426639_27"},{"key":"8_CR43","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/978-3-031-22963-3_7","volume-title":"ASIACRYPT 2022, Part I","author":"V Vaikuntanathan","year":"2022","unstructured":"Vaikuntanathan, V., Wee, H., Wichs, D.: Witness encryption and null-IO from evasive LWE. In: Agrawal, S., Lin, D. (eds.) ASIACRYPT 2022, Part I. LNCS, vol. 13791, pp. 195\u2013221. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-22963-3_7"},{"key":"8_CR44","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/978-3-031-07085-3_8","volume-title":"EUROCRYPT 2022, Part II","author":"H Wee","year":"2022","unstructured":"Wee, H.: Optimal broadcast encryption and CP-ABE from evasive lattice assumptions. In: Dunkelman, O., Dziembowski, S. (eds.) EUROCRYPT 2022, Part II. LNCS, vol. 13276, pp. 217\u2013241. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-07085-3_8"},{"key":"8_CR45","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/978-3-031-68382-4_6","volume-title":"CRYPTO 2024, Part III","author":"H Wee","year":"2024","unstructured":"Wee, H.: Circuit ABE with $${ poly}(\\text{ depth },\\lambda )$$-sized ciphertexts and keys from lattices. In: Reyzin, L., Stebila, D. (eds.) CRYPTO 2024, Part III. LNCS, vol. 14922, pp. 178\u2013209. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-68382-4_6"},{"key":"8_CR46","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/978-3-031-91131-6_2","volume-title":"Almost optimal KP and CP-ABE for circuits from succinct LWE","author":"H Wee","year":"2025","unstructured":"Wee, H.: Almost optimal KP and CP-ABE for circuits from succinct LWE. In: Fehr, S., Fouque, P.A. (eds.) Almost optimal KP and CP-ABE for circuits from succinct LWE. LNCS, vol. 15603, pp. 34\u201362. Springer, Cham (2025). https:\/\/doi.org\/10.1007\/978-3-031-91131-6_2"},{"key":"8_CR47","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/978-3-030-77883-5_5","volume-title":"EUROCRYPT 2021, Part III","author":"H Wee","year":"2021","unstructured":"Wee, H., Wichs, D.: Candidate obfuscation via oblivious LWE sampling. In: Canteaut, A., Standaert, F.-X. (eds.) EUROCRYPT 2021, Part III. LNCS, vol. 12698, pp. 127\u2013156. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77883-5_5"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-01881-6_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,20]],"date-time":"2025-10-20T00:49:45Z","timestamp":1760921385000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-01881-6_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783032018809","9783032018816"],"references-count":47,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-01881-6_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"17 August 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CRYPTO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Cryptology Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Santa Barbara, CA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","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":"17 August 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 August 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"45","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"crypto2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}