{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,21]],"date-time":"2026-03-21T19:26:32Z","timestamp":1774121192342,"version":"3.50.1"},"publisher-location":"Cham","reference-count":44,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031587399","type":"print"},{"value":"9783031587405","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-58740-5_7","type":"book-chapter","created":{"date-parts":[[2024,4,28]],"date-time":"2024-04-28T06:01:45Z","timestamp":1714284105000},"page":"185-215","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Garbled Circuit Lookup Tables with\u00a0Logarithmic Number of\u00a0Ciphertexts"],"prefix":"10.1007","author":[{"given":"David","family":"Heath","sequence":"first","affiliation":[]},{"given":"Vladimir","family":"Kolesnikov","sequence":"additional","affiliation":[]},{"given":"Lucien K. L.","family":"Ng","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,4,29]]},"reference":[{"key":"7_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1007\/3-540-46766-1_34","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201991","author":"D Beaver","year":"1992","unstructured":"Beaver, D.: Efficient multiparty protocols using circuit randomization. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 420\u2013432. Springer, Heidelberg (1992). https:\/\/doi.org\/10.1007\/3-540-46766-1_34"},{"key":"7_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/978-3-319-78375-8_10","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2018","author":"A Beimel","year":"2018","unstructured":"Beimel, A., Kushilevitz, E., Nissim, P.: The complexity of multiparty PSM protocols and related models. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018, Part II. LNCS, vol. 10821, pp. 287\u2013318. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78375-8_10"},{"key":"7_CR3","doi-asserted-by":"publisher","unstructured":"Bellare, M., Hoang, V.T., Rogaway, P.: Foundations of garbled circuits. In: Yu, T., Danezis, G., Gligor, V.D. (eds.) ACM CCS 2012, pp. 784\u2013796. ACM Press, October 2012. https:\/\/doi.org\/10.1145\/2382196.2382279","DOI":"10.1145\/2382196.2382279"},{"key":"7_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1007\/978-3-030-26954-8_16","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"E Boyle","year":"2019","unstructured":"Boyle, E., Couteau, G., Gilboa, N., Ishai, Y., Kohl, L., Scholl, P.: Efficient pseudorandom correlation generators: silent OT extension and more. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019, Part III. LNCS, vol. 11694, pp. 489\u2013518. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26954-8_16"},{"key":"7_CR5","doi-asserted-by":"publisher","unstructured":"Bruggemann, A., Hundt, R., Schneider, T., Suresh, A., Yalame, H.: Flute: fast and secure lookup table evaluations. In: 2023 IEEE Symposium on Security and Privacy (SP), pp. 515\u2013533. IEEE Computer Society, Los Alamitos, CA, USA, May 2023. https:\/\/doi.org\/10.1109\/SP46215.2023.10179345","DOI":"10.1109\/SP46215.2023.10179345"},{"key":"7_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/978-3-642-28914-9_3","volume-title":"Theory of Cryptography","author":"SG Choi","year":"2012","unstructured":"Choi, S.G., Katz, J., Kumaresan, R., Zhou, H.-S.: On the security of the \u201cfree-XOR\u2019\u2019 technique. In: Cramer, R. (ed.) TCC 2012. LNCS, vol. 7194, pp. 39\u201353. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-28914-9_3"},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Dessouky, G., Koushanfar, F., Sadeghi, A.R., Schneider, T., Zeitouni, S., Zohner, M.: Pushing the communication barrier in secure computation using lookup tables. In: NDSS\u00a02017. The Internet Society, February\/March 2017","DOI":"10.14722\/ndss.2017.23097"},{"key":"7_CR8","doi-asserted-by":"publisher","unstructured":"Feige, U., Kilian, J., Naor, M.: A minimal model for secure computation (extended abstract). In: 26th ACM STOC, pp. 554\u2013563. ACM Press, May 1994. https:\/\/doi.org\/10.1145\/195058.195408","DOI":"10.1145\/195058.195408"},{"key":"7_CR9","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/978-3-031-06944-4_2","volume-title":"EUROCRYPT 2022, Part I","author":"A Haque","year":"2022","unstructured":"Haque, A., Heath, D., Kolesnikov, V., Lu, S., Ostrovsky, R., Shah, A.: Garbled circuits with sublinear evaluator. In: Dunkelman, O., Dziembowski, S. (eds.) EUROCRYPT 2022, Part I. LNCS, vol. 13275, pp. 37\u201364. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-06944-4_2"},{"key":"7_CR10","unstructured":"Heath, D.: New directions in garbled circuits. Ph.D. thesis, Georgia Institute of Technology, Atlanta, GA, USA (2022). http:\/\/hdl.handle.net\/1853\/66604"},{"key":"7_CR11","unstructured":"Heath, D.: Efficient arithmetic in garbled circuits. Cryptology ePrint Archive, Paper 2024\/139 (2024). https:\/\/eprint.iacr.org\/2024\/139"},{"key":"7_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"763","DOI":"10.1007\/978-3-030-56880-1_27","volume-title":"Advances in Cryptology \u2013 CRYPTO 2020","author":"D Heath","year":"2020","unstructured":"Heath, D., Kolesnikov, V.: Stacked Garbling - garbled circuit proportional to longest execution path. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020, Part II. LNCS, vol. 12171, pp. 763\u2013792. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56880-1_27"},{"key":"7_CR13","doi-asserted-by":"publisher","unstructured":"Heath, D., Kolesnikov, V.: One hot garbling. In: Vigna, G., Shi, E. (eds.) ACM CCS 2021, pp. 574\u2013593. ACM Press, November 2021. https:\/\/doi.org\/10.1145\/3460120.3484764","DOI":"10.1145\/3460120.3484764"},{"key":"7_CR14","doi-asserted-by":"publisher","unstructured":"Heath, D., Kolesnikov, V.: $$\\sf LogStack$$: stacked garbling with\u00a0$$O(b \\log b)$$ computation. In: Canteaut, A., Standaert, F.-X. (eds.) EUROCRYPT 2021, Part III. LNCS, vol. 12698, pp. 3\u201332. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77883-5_1","DOI":"10.1007\/978-3-030-77883-5_1"},{"key":"7_CR15","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-031-06944-4_1","volume-title":"EUROCRYPT 2022, Part I","author":"D Heath","year":"2022","unstructured":"Heath, D., Kolesnikov, V., Ostrovsky, R.: EpiGRAM: practical garbled RAM. In: Dunkelman, O., Dziembowski, S. (eds.) EUROCRYPT 2022, Part I. LNCS, vol. 13275, pp. 3\u201333. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-06944-4_1"},{"key":"7_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/978-3-030-17659-4_4","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2019","author":"C Hong","year":"2019","unstructured":"Hong, C., Katz, J., Kolesnikov, V., Lu, W., Wang, X.: Covert security with public verifiability: faster, leaner, and simpler. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019, Part III. LNCS, vol. 11478, pp. 97\u2013121. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17659-4_4"},{"key":"7_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"458","DOI":"10.1007\/978-3-662-44381-1_26","volume-title":"Advances in Cryptology \u2013 CRYPTO 2014","author":"Y Huang","year":"2014","unstructured":"Huang, Y., Katz, J., Kolesnikov, V., Kumaresan, R., Malozemoff, A.J.: Amortizing garbled circuits. In: Garay, J.A., Gennaro, R. (eds.) CRYPTO 2014, Part II. LNCS, vol. 8617, pp. 458\u2013475. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44381-1_26"},{"key":"7_CR18","doi-asserted-by":"publisher","unstructured":"Ishai, Y., Kushilevitz, E.: Private simultaneous messages protocols with applications. In: Proceedings of the Fifth Israeli Symposium on Theory of Computing and Systems, pp. 174\u2013183 (1997). https:\/\/doi.org\/10.1109\/ISTCS.1997.595170","DOI":"10.1109\/ISTCS.1997.595170"},{"key":"7_CR19","doi-asserted-by":"publisher","unstructured":"Ishai, Y., Kushilevitz, E.: Randomizing polynomials: a new representation with applications to round-efficient secure computation. In: 41st FOCS. pp. 294\u2013304. IEEE Computer Society Press, November 2000. https:\/\/doi.org\/10.1109\/SFCS.2000.892118","DOI":"10.1109\/SFCS.2000.892118"},{"key":"7_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"600","DOI":"10.1007\/978-3-642-36594-2_34","volume-title":"Theory of Cryptography","author":"Y Ishai","year":"2013","unstructured":"Ishai, Y., Kushilevitz, E., Meldgaard, S., Orlandi, C., Paskin-Cherniavsky, A.: On the power of correlated randomness in secure computation. In: Sahai, A. (ed.) TCC 2013. LNCS, vol. 7785, pp. 600\u2013620. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36594-2_34"},{"key":"7_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1007\/978-3-319-70697-9_18","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2017","author":"WS Kennedy","year":"2017","unstructured":"Kennedy, W.S., Kolesnikov, V., Wilfong, G.: Overlaying conditional circuit clauses for secure computation. In: Takagi, T., Peyrin, T. (eds.) ASIACRYPT 2017, Part II. LNCS, vol. 10625, pp. 499\u2013528. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70697-9_18"},{"key":"7_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/978-3-030-03332-3_2","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2018","author":"V Kolesnikov","year":"2018","unstructured":"Kolesnikov, V.: $$\\text{ FreeIF }$$: how to omit inactive branches and implement $$\\cal{S}$$-universal garbled circuit (almost) for free. In: Peyrin, T., Galbraith, S. (eds.) ASIACRYPT 2018, Part III. LNCS, vol. 11274, pp. 34\u201358. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03332-3_2"},{"key":"7_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1007\/978-3-642-40084-1_4","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"V Kolesnikov","year":"2013","unstructured":"Kolesnikov, V., Kumaresan, R.: Improved OT extension for transferring short secrets. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013, Part II. LNCS, vol. 8043, pp. 54\u201370. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40084-1_4"},{"key":"7_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1007\/978-3-662-44381-1_25","volume-title":"Advances in Cryptology \u2013 CRYPTO 2014","author":"V Kolesnikov","year":"2014","unstructured":"Kolesnikov, V., Mohassel, P., Rosulek, M.: FleXOR: flexible garbling for XOR gates that beats free-XOR. In: Garay, J.A., Gennaro, R. (eds.) CRYPTO 2014, Part II. LNCS, vol. 8617, pp. 440\u2013457. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44381-1_25"},{"key":"7_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"486","DOI":"10.1007\/978-3-540-70583-3_40","volume-title":"Automata, Languages and Programming","author":"V Kolesnikov","year":"2008","unstructured":"Kolesnikov, V., Schneider, T.: Improved garbled circuit: free XOR gates and applications. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part II. LNCS, vol. 5126, pp. 486\u2013498. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-70583-3_40"},{"key":"7_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/978-3-540-72540-4_4","volume-title":"Advances in Cryptology - EUROCRYPT 2007","author":"Y Lindell","year":"2007","unstructured":"Lindell, Y., Pinkas, B.: An efficient protocol for secure two-party computation in the presence of malicious adversaries. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol. 4515, pp. 52\u201378. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-72540-4_4"},{"issue":"2","key":"7_CR27","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/s00145-008-9036-8","volume":"22","author":"Y Lindell","year":"2009","unstructured":"Lindell, Y., Pinkas, B.: A proof of security of Yao\u2019s protocol for two-party computation. J. Cryptol. 22(2), 161\u2013188 (2009). https:\/\/doi.org\/10.1007\/s00145-008-9036-8","journal-title":"J. Cryptol."},{"key":"7_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"476","DOI":"10.1007\/978-3-662-44381-1_27","volume-title":"Advances in Cryptology \u2013 CRYPTO 2014","author":"Y Lindell","year":"2014","unstructured":"Lindell, Y., Riva, B.: Cut-and-choose YAO-based secure computation in the online\/offline and batch settings. In: Garay, J.A., Gennaro, R. (eds.) CRYPTO 2014, Part II. LNCS, vol. 8617, pp. 476\u2013494. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44381-1_27"},{"key":"7_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"719","DOI":"10.1007\/978-3-642-38348-9_42","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2013","author":"S Lu","year":"2013","unstructured":"Lu, S., Ostrovsky, R.: How to garble RAM programs? In: Johansson, T., Nguyen, P.Q. (eds.) EUROCRYPT 2013. LNCS, vol. 7881, pp. 719\u2013734. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38348-9_42"},{"key":"7_CR30","doi-asserted-by":"publisher","unstructured":"Naor, M., Nissim, K.: Communication preserving protocols for secure function evaluation. In: 33rd ACM STOC, pp. 590\u2013599. ACM Press, July 2001. https:\/\/doi.org\/10.1145\/380752.380855","DOI":"10.1145\/380752.380855"},{"key":"7_CR31","doi-asserted-by":"crossref","unstructured":"Naor, M., Pinkas, B., Sumner, R.: Privacy preserving auctions and mechanism design. In: Proceedings of the 1st ACM Conference on Electronic Commerce, pp. 129\u2013139. ACM (1999)","DOI":"10.1145\/336992.337028"},{"key":"7_CR32","unstructured":"Ng, L.K.L., Chow, S.S.M.: GForce: GPU-friendly oblivious and rapid neural network inference. In: Bailey, M., Greenstadt, R. (eds.) USENIX Security 2021, pp. 2147\u20132164. USENIX Association, August 2021"},{"key":"7_CR33","doi-asserted-by":"crossref","unstructured":"Ng, L.K., Chow, S.S.: SoK: cryptographic neural-network computation. In: 2023 IEEE Symposium on Security and Privacy (SP), pp. 497\u2013514 (2023)","DOI":"10.1109\/SP46215.2023.10179483"},{"key":"7_CR34","unstructured":"Park, A., Lin, W.K., Shi, E.: NanoGRAM: garbled RAM with $$\\widetilde{{O}}(\\log {N})$$ overhead. Cryptology ePrint Archive, Report 2022\/191 (2022). https:\/\/eprint.iacr.org\/2022\/191"},{"key":"7_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1007\/978-3-642-10366-7_15","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2009","author":"B Pinkas","year":"2009","unstructured":"Pinkas, B., Schneider, T., Smart, N.P., Williams, S.C.: Secure two-party computation is practical. In: Matsui, M. (ed.) ASIACRYPT 2009. LNCS, vol. 5912, pp. 250\u2013267. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-10366-7_15"},{"key":"7_CR36","unstructured":"Rathee, D., Bhattacharya, A., Gupta, D., Sharma, R., Song, D.: Secure floating-point training. Cryptology ePrint Archive (2023)"},{"key":"7_CR37","doi-asserted-by":"publisher","unstructured":"Rathee, D., Bhattacharya, A., Sharma, R., Gupta, D., Chandran, N., Rastogi, A.: SecFloat: accurate floating-point meets secure 2-party computation. In: 2022 IEEE Symposium on Security and Privacy, pp. 576\u2013595. IEEE Computer Society Press, May 2022. https:\/\/doi.org\/10.1109\/SP46214.2022.9833697","DOI":"10.1109\/SP46214.2022.9833697"},{"key":"7_CR38","doi-asserted-by":"publisher","unstructured":"Rathee, D., et al.: SiRnn: a math library for secure RNN inference. In: 2021 IEEE Symposium on Security and Privacy, pp. 1003\u20131020. IEEE Computer Society Press, May 2021. https:\/\/doi.org\/10.1109\/SP40001.2021.00086","DOI":"10.1109\/SP40001.2021.00086"},{"key":"7_CR39","doi-asserted-by":"publisher","unstructured":"Rathee, D., et al.: CrypTFlow2: practical 2-party secure inference. In: Ligatti, J., Ou, X., Katz, J., Vigna, G. (eds.) ACM CCS 2020, pp. 325\u2013342. ACM Press, November 2020. https:\/\/doi.org\/10.1145\/3372297.3417274","DOI":"10.1145\/3372297.3417274"},{"key":"7_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1007\/978-3-030-84242-0_5","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"M Rosulek","year":"2021","unstructured":"Rosulek, M., Roy, L.: Three halves make a whole? Beating the half-gates lower bound for garbled circuits. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021, Part I. LNCS, vol. 12825, pp. 94\u2013124. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84242-0_5"},{"key":"7_CR41","doi-asserted-by":"publisher","unstructured":"Troncoso-Pastoriza, J.R., Katzenbeisser, S., Celik, M.: Privacy preserving error resilient DNA searching through oblivious automata. In: Ning, P., De Capitani di Vimercati, S., Syverson, P.F. (eds.) ACM CCS 2007, pp. 519\u2013528. ACM Press, October 2007. https:\/\/doi.org\/10.1145\/1315245.1315309","DOI":"10.1145\/1315245.1315309"},{"key":"7_CR42","doi-asserted-by":"crossref","unstructured":"Yang, Y., Peceny, S., Heath, D., Kolesnikov, V.: Towards generic MPC compilers via variable instruction set architectures (visas). IACR Cryptol. ePrint Arch., p.\u00a0953 (2023). https:\/\/eprint.iacr.org\/2023\/953","DOI":"10.1145\/3576915.3616664"},{"key":"7_CR43","doi-asserted-by":"crossref","unstructured":"Yao, A.C.C.: How to generate and exchange secrets (extended abstract). In: 27th FOCS, pp. 162\u2013167. IEEE Computer Society Press, October 1986","DOI":"10.1109\/SFCS.1986.25"},{"key":"7_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1007\/978-3-662-46803-6_8","volume-title":"Advances in Cryptology - EUROCRYPT 2015","author":"S Zahur","year":"2015","unstructured":"Zahur, S., Rosulek, M., Evans, D.: Two halves make a whole. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015, Part II. LNCS, vol. 9057, pp. 220\u2013250. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46803-6_8"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2024"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-58740-5_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,12]],"date-time":"2024-05-12T23:07:12Z","timestamp":1715555232000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-58740-5_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031587399","9783031587405"],"references-count":44,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-58740-5_7","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":"29 April 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EUROCRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Conference on the Theory and Applications of Cryptographic Techniques","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Zurich","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Switzerland","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":"26 May 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 May 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"43","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eurocrypt2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/eurocrypt.iacr.org\/2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}