{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,23]],"date-time":"2026-04-23T10:55:24Z","timestamp":1776941724910,"version":"3.51.4"},"publisher-location":"Singapore","reference-count":65,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819608874","type":"print"},{"value":"9789819608881","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,12,11]],"date-time":"2024-12-11T00:00:00Z","timestamp":1733875200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,11]],"date-time":"2024-12-11T00:00:00Z","timestamp":1733875200000},"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-981-96-0888-1_7","type":"book-chapter","created":{"date-parts":[[2024,12,10]],"date-time":"2024-12-10T09:13:13Z","timestamp":1733821993000},"page":"197-231","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["QuietOT: Lightweight Oblivious Transfer with\u00a0a\u00a0Public-Key Setup"],"prefix":"10.1007","author":[{"given":"Geoffroy","family":"Couteau","sequence":"first","affiliation":[]},{"given":"Lalita","family":"Devadas","sequence":"additional","affiliation":[]},{"given":"Srinivas","family":"Devadas","sequence":"additional","affiliation":[]},{"given":"Alexander","family":"Koch","sequence":"additional","affiliation":[]},{"given":"Sacha","family":"Servan-Schreiber","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,12,11]]},"reference":[{"key":"7_CR1","unstructured":"M. Albrecht, M. Chase, H. Chen, J. Ding, S. Goldwasser, S. Gorbunov, S. Halevi, J. Hoffstein, K. Laine, K. Lauter, S. Lokam, D. Micciancio, D. Moody, T. Morrison, A. Sahai, and V. Vaikuntanathan. Homomorphic Encryption Security Standard. Tech. rep. HomomorphicEncryption.org, 2018. url: https:\/\/homomorphicencryption.org\/wp-content\/uploads\/2018\/11\/HomomorphicEncryptionStandardv1.1.pdf"},{"key":"7_CR2","doi-asserted-by":"publisher","unstructured":"B. Applebaum, I. Damg\u00e5rd, Y. Ishai, M. Nielsen, and L. Zichron. \u201cSecure arithmetic computation with constant computational overhead\u201d. In: CRYPTO 2017. Ed. by J. Katz and H. Shacham. LNCS 10401. Springer,2017, pp. 223\u2013254. https:\/\/doi.org\/10.1007\/978-3-319-63688-7_8.","DOI":"10.1007\/978-3-319-63688-7_8"},{"key":"7_CR3","doi-asserted-by":"publisher","unstructured":"B. Applebaum and S. Lovett. \u201cAlgebraic attacks against random local functions and their countermeasures\u201d. In:STOC 2016. Ed. by D. Wichs and Y. Mansour. ACM, 2016, pp. 1087\u20131100. https:\/\/doi.org\/10.1145\/2897518.2897554.","DOI":"10.1145\/2897518.2897554"},{"key":"7_CR4","doi-asserted-by":"publisher","unstructured":"B. Applebaum and P. Raykov. \u201cFast pseudorandom functions based on expander graphs\u201d. In: TCC 2016-B. Ed. by M. Hirt and A. D. Smith. LNCS 9985. Springer, 2016, pp. 27\u201356. https:\/\/doi.org\/10.1007\/978-3-662-53641-4_2.","DOI":"10.1007\/978-3-662-53641-4_2"},{"key":"7_CR5","doi-asserted-by":"publisher","unstructured":"G. Asharov, Y. Lindell, T. Schneider, and M. Zohner. \u201cMore efficient oblivious transfer and extensions for faster secure computation\u201d. In:CCS 2013. Ed. by A. Sadeghi, V. D. Gligor, and M. Yung. ACM, 2013, pp. 535\u2013548. https:\/\/doi.org\/10.1145\/2508859.2516738.","DOI":"10.1145\/2508859.2516738"},{"key":"7_CR6","doi-asserted-by":"publisher","unstructured":"N. Attrapadung, T. Matsuda, R. Nishimaki, S. Yamada, and T. Yamakawa. \u201cConstrained PRFs for NC1 in traditional groups\u201d. In: CRYPTO 2018. Ed. by H. Shacham and A. Boldyreva. LNCS 10992. Springer, 2018, pp. 543\u2013574. https:\/\/doi.org\/10.1007\/978-3-319-96881-0_19.","DOI":"10.1007\/978-3-319-96881-0_19"},{"key":"7_CR7","unstructured":"G. Banegas, K. Carrier, A. Chailloux, A. Couvreur, T. Debris-Alazard, P. Gaborit, P. Karpman, J. Loyer, R. Niederhagen, N. Sendrier, B. Smith, and J.-P. Tilich. WAVE: Round 1Submission. Version 1. 2023. url:https:\/\/wave-sign.org\/wave documentation.pdf (visited on 01\/21\/2024)."},{"key":"7_CR8","doi-asserted-by":"publisher","unstructured":"A. Banerjee, C. Peikert, and A. Rosen. \u201cPseudorandom functions and lattices\u201d. In:EUROCRYPT 2012. Ed. by D. Pointcheval and T. Johansson. LNCS 7237. Springer, 2012, pp. 719\u2013737. https:\/\/doi.org\/10.1007\/978-3-642-29011-4_42.","DOI":"10.1007\/978-3-642-29011-4_42"},{"key":"7_CR9","doi-asserted-by":"publisher","unstructured":"B. Barak, Y. Dodis, H. Krawczyk, O. Pereira, K. Pietrzak, F.-X. Standaert, and Y. Yu. \u201cLeftover Hash Lemma, Revisited\u201d. In:CRYPTO 2011. Ed. by P. Rogaway. LNCS 6841. Springer, 2011, pp. 1\u201320. https:\/\/doi.org\/10.1007\/978-3-642-22792-9_1.","DOI":"10.1007\/978-3-642-22792-9_1"},{"key":"7_CR10","doi-asserted-by":"publisher","unstructured":"J. Bartusek, S. Garg, D. Masny, and P. Mukherjee. \u201cReusable two-round MPC from DDH\u201d. In: TCC 2020. Ed. by R. Pass and K. Pietrzak. LNCS 12551. Springer, 2020, pp. 320\u2013348. https:\/\/doi.org\/10.1007\/978-3-030-64378-2_12.","DOI":"10.1007\/978-3-030-64378-2_12"},{"key":"7_CR11","doi-asserted-by":"publisher","unstructured":"D. Beaver. \u201cCorrelated pseudorandomness and the complexity of private computations\u201d. In: STOC 1996. Ed. by G. L. Miller. ACM, 1996, pp. 479\u2013488. https:\/\/doi.org\/10.1145\/237814.237996.","DOI":"10.1145\/237814.237996"},{"key":"7_CR12","doi-asserted-by":"publisher","unstructured":"D. Beaver. \u201cPrecomputing oblivious transfer\u201d. In: CRYPTO 1995. Ed. by D. Coppersmith. LNCS 963. Springer, 1995, pp. 97\u2013109. https:\/\/doi.org\/10.1007\/3-540-44750-4_8.","DOI":"10.1007\/3-540-44750-4_8"},{"key":"7_CR13","doi-asserted-by":"publisher","unstructured":"M. Bellare and P. Rogaway. \u201cRandom oracles are practical: A paradigm for designing efficient protocols\u201d. In: CCS 1993. 1993, pp. 62\u201373. https:\/\/doi.org\/10.1201\/9781420010756.","DOI":"10.1201\/9781420010756"},{"key":"7_CR14","doi-asserted-by":"publisher","unstructured":"E. Biham. \u201cNew types of cryptanalytic attacks using related keys\u201d. In: EUROCRYPT 1993. Ed. by T. Helleseth. LNCS 765. Springer, 1994, pp. 398\u2013409. https:\/\/doi.org\/10.1007\/3-540-48285-7_34.","DOI":"10.1007\/3-540-48285-7_34"},{"key":"7_CR15","doi-asserted-by":"publisher","unstructured":"D. Boneh, Y. Ishai, A. Passel\u00e8gue, A. Sahai, and D. J. Wu. \u201cExploring crypto dark matter: New simple PRF candidates and their applications\u201d. In: TCC 2018. Ed. by A. Beimel and S. Dziembowski. LNCS 11240.Springer, 2018, pp. 699\u2013729. https:\/\/doi.org\/10.1007\/978-3-030-03810-6_25","DOI":"10.1007\/978-3-030-03810-6_25"},{"key":"7_CR16","doi-asserted-by":"publisher","unstructured":"D. Boneh and B. Waters. \u201cConstrained pseudorandom functions and their applications\u201d. In:ASIACRYPT 2013. Ed. by K. Sako and P. Sarkar. LNCS 8270. Springer, 2013, pp. 280\u2013300. https:\/\/doi.org\/10.1007\/978-3-642-42045-0_15.","DOI":"10.1007\/978-3-642-42045-0_15"},{"key":"7_CR17","doi-asserted-by":"publisher","unstructured":"E. Boyle, G. Couteau, N. Gilboa, Y. Ishai, L. Kohl, N. Resch, and P. Scholl. \u201cCorrelated pseudorandomness from expand-accumulate codes\u201d.In: CRYPTO 2022. Ed. by Y. Dodis and T. Shrimpton. LNCS 13508.Springer, 2022, pp. 603\u2013633. https:\/\/doi.org\/10.1007\/978-3-031-15979-4_21.","DOI":"10.1007\/978-3-031-15979-4_21"},{"key":"7_CR18","doi-asserted-by":"publisher","unstructured":"E. Boyle, G. Couteau, N. Gilboa, Y. Ishai, L. Kohl, P. Rindal, and P. Scholl. \u201cEfficient two-round OT extension and silent non-interactive secure computation\u201d. In: CCS 2019. Ed. by L. Cavallaro, J. Kinder, X.Wang, and J. Katz. ACM, 2019, pp. 291\u2013308. https:\/\/doi.org\/10.1145\/3319535.3354255.","DOI":"10.1145\/3319535.3354255"},{"key":"7_CR19","doi-asserted-by":"publisher","unstructured":"E. Boyle, G. Couteau, N. Gilboa, Y. Ishai, L. Kohl, and P. Scholl. \u201cCorrelated pseudorandom functions from variable-density LPN\u201d. In:FOCS 2020. Ed. by S. Irani. IEEE, 2020, pp. 1069\u20131080. https:\/\/doi.org\/10.1109\/FOCS46700.2020.00103.","DOI":"10.1109\/FOCS46700.2020.00103"},{"key":"7_CR20","doi-asserted-by":"publisher","unstructured":"E. Boyle, G. Couteau, N. Gilboa, Y. Ishai, L. Kohl, and P. Scholl. \u201cEfficient pseudorandom correlation generators: Silent OT extension and more\u201d. In: CRYPTO 2019. Ed. by A. Boldyreva and D. Micciancio. LNCS 11694. Springer, 2019, pp. 489\u2013518. https:\/\/doi.org\/10.1007\/978-3-030-26954-8_16.","DOI":"10.1007\/978-3-030-26954-8_16"},{"key":"7_CR21","doi-asserted-by":"publisher","unstructured":"E. Boyle, S. Goldwasser, and I. Ivan.\u201cFunctional signatures and pseudorandom functions\u201d. In: PKC 2014. Ed. by H. Krawczyk. LNCS 8383. Springer, 2014, pp. 501\u2013519. https:\/\/doi.org\/10.1007\/978-3-642-54631-0_29","DOI":"10.1007\/978-3-642-54631-0_29"},{"key":"7_CR22","doi-asserted-by":"publisher","unstructured":"E. Boyle, L. Kohl, and P. Scholl. \u201cHomomorphic secret sharing from lattices without FHE\u201d. In:EUROCRYPT 2019. Ed. by Y. Ishai and V. Rijmen. LNCS 11477. Springer, 2019, pp. 3\u201333. https:\/\/doi.org\/10.1007\/978-3-030-17656-3_1.","DOI":"10.1007\/978-3-030-17656-3_1"},{"key":"7_CR23","doi-asserted-by":"publisher","unstructured":"Z. Brakerski, R. Tsabary, V. Vaikuntanathan, and H. Wee. \u201cPrivate constrained PRFs (and more) from LWE\u201d. In: TCC 2017. Ed. by Y. Kalai and L. Reyzin. LNCS 10677. Springer, 2017, pp. 264\u2013302. https:\/\/doi.org\/10.1007\/978-3-319-70500-2_10.","DOI":"10.1007\/978-3-319-70500-2_10"},{"key":"7_CR24","doi-asserted-by":"publisher","unstructured":"Z. Brakerski and V. Vaikuntanathan. \u201cConstrained Key-Homomorphic PRFs from Standard Lattice Assumptions: Or: How to Secretly Embed a Circuit in Your PRF\u201d. In: TCC 2015. Ed. by Y. Dodis and J. B. Nielsen. LNCS 9015. Springer, 2015, pp. 1\u201330. https:\/\/doi.org\/10.1007\/978-3-662-46497-7_1.","DOI":"10.1007\/978-3-662-46497-7_1"},{"key":"7_CR25","doi-asserted-by":"publisher","unstructured":"D. Bui, G. Couteau, P. Meyer, A. Passel\u2018egue, and M. Riahinia. \u201cFast Public-Key Silent OT and More from Constrained Naor-Reingold\u201d. In: EUROCRYPT 2024. Ed. by M. Joye and G. Leander. LNCS 14656. Springer, 2024, pp. 88\u2013118. https:\/\/doi.org\/10.1007\/978-3-031-58751-1_4.","DOI":"10.1007\/978-3-031-58751-1_4"},{"key":"7_CR26","doi-asserted-by":"publisher","unstructured":"R. Canetti and Y. Chen. \u201cConstraint-hiding constrained PRFs for NC$$^{1}$$ from LWE\u201d. In: EUROCRYPT 2017. Ed. by J. Coron and J. B. Nielsen. LNCS 10210. Springer, 2017, pp. 446\u2013476. https:\/\/doi.org\/10.1007\/978-3-319-56620-7_16.","DOI":"10.1007\/978-3-319-56620-7_16"},{"key":"7_CR27","doi-asserted-by":"publisher","unstructured":"Y. Chen, V. Vaikuntanathan, and H. Wee. \u201cGGH15 beyond permutation branching programs: proofs, attacks, and candidates\u201d. In: CRYPTO 2018. Ed. by H. Shacham and A. Boldyreva. LNCS 10992. Springer, 2018, pp. 577\u2013607. https:\/\/doi.org\/10.1007\/978-3-319-96881-0_20.","DOI":"10.1007\/978-3-319-96881-0_20"},{"key":"7_CR28","doi-asserted-by":"publisher","unstructured":"M. Ciampi, R. Ostrovsky, L. Siniscalchi, and H. Waldner. \u201cList oblivious transfer and applications to round-optimal black-box multiparty coin tossing\u201d. In: CRYPTO 2023. Ed. by H. Handschuh and A. Lysyanskaya. LNCS 14081. Springer, 2023, pp. 459\u2013488. https:\/\/doi.org\/10.1007\/978-3-031-38557-5_15.","DOI":"10.1007\/978-3-031-38557-5_15"},{"key":"7_CR29","unstructured":"G. Couteau, L. Devadas, S. Devadas, A. Koch, and S. Servan-Schreiber. QuietOT: Lightweight Oblivious Transfer with a Public-Key Setup. Full version. 2024. Cryptology ePrint Archive, Report 2024\/1079."},{"key":"7_CR30","doi-asserted-by":"publisher","unstructured":"G. Couteau and C. Ducros. \u201cPseudorandom Correlation Functions from Variable-Density LPN, Revisited\u201d. In: PKC 2023. Ed. by A. Boldyreva and V. Kolesnikov. LNCS 13941. Springer, 2023, pp. 221\u2013250. https:\/\/doi.org\/10.1007\/978-3-031-31371-4_8.","DOI":"10.1007\/978-3-031-31371-4_8"},{"key":"7_CR31","doi-asserted-by":"publisher","unstructured":"G. Couteau, A. Dupin, P. M\u00e9aux, M. Rossi, and Y. Rotella. \u201cOn the concrete security of Goldreich\u2019s pseudorandom generator\u201d. In: ASIACRYPT 2018. Ed. by T. Peyrin and S. D. Galbraith. LNCS 11273. Springer, 2018, pp. 96\u2013124. https:\/\/doi.org\/10.1007\/978-3-030-03329-3_4.","DOI":"10.1007\/978-3-030-03329-3_4"},{"key":"7_CR32","doi-asserted-by":"publisher","unstructured":"G. Couteau, P. Meyer, A. Passel\u2018egue, and M. Riahinia. \u201cConstrained Pseudorandom Functions from Homomorphic Secret Sharing\u201d. In: EUROCRYPT 2023. Ed. by C. Hazay and M. Stam. LNCS 14006. Springer, 2023, pp. 194\u2013224. https:\/\/doi.org\/10.1007\/978-3-031-30620-4_7.","DOI":"10.1007\/978-3-031-30620-4_7"},{"key":"7_CR33","doi-asserted-by":"publisher","unstructured":"G. Couteau, P. Rindal, and S. Raghuraman. \u201cSilver: Silent VOLE and Oblivious Transfer from Hardness of Decoding Structured LDPC Codes\u201d. In: CRYPTO 2021. Ed. by T. Malkin and C. Peikert. LNCS 12827. Springer,2021, pp. 502\u2013534. https:\/\/doi.org\/10.1007\/978-3-030-84252-9_17.","DOI":"10.1007\/978-3-030-84252-9_17."},{"key":"7_CR34","doi-asserted-by":"publisher","unstructured":"G. Couteau and M. Zarezadeh. \u201cNon-interactive Secure Computation of Inner-Product from LPN and LWE\u201d. In: ASIACRYPT 2022. Ed. by S. Agrawal and D. Lin. LNCS 13791. Springer, 2022, pp. 474\u2013503. https:\/\/doi.org\/10.1007\/978-3-031-22963-3_16.","DOI":"10.1007\/978-3-031-22963-3_16"},{"key":"7_CR35","doi-asserted-by":"publisher","unstructured":"A. Davidson, S. Katsumata, R. Nishimaki, S. Yamada, and T. Yamakawa. \u201cAdaptively secure constrained pseudorandom functions in the standard model\u201d. In: CRYPTO 2020. Ed. by D. Micciancio and T. Ristenpart. LNCS 12170. Springer, 2020, pp. 559\u2013589. https:\/\/doi.org\/10.1007\/978-3-030-56784-2_19.","DOI":"10.1007\/978-3-030-56784-2_19"},{"key":"7_CR36","doi-asserted-by":"publisher","unstructured":"L. de Castro, C. Juvekar, and V. Vaikuntanathan. \u201cFast vector oblivious linear evaluation from ring learning with errors\u201d. In: WAHC 2021: Workshop on Encrypted Computing & Applied Homomorphic Cryptography. 2021, pp. 29\u201341. https:\/\/doi.org\/10.1145\/3474366.3486928","DOI":"10.1145\/3474366.3486928"},{"key":"7_CR37","doi-asserted-by":"publisher","unstructured":"W. Diffie and M. Hellman. \u201cNew directions in cryptography\u201d. In:IEEE Transactions on Information Theory 22.6 (1976), pp. 644\u2013654. https:\/\/doi.org\/10.1109\/TIT.1976.1055638.","DOI":"10.1109\/TIT.1976.1055638"},{"key":"7_CR38","doi-asserted-by":"publisher","unstructured":"Y. Dodis, S. Halevi, R. D. Rothblum, and D. Wichs. \u201cSpooky encryption and its applications\u201d. In: CRYPTO 2016. Ed. by M. Robshaw and J. Katz. LNCS 9816. Springer, 2016, pp. 93\u2013122. https:\/\/doi.org\/10.1007\/978-3-662-53015-3_4.","DOI":"10.1007\/978-3-662-53015-3_4"},{"key":"7_CR39","doi-asserted-by":"publisher","unstructured":"P. Elias. \u201cError-correcting codes for list decoding\u201d. In: IEEE Transactions on Information Theory 37.1 (1991), pp. 5\u201312. https:\/\/doi.org\/10.1109\/18.61123.","DOI":"10.1109\/18.61123"},{"key":"7_CR40","doi-asserted-by":"publisher","unstructured":"S. Garg, M. Mahmoody, D. Masny, and I. Meckler. \u201cOn the round complexity of OT extension\u201d. In: CRYPTO 2018. Ed. by H. Shacham and A. Boldyreva. LNCS 10993. Springer, 2018, pp. 545\u2013574. https:\/\/doi.org\/10.1007\/978-3-319-96878-0_19.","DOI":"10.1007\/978-3-319-96878-0_19"},{"key":"7_CR41","doi-asserted-by":"publisher","unstructured":"O. Goldreich. \u201cCandidate one-way functions based on expander graphs\u201d. In:Studies in Complexity and Cryptography. Ed. by O. Goldreich. LNCS 6650. Springer, 2011, pp. 76\u201387. https:\/\/doi.org\/10.1007\/978-3-642-22670-0_10.","DOI":"10.1007\/978-3-642-22670-0_10"},{"key":"7_CR42","doi-asserted-by":"publisher","unstructured":"O. Goldreich, S. Micali, and A. Wigderson. \u201cHow to play any mental game, or a completeness theorem for protocols with honest majority\u201d. In: Providing Sound Foundations for Cryptography: On the Work of Shafi Goldwasser and Silvio Micali. Ed. by O. Goldreich. ACM, 2019, pp. 307\u2013328.https:\/\/doi.org\/10.1145\/3335741.3335755.","DOI":"10.1145\/3335741.3335755"},{"key":"7_CR43","doi-asserted-by":"publisher","unstructured":"C. Guo, J. Katz, X. Wang, and Y. Yu. \u201cEfficient and Secure Multiparty Computation from Fixed-Key Block Ciphers\u201d. In: SP 2020. IEEE, 2020, pp. 825\u2013841. https:\/\/doi.org\/10.1109\/SP40000.2020.00016.","DOI":"10.1109\/SP40000.2020.00016"},{"key":"7_CR44","doi-asserted-by":"publisher","unstructured":"J. H\u00c5stad, R. Impagliazzo, L. A. Levin, and M. Luby. \u201cA Pseudorandom Generator from any One-way Function\u201d. In: SIAM Journal on Computing 28.4 (1999), pp. 1364\u20131396. https:\/\/doi.org\/10.1137\/S0097539793244708.","DOI":"10.1137\/S0097539793244708"},{"key":"7_CR45","doi-asserted-by":"publisher","unstructured":"R. Impagliazzo and S. Rudich. \u201cLimits on the provable consequences of one-way permutations\u201d. In:STOC 1989. Ed. by D. S. Johnson. ACM, 1989, pp. 44\u201361. https:\/\/doi.org\/10.1145\/73007.73012.","DOI":"10.1145\/73007.73012"},{"key":"7_CR46","unstructured":"J. Indigo and D. Smart. Page Weight: 2022: The Web Almanac by HTTP Archive. 2022. url: https:\/\/almanac.httparchive.org\/en\/2022\/page-weight (visited on 02\/29\/2024)."},{"key":"7_CR47","doi-asserted-by":"publisher","unstructured":"Y. Ishai, J. Kilian, K. Nissim, and E. Petrank. \u201cExtending oblivious transfers efficiently\u201d. In: CRYPTO 2003. Ed. by D. Boneh. LNCS 2729. Springer, 2003, pp. 145\u2013161. https:\/\/doi.org\/10.1007\/978-3-540-45146-4_9.","DOI":"10.1007\/978-3-540-45146-4_9"},{"key":"7_CR48","doi-asserted-by":"publisher","unstructured":"book J. Katz and Y. Lindell. Introduction to modern cryptography: principles and protocols. 1st ed. Chapman and Hall\/CRC, 2007. https:\/\/doi.org\/10.1201\/9781420010756.","DOI":"10.1201\/9781420010756"},{"key":"7_CR49","doi-asserted-by":"publisher","unstructured":". A. Kiayias, S. Papadopoulos, N. Triandopoulos, and T. Zacharias. \u201cDelegatable pseudorandom functions and applications\u201d. In: CCS 2013. Ed. by A. Sadeghi, V. D. Gligor, and M. Yung. ACM, 2013, pp. 669\u2013684. https:\/\/doi.org\/10.1145\/2508859.2516668.","DOI":"10.1145\/2508859.2516668"},{"key":"7_CR50","doi-asserted-by":"publisher","unstructured":"J. Kilian. \u201cFounding cryptography on oblivious transfer\u201d. In: STOC 1988. Ed. by J. Simon. ACM, 1988, pp. 20\u201331. https:\/\/doi.org\/10.1145\/62212.62215.","DOI":"10.1145\/62212.62215"},{"key":"7_CR51","doi-asserted-by":"publisher","unstructured":"V. Lyubashevsky, C. Peikert, and O. Regev. \u201cA toolkit for ring-LWE cryptography\u201d. In: EUROCRYPT 2013. Ed. by T. Johansson and P. Q. Nguyen. LNCS 7881. Springer, 2013, pp. 35\u201354. https:\/\/doi.org\/10.1007\/978-3-642-38348-9_3.","DOI":"10.1007\/978-3-642-38348-9_3"},{"key":"7_CR52","doi-asserted-by":"publisher","unstructured":"V. Lyubashevsky, C. Peikert, and O. Regev. \u201cOn ideal lattices and learning with errors over rings\u201d. In: EUROCRYPT 2010. Ed. by H. Gilbert. LNCS 6110. Springer, 2010, pp. 1\u201323. https:\/\/doi.org\/10.1007\/978-3-642-13190-5_1.","DOI":"10.1007\/978-3-642-13190-5_1"},{"key":"7_CR53","doi-asserted-by":"publisher","unstructured":"S. J. Menon and D. J. Wu. \u201cSPIRAL: Fast, high-rate single-server PIR via FHE composition\u201d. In: SP 2022. IEEE, 2022, pp. 930\u2013947. https:\/\/doi.org\/10.1109\/SP46214.2022.9833700.","DOI":"10.1109\/SP46214.2022.9833700"},{"key":"7_CR54","doi-asserted-by":"publisher","unstructured":"M. Naor and O. Reingold. \u201cNumber-theoretic constructions of efficient pseudo-random functions\u201d. In: Journal of the ACM 51.2 (2004), pp. 231\u2013262. https:\/\/doi.org\/10.1145\/972639.972643.","DOI":"10.1145\/972639.972643"},{"key":"7_CR55","doi-asserted-by":"publisher","unstructured":"C. Orlandi, P. Scholl, and S. Yakoubov. \u201cThe rise of Paillier: homomorphic secret sharing and public-key silent OT\u201d. In:EUROCRYPT 2021. Ed. by A. Canteaut and F. Standaert. LNCS 12696. Springer, 2021, pp. 678\u2013708. https:\/\/doi.org\/10.1007\/978-3-030-77870-5_24.","DOI":"10.1007\/978-3-030-77870-5_24"},{"key":"7_CR56","doi-asserted-by":"publisher","unstructured":"C. Peikert and S. Shiehian. \u201cPrivately constraining and programming PRFs, the LWE way\u201d. In: PKC 2018. Ed. by M. Abdalla and R. Dahab. LNCS 10770. Springer, 2018, pp. 675\u2013701. https:\/\/doi.org\/10.1007\/978-3-319-76581-5_23.","DOI":"10.1007\/978-3-319-76581-5_23"},{"key":"7_CR57","doi-asserted-by":"publisher","unstructured":"S. Raghuraman, P. Rindal, and T. Tanguy. \u201cExpand-Convolute Codes for Pseudorandom Correlation Generators from LPN\u201d. In: CRYPTO 2023. Ed. by H. Handschuh and A. Lysyanskaya. LNCS 14084. Springer, 2023,pp. 602\u2013632. https:\/\/doi.org\/10.1007\/978-3-031-38551-3_19.","DOI":"10.1007\/978-3-031-38551-3_19"},{"key":"7_CR58","unstructured":"P. Rindal and L. Roy. libOTe: an efficient, portable, and easy to use Oblivious Transfer Library. url: https:\/\/github.com\/osu-crypto\/libOTe (visited on 01\/31\/2024)."},{"key":"7_CR59","doi-asserted-by":"publisher","unstructured":"L. Roy. \u201cSoftSpokenOT: Quieter OT extension from small-field silent VOLE in the Minicrypt model\u201d. In: CRYPTO 2022. Ed. by Y. Dodis and T. Shrimpton. LNCS 12507. Springer, 2022, pp. 657\u2013687. https:\/\/doi.org\/10.1007\/978-3-031-15802-5_23.","DOI":"10.1007\/978-3-031-15802-5_23"},{"key":"7_CR60","doi-asserted-by":"publisher","unstructured":"P. Schoppmann, A. Gasc\u00f3n, L. Reichert, and M. Raykova. \u201cDistributed Vector-OLE: Improved constructions and implementation\u201d. In: CCS 2019.Ed. by L. Cavallaro, J. Kinder, X.Wang, and J. Katz. ACM, 2019, pp. 1055\u20131072. https:\/\/doi.org\/10.1145\/3319535.3363228.","DOI":"10.1145\/3319535.3363228"},{"key":"7_CR61","unstructured":"S. Servan-Schreiber. Constrained Pseudorandom Functions for Inner-Product Predicates from Weaker Assumptions. 2024. Cryptology ePrint Archive, Report 2024\/058."},{"key":"7_CR62","unstructured":"The OpenSSL Project.OpenSSL: Cryptography and SSL\/TLS Toolkit. 2024. url: https:\/\/www.openssl.org\/ (visited on 02\/12\/2024)."},{"key":"7_CR63","unstructured":"A. \u00dcnal. New Baselines for Local Pseudorandom Number Generators by Field Extensions. 2023. Cryptology ePrint Archive, Report 2023\/550."},{"key":"7_CR64","doi-asserted-by":"publisher","unstructured":"J. Yang, Q. Guo, T. Johansson, and M. Lentmaier. \u201cRevisiting the concrete security of Goldreich\u2019s pseudorandom generator\u201d. In:IEEE Transactions on Information Theory 68.2 (2021), pp. 1329\u20131354. https:\/\/doi.org\/10.1109\/TIT.2021.3128315.","DOI":"10.1109\/TIT.2021.3128315"},{"key":"7_CR65","doi-asserted-by":"publisher","unstructured":"K. Yang, C.Weng, X. Lan, J. Zhang, and X. Wang. \u201cFerret: Fast extension for correlated OT with small communication\u201d. In: CCS 2020. Ed. by J. Ligatti, X. Ou, J. Katz, and G. Vigna. ACM, 2020, pp. 1607\u20131626. https:\/\/doi.org\/10.1145\/3372297.3417276.","DOI":"10.1145\/3372297.3417276"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 ASIACRYPT 2024"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-0888-1_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,10]],"date-time":"2024-12-10T09:35:39Z","timestamp":1733823339000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-0888-1_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,11]]},"ISBN":["9789819608874","9789819608881"],"references-count":65,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-0888-1_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,12,11]]},"assertion":[{"value":"11 December 2024","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":"Kolkata","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","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":"10 December 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 December 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"asiacrypt2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/asiacrypt.iacr.org\/2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}