{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,11]],"date-time":"2026-08-11T09:27:58Z","timestamp":1786440478975,"version":"build-2736575974"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032354174","type":"print"},{"value":"9783032354181","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-35418-1_4","type":"book-chapter","created":{"date-parts":[[2026,8,11]],"date-time":"2026-08-11T08:32:21Z","timestamp":1786437141000},"page":"103-133","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Private Function Evaluation with\u00a0Linear Complexity"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3982-4264","authenticated-orcid":false,"given":"Shuaishuai","family":"Li","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0000-5403-2866","authenticated-orcid":false,"given":"Cong","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1086-0288","authenticated-orcid":false,"given":"Anyu","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7846-269X","authenticated-orcid":false,"given":"Xiaoyun","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,8,12]]},"reference":[{"issue":"1","key":"4_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02252866","volume":"2","author":"M Abadi","year":"1990","unstructured":"Abadi, M., Feigenbaum, J.: Secure circuit evaluation. J. Cryptol. 2(1), 1\u201312 (1990). https:\/\/doi.org\/10.1007\/BF02252866","journal-title":"J. Cryptol."},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"Albrecht, M.R., Grassi, L., Rechberger, C., Roy, A., Tiessen, T.: Mimc: Efficient encryption and cryptographic hashing with minimal multiplicative complexity. In: Cheon, J.H., Takagi, T. (eds.) ASIACRYPT, pp. 191\u2013219 (2016)","DOI":"10.1007\/978-3-662-53887-6_7"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"Albrecht, M.R., Rechberger, C., Schneider, T., Tiessen, T., Zohner, M.: Ciphers for MPC and FHE. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT, pp. 430\u2013454 (2015)","DOI":"10.1007\/978-3-662-46800-5_17"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"Alhassan, M.Y., Gunther, D., Kiss, A., Schneider, T.: Efficient and scalable universal circuits. J. Cryptol., 1216\u20131271 (2020)","DOI":"10.1007\/s00145-020-09346-z"},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"Barni, M., Failla, P., Kolesnikov, V., Lazzeretti, R., Sadeghi, A., Schneider, T.: Secure evaluation of private linear branching programs with medical applications. In: Backes, M., Ning, P. (eds.) ESORICS, pp. 424\u2013439 (2009)","DOI":"10.1007\/978-3-642-04444-1_26"},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"Baum, C., Damg\u00e5rd, I., Toft, T., Zakarias, R.W.: Better preprocessing for secure multiparty computation. In: Manulis, M., Sadeghi, A., Schneider, S.A. (eds.) ACNS, pp. 327\u2013345 (2016)","DOI":"10.1007\/978-3-319-39555-5_18"},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"Bellare, M., Desai, A., Jokipii, E., Rogaway, P.: A concrete security treatment of symmetric encryption. In: Proceedings 38th Annual Symposium on Foundations of Computer Science, pp. 394\u2013403. IEEE (1997)","DOI":"10.1109\/SFCS.1997.646128"},{"key":"4_CR8","unstructured":"Bi\u00e7er, O., Bing\u00f6l, M.A., Kiraz, M.S., Levi, A.: Highly efficient and re-executable private function evaluation with linear complexity. IEEE Trans. Dependable Secur. Comput., 835\u2013847 (2022)"},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"Bing\u00f6l, M.A., Bi\u00e7er, O., Kiraz, M.S., Levi, A.: An efficient 2-party private function evaluation protocol based on half gates. Comput. J., 598\u2013613 (2019)","DOI":"10.1093\/comjnl\/bxy136"},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"Bresson, E., Catalano, D., Pointcheval, D.: A simple public-key cryptosystem with a double trapdoor decryption mechanism and its applications. In: Laih, C. (ed.) ASIACRYPT, pp. 37\u201354 (2003)","DOI":"10.1007\/978-3-540-40061-5_3"},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"Brickell, J., Porter, D.E., Shmatikov, V., Witchel, E.: Privacy-preserving remote diagnostics. In: Ning, P., di\u00a0Vimercati, S.D.C., Syverson, P.F. (eds.) CCS, pp. 498\u2013507 (2007)","DOI":"10.1145\/1315245.1315307"},{"key":"4_CR12","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally composable security: A new paradigm for cryptographic protocols. In: FOCS, pp. 136\u2013145 (2001)","DOI":"10.1109\/SFCS.2001.959888"},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"Castagnos, G., Laguillaumie, F.: Linearly homomorphic encryption from $$\\sf DDH$$. In: Nyberg, K. (ed.) CT-RSA, pp. 487\u2013505 (2015)","DOI":"10.1007\/978-3-319-16715-2_26"},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game or A completeness theorem for protocols with honest majority. In: Aho, A.V. (ed.) STOC, pp. 218\u2013229 (1987)","DOI":"10.1145\/28395.28420"},{"key":"4_CR15","doi-asserted-by":"crossref","unstructured":"Goyal, V., Li, J., Misra, A.K., Ostrovsky, R., Song, Y., Weng, C.: Dishonest majority constant-round MPC with linear communication from DDH. In: Chung, K., Sasaki, Y. (eds.) ASIACRYPT, pp. 167\u2013199 (2024)","DOI":"10.1007\/978-981-96-0938-3_6"},{"key":"4_CR16","doi-asserted-by":"crossref","unstructured":"G\u00fcnther, D., Kiss, \u00c1., Scheidel, L., Schneider, T.: Poster: Framework for semi-private function evaluation with application to secure insurance rate calculation. In: Cavallaro, L., Kinder, J., Wang, X., Katz, J. (eds.) CCS, pp. 2541\u20132543 (2019)","DOI":"10.1145\/3319535.3363251"},{"key":"4_CR17","doi-asserted-by":"crossref","unstructured":"Holz, M., Kiss, \u00c1., Rathee, D., Schneider, T.: Linear-complexity private function evaluation is practical. In: Chen, L., Li, N., Liang, K., Schneider, S.A. (eds.) ESORICS, pp. 401\u2013420 (2020)","DOI":"10.1007\/978-3-030-59013-0_20"},{"key":"4_CR18","doi-asserted-by":"crossref","unstructured":"Jia, H., Li, X.: PFE: linear active security, double-shuffle proofs, and low-complexity communication. In: Ge, C., Yung, M. (eds.) Inscrypt, pp. 227\u2013252 (2023)","DOI":"10.1007\/978-981-97-0942-7_12"},{"key":"4_CR19","unstructured":"Katz, J.: Lecture on circuit complexity (2005)"},{"key":"4_CR20","doi-asserted-by":"crossref","unstructured":"Katz, J., Malka, L.: Constant-round private function evaluation with linear complexity. In: Lee, D.H., Wang, X. (eds.) ASIACRYPT, pp. 556\u2013571 (2011)","DOI":"10.1007\/978-3-642-25385-0_30"},{"key":"4_CR21","doi-asserted-by":"crossref","unstructured":"Li, S., Zhang, C., Lin, D.: Oblivious transfer from rerandomizable pke. In: International Conference on Information and Communications Security, pp. 128\u2013145. Springer (2023)","DOI":"10.1007\/978-981-99-7356-9_8"},{"key":"4_CR22","unstructured":"Li, S., Zhang, C., Wang, A., Wang, X.: Private function evaluation with linear complexity. Cryptology ePrint Archive, Paper 2026\/926 (2026)"},{"key":"4_CR23","doi-asserted-by":"crossref","unstructured":"Liu, Y., Wang, Q., Yiu, S.: Making private function evaluation safer, faster, and simpler. In: Hanaoka, G., Shikata, J., Watanabe, Y. (eds.) PKC, pp. 349\u2013378 (2022)","DOI":"10.1007\/978-3-030-97121-2_13"},{"key":"4_CR24","doi-asserted-by":"crossref","unstructured":"Mohassel, P., Sadeghian, S.S.: How to hide circuits in MPC an efficient framework for private function evaluation. In: Johansson, T., Nguyen, P.Q. (eds.) EUROCRYPT, pp. 557\u2013574 (2013)","DOI":"10.1007\/978-3-642-38348-9_33"},{"key":"4_CR25","doi-asserted-by":"crossref","unstructured":"Mohassel, P., Sadeghian, S.S., Smart, N.P.: Actively secure private function evaluation. In: Sarkar, P., Iwata, T. (eds.) ASIACRYPT, pp. 486\u2013505 (2014)","DOI":"10.1007\/978-3-662-45608-8_26"},{"key":"4_CR26","doi-asserted-by":"crossref","unstructured":"Paillier, P.: Public-key cryptosystems based on composite degree residuosity classes. In: Stern, J. (ed.) EUROCRYPT, pp. 223\u2013238 (1999)","DOI":"10.1007\/3-540-48910-X_16"},{"key":"4_CR27","doi-asserted-by":"crossref","unstructured":"Paus, A., Sadeghi, A., Schneider, T.: Practical secure evaluation of semi-private functions. In: Abdalla, M., Pointcheval, D., Fouque, P., Vergnaud, D. (eds.) ACNS, pp. 89\u2013106 (2009)","DOI":"10.1007\/978-3-642-01957-9_6"},{"key":"4_CR28","doi-asserted-by":"crossref","unstructured":"Raz, R.: Elusive functions and lower bounds for arithmetic circuits. In: Dwork, C. (ed.) STOC, pp. 711\u2013720 (2008)","DOI":"10.1145\/1374376.1374479"},{"key":"4_CR29","doi-asserted-by":"crossref","unstructured":"Shpilka, A., Yehudayoff, A.: Arithmetic circuits: A survey of recent results and open questions. Found. Trends Theor. Comput. Sci., pp. 207\u2013388 (2010)","DOI":"10.1561\/0400000039"},{"key":"4_CR30","doi-asserted-by":"crossref","unstructured":"Valiant, L.G.: Universal circuits (preliminary report). In: Chandra, A.K., Wotschke, D., Friedman, E.P., Harrison, M.A. (eds.) STOC, pp. 196\u2013203 (1976)","DOI":"10.1145\/800113.803649"},{"key":"4_CR31","doi-asserted-by":"crossref","unstructured":"Vollmer, H.: Introduction to Circuit Complexity - A Uniform Approach (1999)","DOI":"10.1007\/978-3-662-03927-4"},{"key":"4_CR32","doi-asserted-by":"crossref","unstructured":"Xu, Y., Jia, H., Li, X., Li, Q., Bao, Y., Hou, X.: Constant-round multiparty private function evaluation with (quasi-)linear complexities. In: Tibouchi, M., Wang, X. (eds.) ACNS, pp. 115\u2013142 (2023)","DOI":"10.1007\/978-3-031-33491-7_5"},{"key":"4_CR33","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: How to generate and exchange secrets (extended abstract). In: FOCS, pp. 162\u2013167 (1986)","DOI":"10.1109\/SFCS.1986.25"},{"key":"4_CR34","doi-asserted-by":"crossref","unstructured":"Zahur, S., Rosulek, M., Evans, D.: Two halves make a whole - reducing data transfer in garbled circuits using half gates. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT, pp. 220\u2013250 (2015)","DOI":"10.1007\/978-3-662-46803-6_8"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2026"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-35418-1_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,11]],"date-time":"2026-08-11T08:32:49Z","timestamp":1786437169000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-35418-1_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032354174","9783032354181"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-35418-1_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"12 August 2026","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":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 August 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 August 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"46","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"crypto2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2026\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}