{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,2]],"date-time":"2025-12-02T03:22:00Z","timestamp":1764645720239,"version":"3.40.3"},"publisher-location":"Cham","reference-count":36,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031587504"},{"type":"electronic","value":"9783031587511"}],"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-58751-1_10","type":"book-chapter","created":{"date-parts":[[2024,4,28]],"date-time":"2024-04-28T07:01:57Z","timestamp":1714287717000},"page":"271-300","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Two-Round Maliciously-Secure Oblivious Transfer with\u00a0Optimal Rate"],"prefix":"10.1007","author":[{"given":"Pedro","family":"Branco","sequence":"first","affiliation":[]},{"given":"Nico","family":"D\u00f6ttling","sequence":"additional","affiliation":[]},{"given":"Akshayaram","family":"Srinivasan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,4,29]]},"reference":[{"key":"10_CR1","unstructured":"Aggarwal, D., D\u00f6ttling, N., Dujmovic, J., Hajiabadi, M., Malavolta, G., Obremski, M.: Algebraic restriction codes and their applications. In: Braverman, M. (ed.) 13th Innovations in Theoretical Computer Science Conference (ITCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), vol. 215, pp. 2:1\u20132:15. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl (2022). https:\/\/drops.dagstuhl.de\/opus\/volltexte\/2022\/15598"},{"key":"10_CR2","doi-asserted-by":"publisher","unstructured":"Aiello, W., Ishai, Y., Reingold, O.: Priced oblivious transfer: how to sell digital goods. In: Pfitzmann, B. (ed.) Advances in Cryptology. EUROCRYPT 2001. LNCS, vol. 2045, pp. 119\u2013135. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44987-6_8","DOI":"10.1007\/3-540-44987-6_8"},{"key":"10_CR3","doi-asserted-by":"publisher","unstructured":"Beaver, D.: Correlated pseudorandomness and the complexity of private computations. In: Miller, G.L. (ed.) Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, Philadelphia, 22\u201324 May 1996, pp. 479\u2013488. ACM (1996). https:\/\/doi.org\/10.1145\/237814.237996","DOI":"10.1145\/237814.237996"},{"key":"10_CR4","doi-asserted-by":"publisher","unstructured":"Benhamouda, F., Lin, H.: k-round multiparty computation from k-round oblivious transfer via garbled interactive circuits. In: Nielsen, J.B., Rijmen, V. (eds.) Advances in Cryptology. EUROCRYPT 2018, Part II. LNCS, vol. 10821, pp. 500\u2013532. Springer, Heidelberg (2018). https:\/\/doi.org\/10.1007\/978-3-319-78375-8_17","DOI":"10.1007\/978-3-319-78375-8_17"},{"key":"10_CR5","doi-asserted-by":"publisher","unstructured":"Boneh, D., Waters, B.: Constrained pseudorandom functions and their applications. In: Sako, K., Sarkar, P. (eds.) Advances in Cryptology. ASIACRYPT 2013, Part II. LNCS, vol. 8270, pp. 280\u2013300. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-42045-0_15","DOI":"10.1007\/978-3-642-42045-0_15"},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"Boyle, E., Couteau, G., Gilboa, N., Ishai, Y.: Compressing vector OLE. In: Lie, D., Mannan, M., Backes, M., Wang, X. (eds.) ACM CCS 2018: 25th Conference on Computer and Communications Security, pp. 896\u2013912. ACM Press, Toronto (2018)","DOI":"10.1145\/3243734.3243868"},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"Boyle, E., et al.: Efficient two-round OT extension and silent non-interactive secure computation. In: Cavallaro, L., Kinder, J., Wang, X., Katz, J. (eds.) ACM CCS 2019: 26th Conference on Computer and Communications Security, pp. 291\u2013308. ACM Press (2019)","DOI":"10.1145\/3319535.3354255"},{"key":"10_CR8","doi-asserted-by":"publisher","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.) Advances in Cryptology. CRYPTO 2019, Part III. LNCS, vol. 11694, pp. 489\u2013518. Springer, Heidelberg (2019). https:\/\/doi.org\/10.1007\/978-3-030-26954-8_16","DOI":"10.1007\/978-3-030-26954-8_16"},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"Boyle, E., Couteau, G., Gilboa, N., Ishai, Y., Kohl, L., Scholl, P.: Correlated pseudorandom functions from variable-density LPN. In: 61st Annual Symposium on Foundations of Computer Science, pp. 1069\u20131080. IEEE Computer Society Press (2020)","DOI":"10.1109\/FOCS46700.2020.00103"},{"key":"10_CR10","doi-asserted-by":"publisher","unstructured":"Boyle, E., Couteau, G., Gilboa, N., Ishai, Y., Kohl, L., Scholl, P.: Efficient pseudorandom correlation generators from ring-LPN. In: Shacham, H., Boldyreva, A. (eds.) Advances in Cryptology. CRYPTO 2020, Part II. LNCS, pp. 387\u2013416. Springer, Heidelberg (2020). https:\/\/doi.org\/10.1007\/978-3-030-56880-1_14","DOI":"10.1007\/978-3-030-56880-1_14"},{"key":"10_CR11","doi-asserted-by":"publisher","unstructured":"Boyle, E., Goldwasser, S., Ivan, I.: Functional signatures and pseudorandom functions. In: Krawczyk, H. (ed.) PKC 2014: 17th International Conference on Theory and Practice of Public Key Cryptography. LNCS, vol. 8383, pp. 501\u2013519. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-54631-0_29","DOI":"10.1007\/978-3-642-54631-0_29"},{"key":"10_CR12","doi-asserted-by":"publisher","unstructured":"Brakerski, Z., Branco, P., D\u00f6ttling, N., Garg, S., Malavolta, G.: Constant ciphertext-rate non-committing encryption from standard assumptions. In: TCC 2020: 18th Theory of Cryptography Conference, Part I. LNCS, vol. 12550, pp. 58\u201387. Springer, Heidelberg (2020). https:\/\/doi.org\/10.1007\/978-3-030-64375-1_3","DOI":"10.1007\/978-3-030-64375-1_3"},{"key":"10_CR13","doi-asserted-by":"publisher","unstructured":"Brakerski, Z., Branco, P., D\u00f6ttling, N., Pu, S.: Batch-OT with optimal rate. In: Dunkelman, O., Dziembowski, S. (eds.) Advances in Cryptology. EUROCRYPT 2022. LNCS, vol. 13276, pp. 157\u2013186. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-07085-3_6","DOI":"10.1007\/978-3-031-07085-3_6"},{"key":"10_CR14","doi-asserted-by":"crossref","unstructured":"Brakerski, Z., D\u00f6ttling, N., Garg, S., Malavolta, G.: Leveraging linear decryption: rate-1 fully-homomorphic encryption and time-lock puzzles. In: Hofheinz, D., Rosen, A. (eds.) TCC 2019: 17th Theory of Cryptography Conference, Part II. LNCS, vol. 11892, pp. 407\u2013437. Springer, Heidelberg (2019)","DOI":"10.1007\/978-3-030-36033-7_16"},{"key":"10_CR15","doi-asserted-by":"publisher","unstructured":"Brakerski, Z., Goldwasser, S.: Circular and leakage resilient public-key encryption under subgroup indistinguishability - (or: Quadratic residuosity strikes back). In: Rabin, T. (ed.) Advances in Cryptology. CRYPTO 2010. LNCS, vol. 6223, pp. 1\u201320. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14623-7_1","DOI":"10.1007\/978-3-642-14623-7_1"},{"key":"10_CR16","doi-asserted-by":"publisher","unstructured":"Branco, P., D\u00f6ttling, N., Srinivasan, A.: A framework for statistically sender private OT with optimal rate. In: Handschuh, H., Lysyanskaya, A. (eds.) Advances in Cryptology. CRYPTO 2023. LNCS, vol. 14081, pp. 548\u2013576. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38557-5_18","DOI":"10.1007\/978-3-031-38557-5_18"},{"key":"10_CR17","doi-asserted-by":"publisher","unstructured":"Catalano, D., Fiore, D.: Vector commitments and their applications. In: Kurosawa, K., Hanaoka, G. (eds.) PKC 2013: 16th International Conference on Theory and Practice of Public Key Cryptography. LNCS, vol. 7778, pp. 55\u201372. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36362-7_5","DOI":"10.1007\/978-3-642-36362-7_5"},{"key":"10_CR18","doi-asserted-by":"publisher","unstructured":"Chase, M., Garg, S., Hajiabadi, M., Li, J., Miao, P.: Amortizing rate-1 OT and applications to PIR and PSI. In: Nissim, K., Waters, B. (eds.) Theory of Cryptography. LNCS, vol. 13044, pp. 126\u2013156. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-90456-2_5","DOI":"10.1007\/978-3-030-90456-2_5"},{"key":"10_CR19","doi-asserted-by":"publisher","unstructured":"Dodis, Y., Halevi, S., Rothblum, R.D., Wichs, D.: Spooky encryption and its applications. In: Robshaw, M., Katz, J. (eds.) Advances in Cryptology. CRYPTO 2016, Part III. LNCS, vol. 9816, pp. 93\u2013122. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53015-3_4","DOI":"10.1007\/978-3-662-53015-3_4"},{"key":"10_CR20","doi-asserted-by":"publisher","unstructured":"Dodis, Y., Reyzin, L., Smith, A.: Fuzzy extractors: how to generate strong keys from biometrics and other noisy data. In: Cachin, C., Camenisch, J. (eds.) Advances in Cryptology. EUROCRYPT 2004. LNCS, vol. 3027, pp. 523\u2013540. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24676-3_31","DOI":"10.1007\/978-3-540-24676-3_31"},{"key":"10_CR21","doi-asserted-by":"publisher","unstructured":"D\u00f6ttling, N., Garg, S., Hajiabadi, M., Masny, D., Wichs, D.: Two-round oblivious transfer from CDH or LPN. In: Rijmen, V., Ishai, Y. (eds.) Advances in Cryptology. EUROCRYPT 2020, Part II. LNCS, vol. 12106, pp. 768\u2013797, Springer, Heidelberg (2020). https:\/\/doi.org\/10.1007\/978-3-030-45724-2_26","DOI":"10.1007\/978-3-030-45724-2_26"},{"key":"10_CR22","doi-asserted-by":"publisher","unstructured":"D\u00f6ttling, N., Garg, S., Ishai, Y., Malavolta, G., Mour, T., Ostrovsky, R.: Trapdoor hash functions and their applications. In: Boldyreva, A., Micciancio, D. (eds.) Advances in Cryptology. CRYPTO 2019, Part III. LNCS, vol. 11694, pp. 3\u201332. Springer, Heidelberg (2019). https:\/\/doi.org\/10.1007\/978-3-030-26954-8_1","DOI":"10.1007\/978-3-030-26954-8_1"},{"key":"10_CR23","doi-asserted-by":"publisher","unstructured":"Garg, S., Hajiabadi, M., Ostrovsky, R.: Efficient range-trapdoor functions and applications: rate-1 OT and more. In: TCC 2020: 18th Theory of Cryptography Conference, Part I. LNCS, vol. 12550, pp. 88\u2013116. Springer, Heidelberg (2020). https:\/\/doi.org\/10.1007\/978-3-030-64375-1_4","DOI":"10.1007\/978-3-030-64375-1_4"},{"key":"10_CR24","doi-asserted-by":"publisher","unstructured":"Garg, S., Srinivasan, A.: Two-round multiparty secure computation from minimal assumptions. In: Nielsen, J.B., Rijmen, V. (eds.) Advances in Cryptology. EUROCRYPT 2018, Part II. LNCS, vol. 10821, pp. 468\u2013499. Springer, Heidelberg (2018). https:\/\/doi.org\/10.1007\/978-3-319-78375-8_16","DOI":"10.1007\/978-3-319-78375-8_16"},{"key":"10_CR25","doi-asserted-by":"publisher","unstructured":"Gentry, C., Halevi, S.: Compressible FHE with applications to PIR. In: Hofheinz, D., Rosen, A. (eds.) TCC 2019: 17th Theory of Cryptography Conference, Part II. LNCS, vol. 11892, pp. 438\u2013464. Springer, Heidelberg (2019). https:\/\/doi.org\/10.1007\/978-3-030-36033-7_17","DOI":"10.1007\/978-3-030-36033-7_17"},{"key":"10_CR26","doi-asserted-by":"publisher","unstructured":"Ishai, Y., Kilian, J., Nissim, K., Petrank, E.: Extending oblivious transfers efficiently. In: Boneh, D. (ed.) Advances in Cryptology. CRYPTO 2003. LNCS, vol. 2729, pp. 145\u2013161. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45146-4_9","DOI":"10.1007\/978-3-540-45146-4_9"},{"key":"10_CR27","doi-asserted-by":"publisher","unstructured":"Ishai, Y., Kushilevitz, E., Ostrovsky, R., Prabhakaran, M., Sahai, A.: Efficient non-interactive secure computation. In: Paterson, K.G. (ed.) Advances in Cryptology. EUROCRYPT 2011. LNCS, vol. 6632, pp. 406\u2013425. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-20465-4_23","DOI":"10.1007\/978-3-642-20465-4_23"},{"key":"10_CR28","doi-asserted-by":"publisher","unstructured":"Ishai, Y., Prabhakaran, M., Sahai, A.: Founding cryptography on oblivious transfer - efficiently. In: Wagner, D. (ed.) Advances in Cryptology. CRYPTO 2008. LNCS, vol. 5157, pp. 572\u2013591. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85174-5_32","DOI":"10.1007\/978-3-540-85174-5_32"},{"key":"10_CR29","doi-asserted-by":"crossref","unstructured":"Kiayias, A., Papadopoulos, S., Triandopoulos, N., Zacharias, T.: Delegatable pseudorandom functions and applications. In: Sadeghi, A.R., Gligor, V.D., Yung, M. (eds.) ACM CCS 2013: 20th Conference on Computer and Communications Security, pp. 669\u2013684. ACM Press, Berlin (2013)","DOI":"10.1145\/2508859.2516668"},{"key":"10_CR30","doi-asserted-by":"crossref","unstructured":"Kilian, J.: Founding cryptography on oblivious transfer. In: 20th Annual ACM Symposium on Theory of Computing, pp. 20\u201331. ACM Press, Chicago (1988)","DOI":"10.1145\/62212.62215"},{"key":"10_CR31","unstructured":"Naor, M., Pinkas, B.: Efficient oblivious transfer protocols. In: Kosaraju, S.R. (ed.) 12th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 448\u2013457. ACM-SIAM, Washington (2001)"},{"key":"10_CR32","doi-asserted-by":"publisher","unstructured":"Orlandi, C., Scholl, P., Yakoubov, S.: The rise of Paillier: homomorphic secret sharing and public-key silent OT. In: Canteaut, A., Standaert, F.X. (eds.) Advances in Cryptology. EUROCRYPT 2021, pp. 678\u2013708. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77870-5_24","DOI":"10.1007\/978-3-030-77870-5_24"},{"key":"10_CR33","doi-asserted-by":"publisher","unstructured":"Peikert, C., Shiehian, S.: Noninteractive zero knowledge for NP from (plain) learning with errors. In: Boldyreva, A., Micciancio, D. (eds.) Advances in Cryptology. CRYPTO 2019, Part I. LNCS, vol. 11692, pp. 89\u2013114. Springer, Heidelberg (2019). https:\/\/doi.org\/10.1007\/978-3-662-53015-3_4","DOI":"10.1007\/978-3-662-53015-3_4"},{"key":"10_CR34","doi-asserted-by":"publisher","unstructured":"Peikert, C., Vaikuntanathan, V., Waters, B.: A framework for efficient and composable oblivious transfer. In: Wagner, D. (ed.) Advances in Cryptology. CRYPTO 2008. LNCS, vol. 5157, pp. 554\u2013571. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85174-5_31","DOI":"10.1007\/978-3-540-85174-5_31"},{"key":"10_CR35","doi-asserted-by":"crossref","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. In: Gabow, H.N., Fagin, R. (eds.) 37th Annual ACM Symposium on Theory of Computing, pp. 84\u201393. ACM Press, Baltimore (2005)","DOI":"10.1145\/1060590.1060603"},{"key":"10_CR36","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, Toronto (1986)","DOI":"10.1109\/SFCS.1986.25"}],"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-58751-1_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,12]],"date-time":"2024-05-12T23:04:20Z","timestamp":1715555060000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-58751-1_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031587504","9783031587511"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-58751-1_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"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"}}]}}