{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T20:41:44Z","timestamp":1757450504391,"version":"3.40.3"},"publisher-location":"Cham","reference-count":80,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031683961"},{"type":"electronic","value":"9783031683978"}],"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_11","type":"book-chapter","created":{"date-parts":[[2024,8,15]],"date-time":"2024-08-15T22:01:41Z","timestamp":1723759301000},"page":"346-383","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Compressing Unit-Vector Correlations via\u00a0Sparse Pseudorandom Generators"],"prefix":"10.1007","author":[{"given":"Amit","family":"Agarwal","sequence":"first","affiliation":[]},{"given":"Elette","family":"Boyle","sequence":"additional","affiliation":[]},{"given":"Niv","family":"Gilboa","sequence":"additional","affiliation":[]},{"given":"Yuval","family":"Ishai","sequence":"additional","affiliation":[]},{"given":"Mahimna","family":"Kelkar","sequence":"additional","affiliation":[]},{"given":"Yiping","family":"Ma","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,8,16]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Abram, D., Scholl, P.: Low-communication multiparty triple generation for SPDZ from ring-LPN. In: The International Conference on Practice and Theory in Public Key Cryptography (PKC) (2022)","key":"11_CR1","DOI":"10.1007\/978-3-030-97121-2_9"},{"key":"11_CR2","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"516","DOI":"10.1007\/978-3-031-14791-3_23","volume-title":"SCN 2022","author":"S Addanki","year":"2022","unstructured":"Addanki, S., Garbe, K., Jaffe, E., Ostrovsky, R., Polychroniadou, A.: Prio+: privacy preserving aggregate statistics via boolean shares. In: Galdi, C., Jarecki, S. (eds.) SCN 2022. LNCS, vol. 13409, pp. 516\u2013539. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-14791-3_23"},{"key":"11_CR3","doi-asserted-by":"publisher","first-page":"667","DOI":"10.1007\/s00037-015-0121-8","volume":"25","author":"B Applebaum","year":"2016","unstructured":"Applebaum, B.: Cryptographic hardness of random local functions - survey. Comput. Complex. 25, 667\u2013722 (2016)","journal-title":"Comput. Complex."},{"doi-asserted-by":"publisher","unstructured":"Applebaum, B., Ishai, Y., Kushilevitz, E.: On pseudorandom generators with linear stretch in $${\\rm nc}^{0}$$. Comput. Complex. 17(1), 38\u201369 (2008). https:\/\/doi.org\/10.1007\/S00037-007-0237-6","key":"11_CR4","DOI":"10.1007\/S00037-007-0237-6"},{"doi-asserted-by":"crossref","unstructured":"Applebaum, B., Lovett, S.: Algebraic attacks against random local functions and their countermeasures. In: Proceedings of the ACM Symposium on Theory of Computing (STOC) (2016)","key":"11_CR5","DOI":"10.1145\/2897518.2897554"},{"key":"11_CR6","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"719","DOI":"10.1007\/978-3-642-29011-4_42","volume-title":"EUROCRYPT 2012","author":"A Banerjee","year":"2012","unstructured":"Banerjee, A., Peikert, C., Rosen, A.: Pseudorandom functions and lattices. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 719\u2013737. Springer, Cham (2012). https:\/\/doi.org\/10.1007\/978-3-642-29011-4_42"},{"doi-asserted-by":"crossref","unstructured":"Barak, B., Brakerski, Z., Komargodski, I., Kothari, P.K.: Limits on low-degree pseudorandom generators (or: Sum-of-squares meets program obfuscation). In: Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT) (2017)","key":"11_CR7","DOI":"10.1007\/978-3-319-78375-8_21"},{"unstructured":"Beaver, D., Feigenbaum, J., Kilian, J., Rogaway, P.: Security with low communication overhead. In: Proceedings of the International Cryptology Conference (CRYPTO) (1991)","key":"11_CR8"},{"doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation (extended abstract). In: Proceedings of the ACM Symposium on Theory of Computing (STOC) (1988)","key":"11_CR9","DOI":"10.1145\/62212.62213"},{"doi-asserted-by":"crossref","unstructured":"Bendlin, R., Damg\u00e5rd, I., Orlandi, C., Zakarias, S.: Semi-homomorphic encryption and multiparty computation. In: Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT) (2011)","key":"11_CR10","DOI":"10.1007\/978-3-642-20465-4_11"},{"doi-asserted-by":"crossref","unstructured":"Benhamouda, F., Boyle, E., Gilboa, N., Halevi, S., Ishai, Y., Nof, A.: Generalized pseudorandom secret sharing and efficient straggler-resilient secure computation. In: Proceedings of the Theory of Cryptography Conference (TCC) (2021)","key":"11_CR11","DOI":"10.1007\/978-3-030-90453-1_5"},{"unstructured":"Bombar, M., Bui, D., Couteau, G., Couvreur, A., Ducros, C., Servan-Schreiber, S.: FOLEAGE: OLE-based multi-party computation for boolean circuits. IACR Cryptol. ePrint Arch. 429 (2024). https:\/\/eprint.iacr.org\/2024\/429","key":"11_CR12"},{"doi-asserted-by":"crossref","unstructured":"Bombar, M., Couteau, G., Couvreur, A., Ducros, C.: Correlated pseudorandomness from the hardness of quasi-abelian decoding. In: Proceedings of the International Cryptology Conference (CRYPTO) (2023)","key":"11_CR13","DOI":"10.1007\/978-3-031-38551-3_18"},{"key":"11_CR14","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1007\/978-3-642-38980-1_7","volume-title":"ACNS 2013","author":"D Boneh","year":"2013","unstructured":"Boneh, D., Gentry, C., Halevi, S., Wang, F., Wu, D.J.: Private database queries using somewhat homomorphic encryption. In: Jacobson, M., Locasto, M., Mohassel, P., Safavi-Naini, R. (eds.) ACNS 2013. LNCS, vol. 7954, pp. 102\u2013118. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38980-1_7"},{"doi-asserted-by":"crossref","unstructured":"Boyle, E., Couteau, G., Gilboa, N., Ishai, Y.: Compressing vector OLE. In: Proceedings of the ACM Conference on Computer and Communications Security (CCS) (2018)","key":"11_CR15","DOI":"10.1145\/3243734.3243868"},{"doi-asserted-by":"crossref","unstructured":"Boyle, E., et al.: Correlated pseudorandomness from expand-accumulate codes. In: Proceedings of the International Cryptology Conference (CRYPTO) (2022)","key":"11_CR16","DOI":"10.1007\/978-3-031-15979-4_21"},{"doi-asserted-by":"crossref","unstructured":"Boyle, E., et al.: Oblivious transfer with constant computational overhead. In: Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT) (2023)","key":"11_CR17","DOI":"10.1007\/978-3-031-30545-0_10"},{"doi-asserted-by":"crossref","unstructured":"Boyle, E., et al.: Efficient two-round OT extension and silent non-interactive secure computation. In: Proceedings of the ACM Conference on Computer and Communications Security (CCS) (2019)","key":"11_CR18","DOI":"10.1145\/3319535.3354255"},{"doi-asserted-by":"crossref","unstructured":"Boyle, E., Couteau, G., Gilboa, N., Ishai, Y., Kohl, L., Scholl, P.: Efficient pseudorandom correlation generators: silent OT extension and more. In: Proceedings of the International Cryptology Conference (CRYPTO) (2019)","key":"11_CR19","DOI":"10.1007\/978-3-030-26954-8_16"},{"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: Proceedings of the IEEE Symposium on Foundations of Computer Science (FOCS) (2020)","key":"11_CR20","DOI":"10.1109\/FOCS46700.2020.00103"},{"doi-asserted-by":"crossref","unstructured":"Boyle, E., Couteau, G., Gilboa, N., Ishai, Y., Orr\u00f9, M.: Homomorphic secret sharing: optimizations and applications. In: Proceedings of the ACM Conference on Computer and Communications Security (CCS) (2017)","key":"11_CR21","DOI":"10.1145\/3133956.3134107"},{"doi-asserted-by":"crossref","unstructured":"Boyle, E., Couteau, G., Meyer, P.: Sublinear secure computation from new assumptions. In: Proceedings of the Theory of Cryptography Conference (TCC) (2022)","key":"11_CR22","DOI":"10.1007\/978-3-031-22365-5_5"},{"doi-asserted-by":"crossref","unstructured":"Boyle, E., Couteau, G., Meyer, P.: Sublinear-communication secure multiparty computation does not require FHE. In: Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT) (2023)","key":"11_CR23","DOI":"10.1007\/978-3-031-30617-4_6"},{"key":"11_CR24","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/978-3-662-46803-6_12","volume-title":"EUROCRYPT 2015","author":"E Boyle","year":"2015","unstructured":"Boyle, E., Gilboa, N., Ishai, Y.: Function secret sharing. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015. LNCS, vol. 9057, pp. 337\u2013367. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46803-6_12"},{"doi-asserted-by":"crossref","unstructured":"Boyle, E., Gilboa, N., Ishai, Y.: Breaking the circuit size barrier for secure computation under DDH. In: Proceedings of the International Cryptology Conference (CRYPTO) (2016)","key":"11_CR25","DOI":"10.1007\/978-3-662-53018-4_19"},{"doi-asserted-by":"crossref","unstructured":"Boyle, E., Gilboa, N., Ishai, Y.: Function secret sharing: improvements and extensions. In: Proceedings of the ACM Conference on Computer and Communications Security (CCS) (2016)","key":"11_CR26","DOI":"10.1145\/2976749.2978429"},{"doi-asserted-by":"crossref","unstructured":"Boyle, E., Gilboa, N., Ishai, Y.: Secure computation with preprocessing via function secret sharing. In: Proceedings of the Theory of Cryptography Conference (TCC) (2019)","key":"11_CR27","DOI":"10.1007\/978-3-030-36030-6_14"},{"key":"11_CR28","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-030-17656-3_1","volume-title":"EUROCRYPT 2019","author":"E Boyle","year":"2019","unstructured":"Boyle, E., Kohl, L., Scholl, P.: Homomorphic secret sharing from lattices without FHE. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019. LNCS, vol. 11477, pp. 3\u201333. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17656-3_1"},{"unstructured":"Boyle, E., LaVigne, R.: Personal communication (2023)","key":"11_CR29"},{"doi-asserted-by":"crossref","unstructured":"Br\u00fcggemann, A., Hundt, R., Schneider, T., Suresh, A., Yalame, H.: FLUTE: fast and secure lookup table evaluations. In: In Proceedings of the IEEE Symposium on Security and Privacy (S &P) (2023)","key":"11_CR30","DOI":"10.1109\/SP46215.2023.10179345"},{"key":"11_CR31","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/978-3-031-58751-1_4","volume-title":"EUROCRYPT 2024, Part VI","author":"D Bui","year":"2024","unstructured":"Bui, D., Couteau, G., Meyer, P., Passel\u00e8gue, A., Riahinia, M.: Fast public-key silent OT and more from constrained naor-reingold. In: Joye, M., Leander, G. (eds.) EUROCRYPT 2024, Part VI. LNCS, vol. 14656, pp. 88\u2013118. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-58751-1_4"},{"doi-asserted-by":"crossref","unstructured":"Bunn, P., Kushilevitz, E., Ostrovsky, R.: CNF-FSS and its applications. In: IACR International Conference on Public-Key Cryptography, pp. 283\u2013314 (2022)","key":"11_CR32","DOI":"10.1007\/978-3-030-97121-2_11"},{"doi-asserted-by":"crossref","unstructured":"Chaum, D., Cr\u00e9peau, C., Damg\u00e5rd, I.: Multiparty unconditionally secure protocols (extended abstract). In: Proceedings of the ACM Symposium on Theory of Computing (STOC) (1988)","key":"11_CR33","DOI":"10.1007\/3-540-48184-2_43"},{"unstructured":"Chor, B., Goldreich, O., Kushilevitz, E., Sudan, M.: Private information retrieval. In: Proceedings of the IEEE Symposium on Foundations of Computer Science (FOCS) (1995)","key":"11_CR34"},{"unstructured":"Corrigan-Gibbs, H., Boneh, D.: Prio: private, robust, and scalable computation of aggregate statistics. In: 14th USENIX symposium on networked systems design and implementation (NSDI 2017), pp. 259\u2013282 (2017)","key":"11_CR35"},{"doi-asserted-by":"crossref","unstructured":"Couteau, G.: A note on the communication complexity of multiparty computation in the correlated randomness model. In: Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT) (2019)","key":"11_CR36","DOI":"10.1007\/978-3-030-17656-3_17"},{"key":"11_CR37","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/978-3-031-31371-4_8","volume-title":"PKC 2023, Part II","author":"G Couteau","year":"2023","unstructured":"Couteau, G., Ducros, C.: Pseudorandom correlation functions from variable-density LPN, revisited. In: Boldyreva, A., Kolesnikov, V. (eds.) PKC 2023, Part II. LNCS, vol. 13941, pp. 221\u2013250. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-31371-4_8"},{"doi-asserted-by":"crossref","unstructured":"Couteau, G., Dupin, A., M\u00e9aux, P., Rossi, M., Rotella, Y.: On the concrete security of Goldreich\u2019s pseudorandom generator. In: International Conference on the Theory and Application of Cryptology and Information Security (ASIACRYPT) (2018)","key":"11_CR38","DOI":"10.1007\/978-3-030-03329-3_4"},{"doi-asserted-by":"crossref","unstructured":"Couteau, G., Meyer, P.: Breaking the circuit size barrier for secure computation under quasi-polynomial LPN. In: Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT) (2021)","key":"11_CR39","DOI":"10.1007\/978-3-030-77886-6_29"},{"doi-asserted-by":"crossref","unstructured":"Cramer, R., Damg\u00e5rd, I., Ishai, Y.: Share conversion, pseudorandom secret-sharing and applications to secure computation. In: Proceedings of the Theory of Cryptography Conference (TCC) (2005)","key":"11_CR40","DOI":"10.1007\/978-3-540-30576-7_19"},{"doi-asserted-by":"crossref","unstructured":"Cramer, R., Fehr, S., Ishai, Y., Kushilevitz, E.: Efficient multi-party computation over rings. In: Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT) (2003)","key":"11_CR41","DOI":"10.1007\/3-540-39200-9_37"},{"doi-asserted-by":"crossref","unstructured":"Damg\u00e5rd, I., Nielsen, J.B., Nielsen, M., Ranellucci, S.: The tinytable protocol for 2-party secure computation, or: gate-scrambling revisited. In: Proceedings of the International Cryptology Conference (CRYPTO) (2017)","key":"11_CR42","DOI":"10.1007\/978-3-319-63688-7_6"},{"doi-asserted-by":"crossref","unstructured":"Damg\u00e5rd, I., Pastro, V., Smart, N.P., Zakarias, S.: Multiparty computation from somewhat homomorphic encryption. In: Proceedings of the International Cryptology Conference (CRYPTO) (2012)","key":"11_CR43","DOI":"10.1007\/978-3-642-32009-5_38"},{"doi-asserted-by":"crossref","unstructured":"Dao, Q., Ishai, Y., Jain, A., Lin, H.: Multi-party homomorphic secret sharing and sublinear MPC from sparse LPN. In: Proceedings of the International Cryptology Conference (CRYPTO) (2023)","key":"11_CR44","DOI":"10.1007\/978-3-031-38545-2_11"},{"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: Proceedings of the Network and Distributed System Security Symposium (NDSS) (2017)","key":"11_CR45","DOI":"10.14722\/ndss.2017.23097"},{"key":"11_CR46","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1007\/978-3-030-90453-1_9","volume-title":"TCC 2021, Part II","author":"L Devadas","year":"2021","unstructured":"Devadas, L., Quach, W., Vaikuntanathan, V., Wee, H., Wichs, D.: Succinct LWE sampling, random polynomials, and obfuscation. In: Nissim, K., Waters, B. (eds.) TCC 2021, Part II. LNCS, vol. 13043, pp. 256\u2013287. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-90453-1_9"},{"issue":"2","key":"11_CR47","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1090\/S0894-0347-1990-1030655-4","volume":"3","author":"P Diaconis","year":"1990","unstructured":"Diaconis, P., Rockmore, D.: Efficient computation of the fourier transform on finite groups. J. Am. Math. Soc. 3(2), 297\u2013332 (1990)","journal-title":"J. Am. Math. Soc."},{"unstructured":"D\u00f6ttling, N., Garg, S., Malavolta, G.: Personal communication (2023)","key":"11_CR48"},{"key":"11_CR49","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"486","DOI":"10.1007\/11761679_29","volume-title":"EUROCRYPT 2006","author":"C Dwork","year":"2006","unstructured":"Dwork, C., Kenthapadi, K., McSherry, F., Mironov, I., Naor, M.: Our data, ourselves: privacy via distributed noise generation. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol. 4004, pp. 486\u2013503. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11761679_29"},{"key":"11_CR50","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/11681878_14","volume-title":"TCC 2006","author":"C Dwork","year":"2006","unstructured":"Dwork, C., McSherry, F., Nissim, K., Smith, A.: Calibrating noise to sensitivity in private data analysis. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol. 3876, pp. 265\u2013284. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11681878_14"},{"key":"11_CR51","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/978-3-662-64322-8_13","volume-title":"FC 2021","author":"R Eriguchi","year":"2021","unstructured":"Eriguchi, R., Ichikawa, A., Kunihiro, N., Nuida, K.: Efficient noise generation to achieve differential privacy with applications to secure multiparty computation. In: Borisov, N., Diaz, C. (eds.) FC 2021. LNCS, vol. 12674, pp. 271\u2013290. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-662-64322-8_13"},{"key":"11_CR52","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"823","DOI":"10.1007\/978-3-030-56880-1_29","volume-title":"CRYPTO 2020, Part II","author":"D Escudero","year":"2020","unstructured":"Escudero, D., Ghosh, S., Keller, M., Rachuri, R., Scholl, P.: Improved primitives for MPC over mixed arithmetic-binary circuits. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020, Part II. LNCS, vol. 12171, pp. 823\u2013852. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56880-1_29"},{"doi-asserted-by":"crossref","unstructured":"Gentry, C.: Fully homomorphic encryption using ideal lattices. In: Proceedings of the ACM Symposium on Theory of Computing (STOC) (2009)","key":"11_CR53","DOI":"10.1145\/1536414.1536440"},{"unstructured":"Geoffroy, C., Rindal, P., Raghuraman, S.: Silver: silent VOLE and oblivious transfer from hardness of decoding structured LDPC codes. In: Proceedings of the International Cryptology Conference (CRYPTO) (2021)","key":"11_CR54"},{"doi-asserted-by":"crossref","unstructured":"Gilboa, N., Ishai, Y.: Distributed point functions and their applications. In: Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT) (2014)","key":"11_CR55","DOI":"10.1007\/978-3-642-55220-5_35"},{"doi-asserted-by":"crossref","unstructured":"Goldreich, O.: Candidate one-way functions based on expander graphs. In: Studies in Complexity and Cryptography (2011)","key":"11_CR56","DOI":"10.1007\/978-3-642-22670-0_10"},{"unstructured":"Gueron, S., Kounavis, M.E.: Intel carry-less multiplication instruction and its usage for computing the GCM mode. https:\/\/www.intel.com\/content\/dam\/develop\/external\/us\/en\/documents\/clmul-wp-rev-2-02-2014-04-20.pdf","key":"11_CR57"},{"doi-asserted-by":"crossref","unstructured":"Ishai, Y., Kelkar, M., Narayanan, V., Zafar, L.: One-message secure reductions: on the cost of converting correlations. In: Proceedings of the International Cryptology Conference (CRYPTO) (2023)","key":"11_CR58","DOI":"10.1007\/978-3-031-38557-5_17"},{"doi-asserted-by":"crossref","unstructured":"Ishai, Y., Kilian, J., Nissim, K., Petrank, E.: Extending oblivious transfers efficiently. In: Proceedings of the International Cryptology Conference (CRYPTO) (2003)","key":"11_CR59","DOI":"10.1007\/978-3-540-45146-4_9"},{"doi-asserted-by":"crossref","unstructured":"Ishai, Y., Kushilevitz, E., Meldgaard, S., Orlandi, C., Paskin-Cherniavsky, A.: On the power of correlated randomness in secure computation. In: Proceedings of the Theory of Cryptography Conference (TCC) (2013)","key":"11_CR60","DOI":"10.1007\/978-3-642-36594-2_34"},{"doi-asserted-by":"crossref","unstructured":"Ishai, Y., Lai, R.W.F., Malavolta, G.: A geometric approach to homomorphic secret sharing. In: The International Conference on Practice and Theory in Public Key Cryptography (PKC) (2021)","key":"11_CR61","DOI":"10.1007\/978-3-030-75248-4_4"},{"unstructured":"Ito, M., Saito, A., Nishizeki, T.: Secret sharing schemes realizing general access structure. In: IEEE Global Telecommunication Conference (1987)","key":"11_CR62"},{"doi-asserted-by":"crossref","unstructured":"Jain, A., Lin, H., Sahai, A.: Indistinguishability obfuscation from well-founded assumptions. In: Proceedings of the ACM Symposium on Theory of Computing (STOC) (2021)","key":"11_CR63","DOI":"10.1145\/3406325.3451093"},{"doi-asserted-by":"crossref","unstructured":"Keller, M., Orsini, E., Rotaru, D., Scholl, P., Soria-Vazquez, E., Vivek, S.: Faster secure multi-party computation of AES and DES using lookup tables. In: Proceedings of the International Conference on Applied Cryptography and Network Security (ACNS) (2017)","key":"11_CR64","DOI":"10.1007\/978-3-319-61204-1_12"},{"doi-asserted-by":"crossref","unstructured":"Lai, R.W.F., Malavolta, G., Schr\u00f6der, D.: Homomorphic secret sharing for low degree polynomials. In: International Conference on the Theory and Application of Cryptology and Information Security (ASIACRYPT) (2018)","key":"11_CR65","DOI":"10.1007\/978-3-030-03332-3_11"},{"doi-asserted-by":"crossref","unstructured":"Lin, H., Tessaro, S.: Indistinguishability obfuscation from trilinear maps and block-wise local PRGs. In: Proceedings of the International Cryptology Conference (CRYPTO) (2017)","key":"11_CR66","DOI":"10.1007\/978-3-319-63688-7_21"},{"doi-asserted-by":"crossref","unstructured":"Lombardi, A., Vaikuntanathan, V.: Limits on the locality of pseudorandom generators and applications to indistinguishability obfuscation. In: Proceedings of the Theory of Cryptography Conference (TCC) (2017)","key":"11_CR67","DOI":"10.1007\/978-3-319-70500-2_5"},{"unstructured":"Mossel, E., Shpilka, A., Trevisan, L.: On epsilon-biased generators in $${\\rm NC}^{{0}}$$. In: Proceedings of the IEEE Symposium on Foundations of Computer Science (FOCS) (2003)","key":"11_CR68"},{"doi-asserted-by":"crossref","unstructured":"Orlandi, C., Scholl, P., Yakoubov, S.: The rise of paillier: homomorphic secret sharing and public-key silent OT. In: Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT) (2021)","key":"11_CR69","DOI":"10.1007\/978-3-030-77870-5_24"},{"doi-asserted-by":"crossref","unstructured":"Ostrovsky, R., Shoup, V.: Private information storage (extended abstract). In: STOC 1997, pp. 294\u2013303 (1997)","key":"11_CR70","DOI":"10.1145\/258533.258606"},{"unstructured":"Patra, A., Schneider, T., Suresh, A., Yalame, H.: ABY2.0: improved mixed-protocol secure two-party computation. In: Proceedings of the USENIX Security Symposium (2021)","key":"11_CR71"},{"doi-asserted-by":"crossref","unstructured":"Raghuraman, S., Rindal, P., Tanguy, T.: Expand-convolute codes for pseudorandom correlation generators from LPN. In: Proceedings of the International Cryptology Conference (CRYPTO) (2023)","key":"11_CR72","DOI":"10.1007\/978-3-031-38551-3_19"},{"key":"11_CR73","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/978-3-030-35423-7_12","volume-title":"INDOCRYPT 2019","author":"D Rotaru","year":"2019","unstructured":"Rotaru, D., Wood, T.: Marbled circuits: mixing arithmetic and boolean circuits with active security. In: Hao, F., Ruj, S., Sen Gupta, S. (eds.) INDOCRYPT 2019. LNCS, vol. 11898, pp. 227\u2013249. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-35423-7_12"},{"doi-asserted-by":"crossref","unstructured":"Roy, L., Singh, J.: Large message homomorphic secret sharing from DCR and applications. In: Proceedings of the International Cryptology Conference (CRYPTO) (2021)","key":"11_CR74","DOI":"10.1007\/978-3-030-84252-9_23"},{"doi-asserted-by":"crossref","unstructured":"Schoppmann, P., Gasc\u00f3n, A., Reichert, L., Raykova, M.: Distributed vector-ole: improved constructions and implementation. In: Proceedings of the ACM Conference on Computer and Communications Security (CCS) (2019)","key":"11_CR75","DOI":"10.1145\/3319535.3363228"},{"unstructured":"Unal, A.: New baselines for local pseudorandom number generators by field extensions (2023). https:\/\/eprint.iacr.org\/2023\/550","key":"11_CR76"},{"doi-asserted-by":"crossref","unstructured":"\u00dcnal, A.: Worst-case subexponential attacks on PRGs of constant degree or constant locality. In: Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT) (2023)","key":"11_CR77","DOI":"10.1007\/978-3-031-30545-0_2"},{"issue":"2","key":"11_CR78","doi-asserted-by":"publisher","first-page":"1329","DOI":"10.1109\/TIT.2021.3128315","volume":"68","author":"J Yang","year":"2021","unstructured":"Yang, J., Guo, Q., Johansson, T., Lentmaier, M.: Revisiting the concrete security of Goldreich\u2019s pseudorandom generator. IEEE Trans. Inf. Theory 68(2), 1329\u20131354 (2021)","journal-title":"IEEE Trans. Inf. Theory"},{"doi-asserted-by":"crossref","unstructured":"Yang, K., Weng, C., Lan, X., Zhang, J., Wang, X.: Ferret: fast extension for correlated OT with small communication. In: Proceedings of the ACM Conference on Computer and Communications Security (CCS) (2020)","key":"11_CR79","DOI":"10.1145\/3372297.3417276"},{"unstructured":"Zichron, L.: Locally computable arithmetic pseudorandom generators (2017)","key":"11_CR80"}],"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_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,15]],"date-time":"2024-08-15T22:03:27Z","timestamp":1723759407000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-68397-8_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031683961","9783031683978"],"references-count":80,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-68397-8_11","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":"16 August 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CRYPTO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Cryptology Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Santa Barbara, CA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 August 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 August 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"44","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"crypto2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}