{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T01:42:00Z","timestamp":1743126120621,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":47,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819609376"},{"type":"electronic","value":"9789819609383"}],"license":[{"start":{"date-parts":[[2024,12,12]],"date-time":"2024-12-12T00:00:00Z","timestamp":1733961600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,12]],"date-time":"2024-12-12T00:00:00Z","timestamp":1733961600000},"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-0938-3_9","type":"book-chapter","created":{"date-parts":[[2024,12,11]],"date-time":"2024-12-11T18:20:20Z","timestamp":1733941220000},"page":"266-298","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Direct FSS Constructions for\u00a0Branching Programs and\u00a0More from\u00a0PRGs with\u00a0Encoded-Output Homomorphism"],"prefix":"10.1007","author":[{"given":"Elette","family":"Boyle","sequence":"first","affiliation":[]},{"given":"Lisa","family":"Kohl","sequence":"additional","affiliation":[]},{"given":"Zhe","family":"Li","sequence":"additional","affiliation":[]},{"given":"Peter","family":"Scholl","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,12,12]]},"reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"Abram, D., Damg\u00e5rd, I., Orlandi, C., Scholl, P.: An algebraic framework for silent preprocessing with trustless setup and active security. In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO\u00a02022, Part\u00a0IV. LNCS, vol. 13510, pp. 421\u2013452 (Aug 2022)","DOI":"10.1007\/978-3-031-15985-5_15"},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"Alamati, N., Montgomery, H., Patranabis, S., Roy, A.: Minicrypt primitives with algebraic structure and applications. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT\u00a02019, Part\u00a0II. LNCS, vol. 11477, pp. 55\u201382 (May 2019)","DOI":"10.1007\/978-3-030-17656-3_3"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"Applebaum, B., Cash, D., Peikert, C., Sahai, A.: Fast cryptographic primitives and circular-secure encryption based on hard learning problems. In: Halevi, S. (ed.) CRYPTO\u00a02009. LNCS, vol. 5677, pp. 595\u2013618 (Aug 2009)","DOI":"10.1007\/978-3-642-03356-8_35"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Barni, M., Failla, P., Kolesnikov, V., Lazzeretti, R., Sadeghi, A.R., Schneider, T.: Secure evaluation of private linear branching programs with medical applications. In: Backes, M., Ning, P. (eds.) ESORICS\u00a02009. LNCS, vol. 5789, pp. 424\u2013439 (Sep 2009)","DOI":"10.1007\/978-3-642-04444-1_26"},{"issue":"2","key":"9_CR5","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1109\/TIFS.2011.2108650","volume":"6","author":"M Barni","year":"2011","unstructured":"Barni, M., Failla, P., Lazzeretti, R., Sadeghi, A., Schneider, T.: Privacy-preserving ECG classification with branching programs and neural networks. IEEE Trans. Inf. Forensics Secur. 6(2), 452\u2013468 (2011)","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"Benhamouda, F., Degwekar, A., Ishai, Y., Rabin, T.: On the local leakage resilience of linear secret sharing schemes. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO\u00a02018, Part\u00a0I. LNCS, vol. 10991, pp. 531\u2013561 (Aug 2018)","DOI":"10.1007\/978-3-319-96884-1_18"},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"Bogdanov, A., Guo, S., Masny, D., Richelson, S., Rosen, A.: On the hardness of learning with rounding over small modulus. In: Kushilevitz, E., Malkin, T. (eds.) TCC\u00a02016-A, Part\u00a0I. LNCS, vol. 9562, pp. 209\u2013224 (Jan 2016)","DOI":"10.1007\/978-3-662-49096-9_9"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"Boneh, D., Boyle, E., Corrigan-Gibbs, H., Gilboa, N., Ishai, Y.: Lightweight techniques for private heavy hitters. In: 2021 IEEE Symposium on Security and Privacy. pp. 762\u2013776. IEEE Computer Society Press (May 2021)","DOI":"10.1109\/SP40001.2021.00048"},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"Boneh, D., Halevi, S., Hamburg, M., Ostrovsky, R.: Circular-secure encryption from decision Diffie-Hellman. In: Wagner, D. (ed.) CRYPTO\u00a02008. LNCS, vol. 5157, pp. 108\u2013125 (Aug 2008)","DOI":"10.1007\/978-3-540-85174-5_7"},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"Boneh, D., Lewi, K., Montgomery, H.W., Raghunathan, A.: Key homomorphic PRFs and their applications. In: Canetti, R., Garay, J.A. (eds.) CRYPTO\u00a02013, Part\u00a0I. LNCS, vol. 8042, pp. 410\u2013428 (Aug 2013)","DOI":"10.1007\/978-3-642-40041-4_23"},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"Bost, R., Popa, R.A., Tu, S., Goldwasser, S.: Machine learning classification over encrypted data. In: NDSS\u00a02015. The Internet Society (Feb 2015)","DOI":"10.14722\/ndss.2015.23241"},{"key":"9_CR12","unstructured":"Boyle, E.: Function Secret Sharing (2022), http:\/\/cyber.biu.ac.il\/wp-content\/uploads\/2021\/11\/FSS-2022-BIU-WinterSchool_Elette.pdf, The 12th BIU Winter School on cryptography - Advances in Secure Computation"},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"Boyle, E., Chandran, N., Gilboa, N., Gupta, D., Ishai, Y., Kumar, N., Rathee, M.: Function secret sharing for mixed-mode and fixed-point secure computation. In: Canteaut, A., Standaert, F.X. (eds.) EUROCRYPT\u00a02021, Part\u00a0II. LNCS, vol. 12697, pp. 871\u2013900 (Oct 2021)","DOI":"10.1007\/978-3-030-77886-6_30"},{"key":"9_CR14","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. pp. 896\u2013912. ACM Press (Oct 2018)","DOI":"10.1145\/3243734.3243868"},{"key":"9_CR15","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: Boldyreva, A., Micciancio, D. (eds.) CRYPTO\u00a02019, Part\u00a0III. LNCS, vol. 11694, pp. 489\u2013518 (Aug 2019)","DOI":"10.1007\/978-3-030-26954-8_16"},{"key":"9_CR16","doi-asserted-by":"crossref","unstructured":"Boyle, E., Couteau, G., Gilboa, N., Ishai, Y., Orr\u00f9, M.: Homomorphic secret sharing: Optimizations and applications. In: Thuraisingham, B.M., Evans, D., Malkin, T., Xu, D. (eds.) ACM CCS 2017. pp. 2105\u20132122. ACM Press (Oct\u00a0\/\u00a0Nov 2017)","DOI":"10.1145\/3133956.3134107"},{"key":"9_CR17","doi-asserted-by":"crossref","unstructured":"Boyle, E., Gilboa, N., Ishai, Y.: Function secret sharing. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT\u00a02015, Part\u00a0II. LNCS, vol. 9057, pp. 337\u2013367 (Apr 2015)","DOI":"10.1007\/978-3-662-46803-6_12"},{"key":"9_CR18","doi-asserted-by":"crossref","unstructured":"Boyle, E., Gilboa, N., Ishai, Y.: Breaking the circuit size barrier for secure computation under DDH. In: Robshaw, M., Katz, J. (eds.) CRYPTO\u00a02016, Part\u00a0I. LNCS, vol. 9814, pp. 509\u2013539 (Aug 2016)","DOI":"10.1007\/978-3-662-53018-4_19"},{"key":"9_CR19","doi-asserted-by":"crossref","unstructured":"Boyle, E., Gilboa, N., Ishai, Y.: Function secret sharing: Improvements and extensions. In: Weippl, E.R., Katzenbeisser, S., Kruegel, C., Myers, A.C., Halevi, S. (eds.) ACM CCS 2016. pp. 1292\u20131303. ACM Press (Oct 2016)","DOI":"10.1145\/2976749.2978429"},{"key":"9_CR20","doi-asserted-by":"crossref","unstructured":"Boyle, E., Gilboa, N., Ishai, Y.: Secure computation with preprocessing via function secret sharing. In: Hofheinz, D., Rosen, A. (eds.) TCC\u00a02019, Part\u00a0I. LNCS, vol. 11891, pp. 341\u2013371 (Dec 2019)","DOI":"10.1007\/978-3-030-36030-6_14"},{"key":"9_CR21","unstructured":"Boyle, E., Kohl, L., Li, Z., Scholl, P.: Direct FSS constructions for branching programs and more from PRGs with encoded-output homomorphism. Cryptology ePrint Archive, Report 2024\/192 (2024), https:\/\/eprint.iacr.org\/2024\/192"},{"key":"9_CR22","doi-asserted-by":"crossref","unstructured":"Boyle, E., Kohl, L., Scholl, P.: Homomorphic secret sharing from lattices without FHE. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT\u00a02019, Part\u00a0II. LNCS, vol. 11477, pp. 3\u201333 (May 2019)","DOI":"10.1007\/978-3-030-17656-3_1"},{"key":"9_CR23","doi-asserted-by":"crossref","unstructured":"Brakerski, Z., Goldwasser, S.: Circular and leakage resilient public-key encryption under subgroup indistinguishability - (or: Quadratic residuosity strikes back). In: Rabin, T. (ed.) CRYPTO\u00a02010. LNCS, vol. 6223, pp. 1\u201320 (Aug 2010)","DOI":"10.1007\/978-3-642-14623-7_1"},{"key":"9_CR24","doi-asserted-by":"crossref","unstructured":"Brickell, J., Porter, D.E., Shmatikov, V., Witchel, E.: Privacy-preserving remote diagnostics. In: Ning, P., De Capitani di Vimercati, S., Syverson, P.F. (eds.) ACM CCS 2007. pp. 498\u2013507. ACM Press (Oct 2007)","DOI":"10.1145\/1315245.1315307"},{"key":"9_CR25","doi-asserted-by":"crossref","unstructured":"Corrigan-Gibbs, H., Boneh, D., Mazi\u00e8res, D.: Riposte: An anonymous messaging system handling millions of users. In: 2015 IEEE Symposium on Security and Privacy. pp. 321\u2013338. IEEE Computer Society Press (May 2015)","DOI":"10.1109\/SP.2015.27"},{"key":"9_CR26","unstructured":"D\u2019Anvers, J.P., Karmakar, A., Roy, S.S., Vercauteren, F., Mera, J.M.B., Beirendonck, M.V., Basso, A.: SABER. Tech. rep., National Institute of Standards and Technology (2020), available at https:\/\/csrc.nist.gov\/projects\/post-quantum-cryptography\/post-quantum-cryptography-standardization\/round-3-submissions"},{"key":"9_CR27","doi-asserted-by":"crossref","unstructured":"Dauterman, E., Rathee, M., Popa, R.A., Stoica, I.: Waldo: A private time-series database from function secret sharing. In: SP 2022. pp. 2450\u20132468. IEEE (2022), https:\/\/doi.org\/10.1109\/SP46214.2022.9833611","DOI":"10.1109\/SP46214.2022.9833611"},{"key":"9_CR28","doi-asserted-by":"crossref","unstructured":"Davidson, A., Katsumata, S., Nishimaki, R., Yamada, S., Yamakawa, T.: Adaptively secure constrained pseudorandom functions in the standard model. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO\u00a02020, Part\u00a0I. LNCS, vol. 12170, pp. 559\u2013589 (Aug 2020)","DOI":"10.1007\/978-3-030-56784-2_19"},{"key":"9_CR29","doi-asserted-by":"crossref","unstructured":"Dodis, Y., Halevi, S., Rothblum, R.D., Wichs, D.: Spooky encryption and its applications. In: Robshaw, M., Katz, J. (eds.) CRYPTO\u00a02016, Part\u00a0III. LNCS, vol. 9816, pp. 93\u2013122 (Aug 2016)","DOI":"10.1007\/978-3-662-53015-3_4"},{"key":"9_CR30","doi-asserted-by":"crossref","unstructured":"Doerner, J., shelat, a.: Scaling ORAM for secure computation. In: Thuraisingham, B.M., Evans, D., Malkin, T., Xu, D. (eds.) ACM CCS 2017. pp. 523\u2013535. ACM Press (Oct\u00a0\/\u00a0Nov 2017)","DOI":"10.1145\/3133956.3133967"},{"key":"9_CR31","doi-asserted-by":"crossref","unstructured":"Fazio, N., Gennaro, R., Jafarikhah, T., Skeith III, W.E.: Homomorphic secret sharing from paillier encryption. In: Okamoto, T., Yu, Y., Au, M.H., Li, Y. (eds.) ProvSec 2017. LNCS, vol. 10592, pp. 381\u2013399 (Oct 2017)","DOI":"10.1007\/978-3-319-68637-0_23"},{"key":"9_CR32","doi-asserted-by":"crossref","unstructured":"Gilboa, N., Ishai, Y.: Compressing cryptographic resources. In: Wiener, M.J. (ed.) CRYPTO\u201999. LNCS, vol. 1666, pp. 591\u2013608 (Aug 1999)","DOI":"10.1007\/3-540-48405-1_37"},{"key":"9_CR33","doi-asserted-by":"crossref","unstructured":"Gilboa, N., Ishai, Y.: Distributed point functions and their applications. In: Nguyen, P.Q., Oswald, E. (eds.) EUROCRYPT\u00a02014. LNCS, vol. 8441, pp. 640\u2013658 (May 2014)","DOI":"10.1007\/978-3-642-55220-5_35"},{"key":"9_CR34","doi-asserted-by":"crossref","unstructured":"Ishai, Y., Paskin, A.: Evaluating branching programs on encrypted data. In: Vadhan, S.P. (ed.) TCC\u00a02007. LNCS, vol. 4392, pp. 575\u2013594 (Feb 2007)","DOI":"10.1007\/978-3-540-70936-7_31"},{"key":"9_CR35","doi-asserted-by":"crossref","unstructured":"Kiss, \u00c1., Naderpour, M., Liu, J., Asokan, N., Schneider, T.: SoK: Modular and efficient private decision tree evaluation. PoPETs 2019(2), 187\u2013208 (Apr 2019)","DOI":"10.2478\/popets-2019-0026"},{"key":"9_CR36","doi-asserted-by":"crossref","unstructured":"Koshiba, T., Kurosawa, K.: Short exponent Diffie-Hellman problems. In: Bao, F., Deng, R., Zhou, J. (eds.) PKC\u00a02004. LNCS, vol. 2947, pp. 173\u2013186 (Mar 2004)","DOI":"10.1007\/978-3-540-24632-9_13"},{"key":"9_CR37","doi-asserted-by":"crossref","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.) EUROCRYPT\u00a02021, Part\u00a0I. LNCS, vol. 12696, pp. 678\u2013708 (Oct 2021)","DOI":"10.1007\/978-3-030-77870-5_24"},{"key":"9_CR38","doi-asserted-by":"crossref","unstructured":"Pippenger, N.: On simultaneous resource bounds (preliminary version). In: FOCS. pp. 307\u2013311. IEEE Computer Society (1979)","DOI":"10.1109\/SFCS.1979.29"},{"issue":"2","key":"9_CR39","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1147\/rd.32.0114","volume":"3","author":"MO Rabin","year":"1959","unstructured":"Rabin, M.O., Scott, D.: Finite automata and their decision problems. IBM journal of research and development 3(2), 114\u2013125 (1959)","journal-title":"IBM journal of research and development"},{"key":"9_CR40","doi-asserted-by":"crossref","unstructured":"Roy, L., Singh, J.: Large message homomorphic secret sharing from DCR and applications. In: Malkin, T., Peikert, C. (eds.) CRYPTO\u00a02021, Part\u00a0III. LNCS, vol. 12827, pp. 687\u2013717. Virtual Event (Aug 2021)","DOI":"10.1007\/978-3-030-84252-9_23"},{"key":"9_CR41","unstructured":"Schwabe, P., Avanzi, R., Bos, J., Ducas, L., Kiltz, E., Lepoint, T., Lyubashevsky, V., Schanck, J.M., Seiler, G., Stehl\u00e9, D., Ding, J.: CRYSTALS-KYBER. Tech. rep., National Institute of Standards and Technology (2022), available at https:\/\/csrc.nist.gov\/Projects\/post-quantum-cryptography\/selected-algorithms-2022"},{"key":"9_CR42","doi-asserted-by":"crossref","unstructured":"Servan-Schreiber, S., Langowski, S., Devadas, S.: Private approximate nearest neighbor search with sublinear communication. In: SP. pp. 911\u2013929. IEEE (2022), https:\/\/doi.org\/10.1109\/SP46214.2022.9833702","DOI":"10.1109\/SP46214.2022.9833702"},{"key":"9_CR43","unstructured":"Sipser, M.: Introduction to the theory of computation. PWS Publishing Company (1997)"},{"key":"9_CR44","doi-asserted-by":"crossref","unstructured":"Tueno, A., Kerschbaum, F., Katzenbeisser, S.: Private evaluation of decision trees using sublinear cost. PoPETs 2019(1), 266\u2013286 (Jan 2019)","DOI":"10.2478\/popets-2019-0015"},{"key":"9_CR45","unstructured":"Wang, F., Yun, C., Goldwasser, S., Vaikuntanathan, V., Zaharia, M.: Splinter: Practical private queries on public data. In: NSDI 2017 (2017), https:\/\/www.usenix.org\/conference\/nsdi17\/technical-sessions\/presentation\/wang-frank"},{"key":"9_CR46","doi-asserted-by":"crossref","unstructured":"Wegener, I., Woelfel, P.: New results on the complexity of the middle bit of multiplication. In: CCC. pp. 100\u2013110. IEEE Computer Society (2005)","DOI":"10.1109\/CCC.2005.14"},{"key":"9_CR47","doi-asserted-by":"crossref","unstructured":"Wu, D.J., Feng, T., Naehrig, M., Lauter, K.E.: Privately evaluating decision trees and random forests. PoPETs 2016(4), 335\u2013355 (Oct 2016)","DOI":"10.1515\/popets-2016-0043"}],"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-0938-3_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,11]],"date-time":"2024-12-11T19:31:07Z","timestamp":1733945467000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-0938-3_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,12]]},"ISBN":["9789819609376","9789819609383"],"references-count":47,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-0938-3_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024,12,12]]},"assertion":[{"value":"12 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"}}]}}