{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T16:03:17Z","timestamp":1783008197306,"version":"3.54.5"},"publisher-location":"Cham","reference-count":65,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031683961","type":"print"},{"value":"9783031683978","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-68397-8_9","type":"book-chapter","created":{"date-parts":[[2024,8,15]],"date-time":"2024-08-15T22:01:41Z","timestamp":1723759301000},"page":"274-308","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Improved Alternating-Moduli PRFs and\u00a0Post-quantum Signatures"],"prefix":"10.1007","author":[{"given":"Navid","family":"Alamati","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Guru-Vamsi","family":"Policharla","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Srinivasan","family":"Raghuraman","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Peter","family":"Rindal","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,8,16]]},"reference":[{"key":"9_CR1","unstructured":"Adj, G., et al.: MiRitH. Tech. rep., National Institute of Standards and Technology (2023). https:\/\/csrc.nist.gov\/csrc\/media\/Projects\/pqc-dig-sig\/documents\/round-1\/spec-files\/MiRitH_spec-web.pdf"},{"key":"9_CR2","unstructured":"Advanced Encryption Standard (AES). National Institute of Standards and Technology, NIST FIPS PUB 197, U.S. Department of Commerce (2001)"},{"key":"9_CR3","doi-asserted-by":"publisher","unstructured":"Aguilar Melchor, C., Gama, N., Howe, J., H\u00fclsing, A., Joseph, D., Yue, D.: The return of the SDitH, pp. 564\u2013596 (2023). https:\/\/doi.org\/10.1007\/978-3-031-30589-4_20","DOI":"10.1007\/978-3-031-30589-4_20"},{"key":"9_CR4","doi-asserted-by":"publisher","unstructured":"Akavia, A., Bogdanov, A., Guo, S., Kamath, A., Rosen, A.: Candidate weak pseudorandom functions in $$\\sf AC^0$$$$o$$$$\\text{MOD}_2$$, pp. 251\u2013260 (2014).https:\/\/doi.org\/10.1145\/2554797.2554821","DOI":"10.1145\/2554797.2554821"},{"key":"9_CR5","unstructured":"Alamati, N., Policharla, G.V., Raghuraman, S., Rindal, P.: Improved alternating moduli PRFs and post-quantum signatures (full version). Cryptology ePrint Archive, Paper 2024\/582 (2024). https:\/\/eprint.iacr.org\/2024\/582"},{"key":"9_CR6","unstructured":"Albrecht, M.R., Davidson, A., Deo, A., Gardham, D.: Crypto dark matter on the torus: oblivious PRFs from shallow PRFs and FHE. Cryptology ePrint Archive, Report 2023\/232 (2023). https:\/\/eprint.iacr.org\/2023\/232"},{"key":"9_CR7","doi-asserted-by":"publisher","unstructured":"Albrecht, M.R., Davidson, A., Deo, A., Smart, N.P.: Round-optimal verifiable oblivious pseudorandom functions from ideal lattices, pp. 261\u2013289 (2021). https:\/\/doi.org\/10.1007\/978-3-030-75248-4_10","DOI":"10.1007\/978-3-030-75248-4_10"},{"key":"9_CR8","doi-asserted-by":"publisher","unstructured":"Albrecht, M.R., et al.: Feistel structures for MPC, and more, pp. 151\u2013171 (2019). https:\/\/doi.org\/10.1007\/978-3-030-29962-0_8","DOI":"10.1007\/978-3-030-29962-0_8"},{"key":"9_CR9","doi-asserted-by":"publisher","unstructured":"Albrecht, M.R., Rechberger, C., Schneider, T., Tiessen, T., Zohner, M.: Ciphers for MPC and FHE, pp. 430\u2013454 (2015). https:\/\/doi.org\/10.1007\/978-3-662-46800-5_17","DOI":"10.1007\/978-3-662-46800-5_17"},{"key":"9_CR10","doi-asserted-by":"publisher","unstructured":"Araki, T., Furukawa, J., Lindell, Y., Nof, A., Ohara, K.: High-throughput semi-honest secure three-party computation with an honest majority, pp. 805\u2013817 (2016). https:\/\/doi.org\/10.1145\/2976749.2978331","DOI":"10.1145\/2976749.2978331"},{"key":"9_CR11","doi-asserted-by":"publisher","unstructured":"Badrinarayanan, S., Das, S., Garimella, G., Raghuraman, S., Rindal, P.: Secret-shared joins with multiplicity from aggregation trees, pp. 209\u2013222 (2022). https:\/\/doi.org\/10.1145\/3548606.3560670","DOI":"10.1145\/3548606.3560670"},{"key":"9_CR12","doi-asserted-by":"publisher","unstructured":"Banerjee, A., Peikert, C., Rosen, A.: Pseudorandom functions and lattices. In: Pointcheval, D., Johansson, T. (eds.) Advances in Cryptology - EUROCRYPT 2012 - 31st Annual International Conference on the Theory and Applications of Cryptographic Techniques, Cambridge, UK, April 15-19, 2012. Proceedings. Lecture Notes in Computer Science, vol.\u00a07237, pp. 719\u2013737. Springer (2012). https:\/\/doi.org\/10.1007\/978-3-642-29011-4_42","DOI":"10.1007\/978-3-642-29011-4_42"},{"key":"9_CR13","unstructured":"Basso, A.: A post-quantum round-optimal oblivious PRF from isogenies. Cryptology ePrint Archive, Report 2023\/225 (2023). https:\/\/eprint.iacr.org\/2023\/225"},{"key":"9_CR14","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1007\/978-3-031-38554-4_19","volume-title":"Advances in Cryptology \u2013 CRYPTO 2023: 43rd Annual International Cryptology Conference, CRYPTO 2023, Santa Barbara, CA, USA, August 20\u201324, 2023, Proceedings, Part V","author":"C Baum","year":"2023","unstructured":"Baum, C., et al.: Publicly verifiable zero-knowledge and\u00a0post-quantum signatures from\u00a0VOLE-in-the-head. In: Handschuh, H., Lysyanskaya, A. (eds.) Advances in Cryptology \u2013 CRYPTO 2023: 43rd Annual International Cryptology Conference, CRYPTO 2023, Santa Barbara, CA, USA, August 20\u201324, 2023, Proceedings, Part V, pp. 581\u2013615. Springer Nature Switzerland, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38554-4_19"},{"key":"9_CR15","doi-asserted-by":"publisher","unstructured":"Becker, A., Coron, J.S., Joux, A.: Improved generic algorithms for hard knapsacks, pp. 364\u2013385 (2011). https:\/\/doi.org\/10.1007\/978-3-642-20465-4_21","DOI":"10.1007\/978-3-642-20465-4_21"},{"key":"9_CR16","doi-asserted-by":"publisher","unstructured":"Biham, E., Shamir, A.: Differential cryptanalysis of DES-like cryptosystems 4(1), 3\u201372 (1991). https:\/\/doi.org\/10.1007\/BF00630563","DOI":"10.1007\/BF00630563"},{"key":"9_CR17","doi-asserted-by":"publisher","unstructured":"Blum, M., Micali, S.: How to generate cryptographically strong sequences of pseudo random bits, pp. 112\u2013117 (1982). https:\/\/doi.org\/10.1109\/SFCS.1982.72","DOI":"10.1109\/SFCS.1982.72"},{"key":"9_CR18","doi-asserted-by":"publisher","unstructured":"Boneh, D., Ishai, Y., Passel\u00e8gue, A., Sahai, A., Wu, D.J.: Exploring crypto dark matter: new simple PRF candidates and their applications, pp. 699\u2013729 (2018). https:\/\/doi.org\/10.1007\/978-3-030-03810-6_25","DOI":"10.1007\/978-3-030-03810-6_25"},{"key":"9_CR19","doi-asserted-by":"publisher","unstructured":"Boneh, D., Kogan, D., Woo, K.: Oblivious pseudorandom functions from isogenies, pp. 520\u2013550 (2020). https:\/\/doi.org\/10.1007\/978-3-030-64834-3_18","DOI":"10.1007\/978-3-030-64834-3_18"},{"key":"9_CR20","doi-asserted-by":"publisher","unstructured":"Bonnetain, X., Bricout, R., Schrottenloher, A., Shen, Y.: Improved classical and quantum algorithms for subset-sum, pp. 633\u2013666 (2020). https:\/\/doi.org\/10.1007\/978-3-030-64834-3_22","DOI":"10.1007\/978-3-030-64834-3_22"},{"key":"9_CR21","doi-asserted-by":"publisher","unstructured":"Boyle, E., Couteau, G., Gilboa, N., Ishai, Y., Kohl, L., Rindal, P., Scholl, P.: Efficient two-round OT extension and silent non-interactive secure computation, pp. 291\u2013308 (2019). https:\/\/doi.org\/10.1145\/3319535.3354255","DOI":"10.1145\/3319535.3354255"},{"key":"9_CR22","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, pp. 489\u2013518 (2019). https:\/\/doi.org\/10.1007\/978-3-030-26954-8_16","DOI":"10.1007\/978-3-030-26954-8_16"},{"key":"9_CR23","doi-asserted-by":"publisher","unstructured":"Carozza, E., Couteau, G., Joux, A.: Short signatures from regular syndrome decoding in the head, pp. 532\u2013563 (2023). https:\/\/doi.org\/10.1007\/978-3-031-30589-4_19","DOI":"10.1007\/978-3-031-30589-4_19"},{"key":"9_CR24","doi-asserted-by":"publisher","unstructured":"Chase, M., et al.: Post-quantum zero-knowledge and signatures from symmetric-key primitives, pp. 1825\u20131842 (2017). https:\/\/doi.org\/10.1145\/3133956.3133997","DOI":"10.1145\/3133956.3133997"},{"key":"9_CR25","doi-asserted-by":"crossref","unstructured":"Chaum, D.: Blind signatures for untraceable payments, pp. 199\u2013203 (1982)","DOI":"10.1007\/978-1-4757-0602-4_18"},{"key":"9_CR26","doi-asserted-by":"publisher","unstructured":"Cheon, J.H., Cho, W., Kim, J.H., Kim, J.: Adventures in crypto dark matter: attacks and fixes for weak pseudorandom functions, pp. 739\u2013760 (2021). https:\/\/doi.org\/10.1007\/978-3-030-75248-4_26","DOI":"10.1007\/978-3-030-75248-4_26"},{"key":"9_CR27","doi-asserted-by":"publisher","unstructured":"Dinur, I., Goldfeder, S., Halevi, T., Ishai, Y., Kelkar, M., Sharma, V., Zaverucha, G.: MPC-friendly symmetric cryptography from alternating moduli: candidates, protocols, and applications, pp. 517\u2013547 (2021). https:\/\/doi.org\/10.1007\/978-3-030-84259-8_18","DOI":"10.1007\/978-3-030-84259-8_18"},{"key":"9_CR28","doi-asserted-by":"publisher","unstructured":"Dobraunig, C., et al.: Rasta: a cipher with low ANDdepth and few ANDs per bit, pp. 662\u2013692 (2018). https:\/\/doi.org\/10.1007\/978-3-319-96884-1_22","DOI":"10.1007\/978-3-319-96884-1_22"},{"key":"9_CR29","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-030-77886-6_1","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2021: 40th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Zagreb, Croatia, October 17\u201321, 2021, Proceedings, Part II","author":"C Dobraunig","year":"2021","unstructured":"Dobraunig, C., Grassi, L., Guinet, A., Kuijsters, D.: Ciminion: symmetric encryption based on Toffoli-gates over large finite fields. In: Canteaut, A., Standaert, F.-X. (eds.) Advances in Cryptology \u2013 EUROCRYPT 2021: 40th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Zagreb, Croatia, October 17\u201321, 2021, Proceedings, Part II, pp. 3\u201334. Springer International Publishing, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77886-6_1"},{"key":"9_CR30","doi-asserted-by":"publisher","unstructured":"Dobraunig, C., Kales, D., Rechberger, C., Schofnegger, M., Zaverucha, G.: Shorter signatures based on tailor-made minimalist symmetric-key crypto. In: Yin, H., Stavrou, A., Cremers, C., Shi, E. (eds.) Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, CCS 2022, Los Angeles, CA, USA, November 7-11, 2022, pp. 843\u2013857. ACM (2022). https:\/\/doi.org\/10.1145\/3548606.3559353","DOI":"10.1145\/3548606.3559353"},{"key":"9_CR31","doi-asserted-by":"publisher","unstructured":"Esgin, M.F., Steinfeld, R., Zhao, R.K.: $$\\text{ MatRiCT}^+$$: more efficient post-quantum private blockchain payments, pp. 1281\u20131298 (2022). https:\/\/doi.org\/10.1109\/SP46214.2022.9833655","DOI":"10.1109\/SP46214.2022.9833655"},{"key":"9_CR32","doi-asserted-by":"publisher","unstructured":"Feneuil, T., Joux, A., Rivain, M.: Syndrome decoding in the head: shorter signatures from zero-knowledge proofs, pp. 541\u2013572 (2022). https:\/\/doi.org\/10.1007\/978-3-031-15979-4_19","DOI":"10.1007\/978-3-031-15979-4_19"},{"key":"9_CR33","doi-asserted-by":"publisher","unstructured":"Freedman, M.J., Ishai, Y., Pinkas, B., Reingold, O.: Keyword search and oblivious pseudorandom functions, pp. 303\u2013324 (2005). https:\/\/doi.org\/10.1007\/978-3-540-30576-7_17","DOI":"10.1007\/978-3-540-30576-7_17"},{"key":"9_CR34","doi-asserted-by":"publisher","unstructured":"Goel, A., Green, M., Hall-Andersen, M., Kaptchuk, G.: Efficient set membership proofs using MPC-in-the-head. 2022(2), 304\u2013324 (2022). https:\/\/doi.org\/10.2478\/popets-2022-0047","DOI":"10.2478\/popets-2022-0047"},{"key":"9_CR35","doi-asserted-by":"publisher","unstructured":"Goldreich, O., Goldwasser, S., Micali, S.: How to construct random functions (extended abstract), pp. 464\u2013479 (1984). https:\/\/doi.org\/10.1109\/SFCS.1984.715949","DOI":"10.1109\/SFCS.1984.715949"},{"key":"9_CR36","doi-asserted-by":"publisher","unstructured":"Grassi, L., \u00d8ygarden, M., Schofnegger, M., Walch, R.: From farfalle to MEGAFONO via Ciminion: the PRF hydra for MPC applications. In: Hazay, C., Stam, M. (eds.) Advances in Cryptology - EUROCRYPT 2023 - 42nd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Lyon, France, April 23-27, 2023, Proceedings, Part IV. Lecture Notes in Computer Science, vol. 14007, pp. 255\u2013286. Springer (2023). https:\/\/doi.org\/10.1007\/978-3-031-30634-1_9","DOI":"10.1007\/978-3-031-30634-1_9"},{"key":"9_CR37","doi-asserted-by":"publisher","unstructured":"Grassi, L., Rechberger, C., Rotaru, D., Scholl, P., Smart, N.P.: MPC-friendly symmetric key primitives, pp. 430\u2013443 (2016). https:\/\/doi.org\/10.1145\/2976749.2978332","DOI":"10.1145\/2976749.2978332"},{"key":"9_CR38","unstructured":"Guruswami, V., Rudra, A., Sudan, M.: Essential coding theory. http:\/\/www.cse.buffalo.edu\/atri\/courses\/coding-theory\/book2(1) (2012)"},{"issue":"4","key":"9_CR39","doi-asserted-by":"publisher","first-page":"1364","DOI":"10.1137\/S0097539793244708","volume":"28","author":"J H\u00e5stad","year":"1999","unstructured":"H\u00e5stad, J., Impagliazzo, R., Levin, L.A., Luby, M.: A pseudorandom generator from any one-way function. SIAM J. Comput. 28(4), 1364\u20131396 (1999)","journal-title":"SIAM J. Comput."},{"key":"9_CR40","doi-asserted-by":"crossref","unstructured":"Heimberger, L., Hennerbichler, T., Meisingseth, F., Ramacher, S., Rechberger, C.: OPRFs from isogenies: designs and analysis. Cryptology ePrint Archive, Paper 2023\/639 (2023). https:\/\/eprint.iacr.org\/2023\/639","DOI":"10.1145\/3634737.3645010"},{"key":"9_CR41","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/BFb0054868","volume-title":"Algorithmic Number Theory","author":"J Hoffstein","year":"1998","unstructured":"Hoffstein, J., Pipher, J., Silverman, J.H.: NTRU: a ring-based public key cryptosystem. In: Buhler, J.P. (ed.) Algorithmic Number Theory, pp. 267\u2013288. Springer, Berlin, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0054868"},{"key":"9_CR42","doi-asserted-by":"publisher","unstructured":"Howgrave-Graham, N., Joux, A.: New generic algorithms for hard knapsacks, pp. 235\u2013256 (2010). https:\/\/doi.org\/10.1007\/978-3-642-13190-5_12","DOI":"10.1007\/978-3-642-13190-5_12"},{"key":"9_CR43","unstructured":"Hulsing, A., et al.: SPHINCS+. Tech. rep., National Institute of Standards and Technology (2022). https:\/\/csrc.nist.gov\/Projects\/post-quantum-cryptography\/selected-algorithms-2022"},{"key":"9_CR44","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/978-3-031-38557-5_17","volume-title":"Advances in Cryptology - CRYPTO 2023","author":"Y Ishai","year":"2023","unstructured":"Ishai, Y., Kelkar, M., Narayanan, V., Zafar, L.: One-message secure reductions: On the cost of converting correlations. In: Handschuh, H., Lysyanskaya, A. (eds.) Advances in Cryptology - CRYPTO 2023, pp. 515\u2013547. Springer Nature Switzerland, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38557-5_17"},{"key":"9_CR45","doi-asserted-by":"publisher","unstructured":"Ishai, Y., Kilian, J., Nissim, K., Petrank, E.: Extending oblivious transfers efficiently, pp. 145\u2013161 (2003). https:\/\/doi.org\/10.1007\/978-3-540-45146-4_9","DOI":"10.1007\/978-3-540-45146-4_9"},{"key":"9_CR46","doi-asserted-by":"publisher","unstructured":"Ishai, Y., Kushilevitz, E., Ostrovsky, R., Sahai, A.: Zero-knowledge from secure multiparty computation, pp. 21\u201330 (2007). https:\/\/doi.org\/10.1145\/1250790.1250794","DOI":"10.1145\/1250790.1250794"},{"key":"9_CR47","doi-asserted-by":"publisher","unstructured":"Kales, D., Zaverucha, G.: An attack on some signature schemes constructed from five-pass identification schemes, pp. 3\u201322 (2020). https:\/\/doi.org\/10.1007\/978-3-030-65411-5_1","DOI":"10.1007\/978-3-030-65411-5_1"},{"key":"9_CR48","unstructured":"Kales, D., Zaverucha, G.: Efficient lifting for shorter zero-knowledge proofs and post-quantum signatures. Cryptology ePrint Archive, Report 2022\/588 (2022). https:\/\/eprint.iacr.org\/2022\/588"},{"key":"9_CR49","doi-asserted-by":"publisher","unstructured":"Katz, J., Kolesnikov, V., Wang, X.: Improved non-interactive zero knowledge with applications to post-quantum signatures, pp. 525\u2013537 (2018). https:\/\/doi.org\/10.1145\/3243734.3243805","DOI":"10.1145\/3243734.3243805"},{"key":"9_CR50","doi-asserted-by":"crossref","unstructured":"Kim, S., et\u00a0al.: Aim: symmetric primitive for shorter signatures with stronger security. In: Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security, pp. 401\u2013415 (2023)","DOI":"10.1145\/3576915.3616579"},{"key":"9_CR51","doi-asserted-by":"publisher","unstructured":"Levin, L.A.: One-way functions and pseudorandom generators, pp. 363\u2013365 (1985). https:\/\/doi.org\/10.1145\/22145.22185","DOI":"10.1145\/22145.22185"},{"key":"9_CR52","doi-asserted-by":"publisher","unstructured":"Lyubashevsky, V., Nguyen, N.K., Seiler, G.: SMILE: set membership from ideal lattices with applications to ring signatures and confidential transactions, pp. 611\u2013640 (2021). https:\/\/doi.org\/10.1007\/978-3-030-84245-1_21","DOI":"10.1007\/978-3-030-84245-1_21"},{"key":"9_CR53","doi-asserted-by":"crossref","unstructured":"Meadows, C.A.: A more efficient cryptographic matchmaking protocol for use in the absence of a continuously available third party. In: IEEE Symposium on Security and Privacy, pp. 134\u2013137. IEEE Computer Society (1986)","DOI":"10.1109\/SP.1986.10022"},{"key":"9_CR54","doi-asserted-by":"publisher","unstructured":"Micali, S., Rabin, M.O., Vadhan, S.P.: Verifiable random functions, pp. 120\u2013130 (1999). https:\/\/doi.org\/10.1109\/SFFCS.1999.814584","DOI":"10.1109\/SFFCS.1999.814584"},{"key":"9_CR55","doi-asserted-by":"publisher","unstructured":"Micciancio, D., Mol, P.: Pseudorandom knapsacks and the sample complexity of LWE search-to-decision reductions, pp. 465\u2013484 (2011). https:\/\/doi.org\/10.1007\/978-3-642-22792-9_26","DOI":"10.1007\/978-3-642-22792-9_26"},{"key":"9_CR56","doi-asserted-by":"publisher","unstructured":"Mohassel, P., Rindal, P., Rosulek, M.: Fast database joins and PSI for secret shared data, pp. 1271\u20131287 (2020). https:\/\/doi.org\/10.1145\/3372297.3423358","DOI":"10.1145\/3372297.3423358"},{"key":"9_CR57","doi-asserted-by":"publisher","unstructured":"Naor, M., Reingold, O.: Number-theoretic constructions of efficient pseudo-random functions, pp. 458\u2013467 (1997). https:\/\/doi.org\/10.1109\/SFCS.1997.646134","DOI":"10.1109\/SFCS.1997.646134"},{"key":"9_CR58","unstructured":"Peter\u00a0Rindal, L.R.: osu-crypto\/libOTe: an efficient, portable, and easy to use Oblivious Transfer Library. https:\/\/github.com\/osu-crypto\/libOTe"},{"key":"9_CR59","doi-asserted-by":"publisher","first-page":"602","DOI":"10.1007\/978-3-031-38551-3_19","volume-title":"Advances in Cryptology - CRYPTO 2023","author":"S Raghuraman","year":"2023","unstructured":"Raghuraman, S., Rindal, P., Tanguy, T.: Expand-convolute codes for pseudorandom correlation generators from LPN. In: Handschuh, H., Lysyanskaya, A. (eds.) Advances in Cryptology - CRYPTO 2023, pp. 602\u2013632. Springer Nature Switzerland, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38551-3_19"},{"issue":"4","key":"9_CR60","first-page":"333","volume":"41","author":"AA Razborov","year":"1987","unstructured":"Razborov, A.A.: Lower bounds on the size of bounded depth circuits over a complete basis with logical addition. Math. Notes Acad. Sci. USSR 41(4), 333\u2013338 (1987)","journal-title":"Math. Notes Acad. Sci. USSR"},{"key":"9_CR61","doi-asserted-by":"publisher","unstructured":"Rivest, R.L., Shamir, A., Tauman, Y.: How to leak a secret, pp. 552\u2013565 (2001). https:\/\/doi.org\/10.1007\/3-540-45682-1_32","DOI":"10.1007\/3-540-45682-1_32"},{"key":"9_CR62","doi-asserted-by":"publisher","unstructured":"Roy, L.: SoftSpokenOT: quieter OT extension from small-field silent VOLE in the minicrypt model, pp. 657\u2013687 (2022). https:\/\/doi.org\/10.1007\/978-3-031-15802-5_23","DOI":"10.1007\/978-3-031-15802-5_23"},{"key":"9_CR63","unstructured":"Seres, I.A., Horv\u00e1th, M., Burcsi, P.: The legendre pseudorandom function as a multivariate quadratic cryptosystem: security and applications. Cryptology ePrint Archive, Report 2021\/182 (2021). https:\/\/eprint.iacr.org\/2021\/182"},{"key":"9_CR64","doi-asserted-by":"crossref","unstructured":"Smolensky, R.: Algebraic methods in the theory of lower bounds for Boolean circuit complexity. In: Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing, pp. 77\u201382 (1987)","DOI":"10.1145\/28395.28404"},{"key":"9_CR65","doi-asserted-by":"publisher","unstructured":"Yao, A.C.C.: Theory and applications of trapdoor functions (extended abstract), pp. 80\u201391 (1982). https:\/\/doi.org\/10.1109\/SFCS.1982.45","DOI":"10.1109\/SFCS.1982.45"}],"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-68397-8_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,15]],"date-time":"2024-08-15T22:02:50Z","timestamp":1723759370000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-68397-8_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031683961","9783031683978"],"references-count":65,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-68397-8_9","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":"Case studies, comparisons, statistics, research and recommendations are provided \u201cAS IS\u201d and intended for informational purposes only and should not be relied upon for operational, marketing, legal, technical, tax, financial or other advice. Visa Inc. neither makes any warranty or representation as to the completeness or accuracy of the information within this document, nor assumes any liability or responsibility that may result from reliance on such information. The Information contained herein is not intended as investment or legal advice, and readers are encouraged to seek the advice of a competent professional where such advice is required.These materials and best practice recommendations are provided for informational purposes only and should not be relied upon for marketing, legal, regulatory or other advice. Recommended marketing materials should be independently evaluated in light of your specific business needs and any applicable laws and regulations. Visa is not responsible for your use of the marketing materials, best practice recommendations, or other information, including errors of any kind, contained in this document.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclaimer"}},{"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"}}]}}