{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T02:46:07Z","timestamp":1768445167958,"version":"3.49.0"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031683817","type":"print"},{"value":"9783031683824","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-68382-4_4","type":"book-chapter","created":{"date-parts":[[2024,8,15]],"date-time":"2024-08-15T09:02:41Z","timestamp":1723712561000},"page":"107-142","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Laconic Function Evaluation and\u00a0ABE for\u00a0RAMs from\u00a0(Ring-)LWE"],"prefix":"10.1007","author":[{"given":"Fangqi","family":"Dong","sequence":"first","affiliation":[]},{"given":"Zihan","family":"Hao","sequence":"additional","affiliation":[]},{"given":"Ethan","family":"Mook","sequence":"additional","affiliation":[]},{"given":"Hoeteck","family":"Wee","sequence":"additional","affiliation":[]},{"given":"Daniel","family":"Wichs","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,8,16]]},"reference":[{"key":"4_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1007\/978-3-030-34578-5_5","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2019","author":"P Ananth","year":"2019","unstructured":"Ananth, P., Fan, X., Shi, E.: Towards attribute-based encryption for RAMs from LWE: sub-linear decryption, and more. In: Galbraith, S.D., Moriai, S. (eds.) ASIACRYPT 2019. LNCS, vol. 11921, pp. 112\u2013141. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-34578-5_5"},{"key":"4_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1007\/978-3-642-29011-4_29","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"G Asharov","year":"2012","unstructured":"Asharov, G., Jain, A., L\u00f3pez-Alt, A., Tromer, E., Vaikuntanathan, V., Wichs, D.: Multiparty computation with low communication, computation and interaction via threshold FHE. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 483\u2013501. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29011-4_29"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"Ajtai, M., Koml\u00f3s, J., Szemer\u00e9di, E.: An $$O(n \\log n)$$ sorting network. In: 15th Annual ACM Symposium on Theory of Computing, pp. 1\u20139. ACM Press (1983)","DOI":"10.1145\/800061.808726"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"Batcher, K.E.: Sorting networks and their applications. In: Proceedings of the April 30\u2013May 2, 1968, Spring Joint Computer Conference, AFIPS \u201968 (Spring), pp. 307\u2013314. Association for Computing Machinery (1968)","DOI":"10.1145\/1468075.1468121"},{"issue":"3","key":"4_CR5","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":"4_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1007\/978-3-642-55220-5_30","volume-title":"Advances in Cryptology \u2013 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":"4_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/3-540-44598-6_4","volume-title":"Advances in Cryptology \u2014 CRYPTO 2000","author":"A Beimel","year":"2000","unstructured":"Beimel, A., Ishai, Y., Malkin, T.: Reducing the servers computation in private information retrieval: PIR with preprocessing. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol. 1880, pp. 55\u201373. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-44598-6_4"},{"key":"4_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"662","DOI":"10.1007\/978-3-319-70503-3_22","volume-title":"Theory of Cryptography","author":"E Boyle","year":"2017","unstructured":"Boyle, E., Ishai, Y., Pass, R., Wootters, M.: Can we access a database both locally and privately? In: Kalai, Y., Reyzin, L. (eds.) TCC 2017. LNCS, vol. 10678, pp. 662\u2013693. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70503-3_22"},{"key":"4_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1007\/978-3-319-70500-2_10","volume-title":"Theory of Cryptography","author":"Z Brakerski","year":"2017","unstructured":"Brakerski, Z., Tsabary, R., Vaikuntanathan, V., Wee, H.: Private constrained PRFs (and More) from LWE. In: Kalai, Y., Reyzin, L. (eds.) TCC 2017. LNCS, vol. 10677, pp. 264\u2013302. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70500-2_10"},{"key":"4_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-662-46497-7_1","volume-title":"Theory of Cryptography","author":"Z Brakerski","year":"2015","unstructured":"Brakerski, Z., Vaikuntanathan, V.: Constrained key-homomorphic PRFs from standard lattice assumptions. In: Dodis, Y., Nielsen, J.B. (eds.) TCC 2015. LNCS, vol. 9015, pp. 1\u201330. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46497-7_1"},{"key":"4_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-3-319-63715-0_2","volume-title":"Advances in Cryptology \u2013 CRYPTO 2017","author":"C Cho","year":"2017","unstructured":"Cho, C., D\u00f6ttling, N., Garg, S., Gupta, D., Miao, P., Polychroniadou, A.: Laconic oblivious transfer and its applications. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017. LNCS, vol. 10402, pp. 33\u201365. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63715-0_2"},{"key":"4_CR12","doi-asserted-by":"crossref","unstructured":"Canetti, R., Holmgren, J.: Fully succinct garbled RAM. In: Sudan, M. (ed.) ITCS 2016: 7th Conference on Innovations in Theoretical Computer Science, pp. 169\u2013178. Association for Computing Machinery (2016)","DOI":"10.1145\/2840728.2840765"},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"Canetti, R., Holmgren, J., Jain, A., Vaikuntanathan, V.: Succinct garbling and indistinguishability obfuscation for RAM programs. In: Servedio, R.A., Rubinfeld, R. (eds.) 47th Annual ACM Symposium on Theory of Computing, pp. 429\u2013437. ACM Press (2015)","DOI":"10.1145\/2746539.2746621"},{"key":"4_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"694","DOI":"10.1007\/978-3-319-70503-3_23","volume-title":"Theory of Cryptography","author":"R Canetti","year":"2017","unstructured":"Canetti, R., Holmgren, J., Richelson, S.: Towards doubly efficient private information retrieval. In: Kalai, Y., Reyzin, L. (eds.) TCC 2017. LNCS, vol. 10678, pp. 694\u2013726. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70503-3_23"},{"key":"4_CR15","doi-asserted-by":"publisher","unstructured":"D\u00f6ttling, N., Gajland, P., Malavolta, G.: Laconic function evaluation for turing machines. In: Boldyreva, A., Kolesnikov, V. (eds.) Public-Key Cryptography \u2013 PKC 2023. PKC 2023. LNCS, vol. 13941, pp. 606\u2013634 Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-31371-4_21","DOI":"10.1007\/978-3-031-31371-4_21"},{"key":"4_CR16","doi-asserted-by":"crossref","unstructured":"Dong, F., Hao, Z., Mook, E., Wichs, D.: Laconic function evaluation, functional encryption and obfuscation for rams with sublinear computation. To appear in EUROCRYPT (2024). https:\/\/eprint.iacr.org\/2024\/068","DOI":"10.1007\/978-3-031-58723-8_7"},{"key":"4_CR17","doi-asserted-by":"crossref","unstructured":"Gentry, C., Halevi, S., Raykova, M., Wichs, D.: Outsourcing private RAM computation. In: 55th Annual Symposium on Foundations of Computer Science, pp. 404\u2013413. IEEE Computer Society Press (2014)","DOI":"10.1109\/FOCS.2014.50"},{"key":"4_CR18","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Kalai, Y.T., Popa, R.A., Vaikuntanathan, V., Zeldovich, N.: Reusable garbled circuits and succinct functional encryption. In: Boneh, D., Roughgarden, T., Feigenbaum, J. (eds.) 45th Annual ACM Symposium on Theory of Computing, pp. 555\u2013564. ACM Press (2013)","DOI":"10.1145\/2488608.2488678"},{"issue":"3","key":"4_CR19","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1145\/233551.233553","volume":"43","author":"O Goldreich","year":"1996","unstructured":"Goldreich, O., Ostrovsky, R.: Software protection and simulation on oblivious rams. J. ACM 43(3), 431\u2013473 (1996)","journal-title":"J. ACM"},{"key":"4_CR20","doi-asserted-by":"crossref","unstructured":"Goodrich, M.T..: Zig-zag sort: a simple deterministic data-oblivious sorting algorithm running in $${O}(n \\log n)$$ time. In: Shmoys, D.B. (ed.) 46th Annual ACM Symposium on Theory of Computing, pp. 684\u2013693. ACM Press (2014)","DOI":"10.1145\/2591796.2591830"},{"key":"4_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/978-3-642-40041-4_5","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","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. LNCS, vol. 8042, pp. 75\u201392. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40041-4_5"},{"key":"4_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1007\/978-3-662-48000-7_25","volume-title":"Advances in Cryptology \u2013 CRYPTO 2015","author":"S Gorbunov","year":"2015","unstructured":"Gorbunov, S., Vaikuntanathan, V., Wee, H.: Predicate encryption for circuits from LWE. In: Gennaro, R., Robshaw, M. (eds.) CRYPTO 2015. LNCS, vol. 9216, pp. 503\u2013523. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48000-7_25"},{"key":"4_CR23","doi-asserted-by":"crossref","unstructured":"Gorbunov, S., Vaikuntanathan, V., Wichs, D.: Leveled fully homomorphic signatures from standard lattices. In: Servedio, R.A., Rubinfeld, R. (eds.) 47th Annual ACM Symposium on Theory of Computing, pp. 469\u2013477. ACM Press (2015)","DOI":"10.1145\/2746539.2746576"},{"key":"4_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1007\/978-3-030-26948-7_21","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","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. LNCS, vol. 11692, pp. 589\u2013619. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26948-7_21"},{"key":"4_CR25","doi-asserted-by":"crossref","unstructured":"Hsieh, Y.-C., Lin, H., Luo, J.: Attribute-based encryption for circuits of unbounded depth from lattices. In: 64th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2023, Santa Cruz, CA, USA, November 6-9, 2023, pp. 415\u2013434. IEEE (2023)","DOI":"10.1109\/FOCS57990.2023.00031"},{"key":"4_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/978-3-030-17656-3_9","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2019","author":"A Hamlin","year":"2019","unstructured":"Hamlin, A., Ostrovsky, R., Weiss, M., Wichs, D.: Private anonymous data access. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019. LNCS, vol. 11477, pp. 244\u2013273. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17656-3_9"},{"key":"4_CR27","doi-asserted-by":"publisher","unstructured":"Jain, A., Lin, H., Luo, J.: On the optimal succinctness and efficiency of functional encryption and attribute-based encryption. In: Hazay, C., Stam, M. (eds.) Advances in Cryptology \u2013 EUROCRYPT 2023. EUROCRYPT 2023. LNCS, vol. 14006, pp. 479\u2013510 Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30620-4_16","DOI":"10.1007\/978-3-031-30620-4_16"},{"key":"4_CR28","doi-asserted-by":"crossref","unstructured":"Lin, W.-K., Mook, E., Wichs, D.: Doubly efficient private information retrieval and fully homomorphic RAM computation from ring LWE. In: Saha, B., Servedio, R.A. (eds.) Proceedings of the 55th Annual ACM Symposium on Theory of Computing, STOC 2023, Orlando, FL, USA, June 20-23, 2023, pp. 595\u2013608. ACM (2023)","DOI":"10.1145\/3564246.3585175"},{"key":"4_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"700","DOI":"10.1007\/978-3-642-29011-4_41","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"D Micciancio","year":"2012","unstructured":"Micciancio, D., Peikert, C.: Trapdoors for lattices: simpler, tighter, faster, smaller. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 700\u2013718. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29011-4_41"},{"key":"4_CR30","doi-asserted-by":"crossref","unstructured":"Quach, W., Wee, H., Wichs, D.: Laconic function evaluation and applications. In: Thorup, M. (ed.) 59th Annual Symposium on Foundations of Computer Science, pp. 859\u2013870. IEEE Computer Society Press (2018)","DOI":"10.1109\/FOCS.2018.00086"},{"key":"4_CR31","doi-asserted-by":"crossref","unstructured":"Sahai, A., Seyalioglu, H.: Worry-free encryption: functional encryption with public keys. In: Al-Shaer, E., Keromytis, A.D., Shmatikov, V. (eds.) ACM CCS 2010: 17th Conference on Computer and Communications Security, pp. 463\u2013472. ACM Press (2010)","DOI":"10.1145\/1866307.1866359"},{"key":"4_CR32","series-title":"Part I, Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1007\/978-3-031-15802-5_19","volume-title":"Advances in Cryptology - CRYPTO 2022","author":"R Tsabary","year":"2022","unstructured":"Tsabary, R.: Candidate witness encryption from lattice techniques. In: Advances in Cryptology - CRYPTO 2022. Part I, Lecture Notes in Computer Science, pp. 535\u2013559. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-15802-5_19"},{"key":"4_CR33","doi-asserted-by":"publisher","unstructured":"Wee, H.: Optimal Broadcast Encryption and CP-ABE from Evasive Lattice Assumptions. In: Dunkelman, O., Dziembowski, S. (eds.) Advances in Cryptology \u2013 EUROCRYPT 2022. EUROCRYPT 2022. LNCS, vol. 13276. 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":"4_CR34","doi-asserted-by":"crossref","unstructured":"Yao, A.C.-C.: How to generate and exchange secrets (extended abstract). In: 27th Annual Symposium on Foundations of Computer Science, pp. 162\u2013167. IEEE Computer Society Press (1986)","DOI":"10.1109\/SFCS.1986.25"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2024"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-68382-4_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,15]],"date-time":"2024-08-15T09:03:54Z","timestamp":1723712634000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-68382-4_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031683817","9783031683824"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-68382-4_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"16 August 2024","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":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 August 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 August 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"44","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"crypto2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}