{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,21]],"date-time":"2026-07-21T23:28:28Z","timestamp":1784676508884,"version":"3.55.0"},"publisher-location":"Cham","reference-count":59,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030842444","type":"print"},{"value":"9783030842451","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[[2021]]},"DOI":"10.1007\/978-3-030-84245-1_13","type":"book-chapter","created":{"date-parts":[[2021,8,10]],"date-time":"2021-08-10T23:04:26Z","timestamp":1628636666000},"page":"365-394","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Pushing the Limits of Valiant\u2019s Universal Circuits: Simpler, Tighter and More Compact"],"prefix":"10.1007","author":[{"given":"Hanlin","family":"Liu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yu","family":"Yu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shuoyao","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jiang","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wenling","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhenkai","family":"Hu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,8,11]]},"reference":[{"key":"13_CR1","doi-asserted-by":"publisher","unstructured":"Abadi, M., Feigenbaum, J.: Secure circuit evaluation. J. Cryptol. 2(1), 1\u201312 (1990). https:\/\/doi.org\/10.1007\/BF02252866","DOI":"10.1007\/BF02252866"},{"key":"13_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/978-3-642-55220-5_22","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2014","author":"A Afshar","year":"2014","unstructured":"Afshar, A., Mohassel, P., Pinkas, B., Riva, B.: Non-interactive secure computation based on cut-and-choose. In: Nguyen, P.Q., Oswald, E. (eds.) EUROCRYPT 2014. LNCS, vol. 8441, pp. 387\u2013404. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-55220-5_22"},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"Alhassan, M.Y., G\u00fcnther, D., Kiss, \u00c1., Schneider, T.: Efficient and scalable universal circuits. J. Cryptol. 33(3), 1216\u20131271 (2020)","DOI":"10.1007\/s00145-020-09346-z"},{"key":"13_CR4","unstructured":"Anonymous: The C++ source code of our 2-way UC implementation (2020). https:\/\/github.com\/Cryptogroup\/universalcircuit"},{"key":"13_CR5","doi-asserted-by":"publisher","unstructured":"Araki, T., et al.: Optimized honest-majority MPC for malicious adversaries - breaking the 1 billion-gate per second barrier. In: 2017 IEEE Symposium on Security and Privacy, pp. 843\u2013862. IEEE Computer Society Press, San Jose (May 2017). https:\/\/doi.org\/10.1109\/SP.2017.15","DOI":"10.1109\/SP.2017.15"},{"key":"13_CR6","unstructured":"Attrapadung, N.: Fully secure and succinct attribute based encryption for circuits from multi-linear maps. Cryptology ePrint Archive, Report 2014\/772 (2014). http:\/\/eprint.iacr.org\/2014\/772"},{"key":"13_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/978-3-319-15618-7_12","volume-title":"Engineering Secure Software and Systems","author":"S Banescu","year":"2015","unstructured":"Banescu, S., Ochoa, M., Kunze, N., Pretschner, A.: Idea: benchmarking indistinguishability obfuscation \u2013 a candidate implementation. In: Piessens, F., Caballero, J., Bielova, N. (eds.) ESSoS 2015. LNCS, vol. 8978, pp. 149\u2013156. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-15618-7_12"},{"key":"13_CR8","doi-asserted-by":"publisher","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 2009. LNCS, vol. 5789, pp. 424\u2013439. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-04444-1_26","DOI":"10.1007\/978-3-642-04444-1_26"},{"key":"13_CR9","doi-asserted-by":"publisher","unstructured":"Ben-David, A., Nisan, N., Pinkas, B.: FairplayMP: a system for secure multi-party computation. In: Ning, P., Syverson, P.F., Jha, S. (eds.) ACM CCS 2008, pp. 257\u2013266. ACM Press, Alexandria (October 2008). https:\/\/doi.org\/10.1145\/1455770.1455804","DOI":"10.1145\/1455770.1455804"},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"Bera, D., Fenner, S.A., Green, F., Homer, S.: Efficient universal quantum circuits. Quantum Inf. Comput. 10(1&2), 16\u201327 (2010). http:\/\/www.rintonpress.com\/xxqic10\/qic-10-12\/0016-0027.pdf","DOI":"10.26421\/QIC10.1-2-2"},{"key":"13_CR11","unstructured":"Bicer, O., Bingol, M.A., Kiraz, M.S., Levi, A.: Towards practical PFE: an efficient 2-party private function evaluation protocol based on half gates. Cryptology ePrint Archive, Report 2017\/415 (2017). http:\/\/eprint.iacr.org\/2017\/415"},{"key":"13_CR12","doi-asserted-by":"publisher","unstructured":"Bitansky, N., Vaikuntanathan, V.: Indistinguishability obfuscation from functional encryption. In: Guruswami, V. (ed.) 56th FOCS, pp. 171\u2013190. IEEE Computer Society Press, Berkeley (October 2015). https:\/\/doi.org\/10.1109\/FOCS.2015.20","DOI":"10.1109\/FOCS.2015.20"},{"key":"13_CR13","doi-asserted-by":"publisher","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, Alexandria (October 2007). https:\/\/doi.org\/10.1145\/1315245.1315307","DOI":"10.1145\/1315245.1315307"},{"key":"13_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1007\/3-540-45022-X_43","volume-title":"Automata, Languages and Programming","author":"C Cachin","year":"2000","unstructured":"Cachin, C., Camenisch, J., Kilian, J., M\u00fcller, J.: One-round secure computation and secure autonomous mobile agents. In: Montanari, U., Rolim, J.D.P., Welzl, E. (eds.) ICALP 2000. LNCS, vol. 1853, pp. 512\u2013523. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-45022-X_43"},{"key":"13_CR15","doi-asserted-by":"crossref","unstructured":"Cook, S.A., Hoover, H.J.: A depth-universal circuit. SIAM J. Comput. 14(4), 833\u2013839 (1985)","DOI":"10.1137\/0214058"},{"key":"13_CR16","unstructured":"D\u00e9nes, K.: Gr\u00e1fok \u00e9s m\u00e1trixok. Matematikai \u00e9s Fizikai Lapok 38, 116\u2013119 (1931)"},{"key":"13_CR17","doi-asserted-by":"publisher","unstructured":"Fiore, D., Gennaro, R., Pastro, V.: Efficiently verifiable computation on encrypted data. In: Ahn, G.J., Yung, M., Li, N. (eds.) ACM CCS 2014, pp. 844\u2013855. ACM Press, Scottsdale (November 2014). https:\/\/doi.org\/10.1145\/2660267.2660366","DOI":"10.1145\/2660267.2660366"},{"key":"13_CR18","doi-asserted-by":"publisher","unstructured":"Fisch, B.A., et al.: Malicious-client security in blind seer: a scalable private DBMS. In: 2015 IEEE Symposium on Security and Privacy, pp. 395\u2013410. IEEE Computer Society Press, San Jose (May 2015). https:\/\/doi.org\/10.1109\/SP.2015.31","DOI":"10.1109\/SP.2015.31"},{"key":"13_CR19","doi-asserted-by":"crossref","unstructured":"Frikken, K., Atallah, M., Li, J.: Attribute-based access control with hidden policies and hidden credentials. IEEE Trans. Comput. 55(10), 1259\u20131270 (2006)","DOI":"10.1109\/TC.2006.158"},{"key":"13_CR20","doi-asserted-by":"crossref","unstructured":"Frikken, K., Atallah, M., Zhang, C.: Privacy-preserving credit checking. In: Proceedings of the 6th ACM Conference on Electronic Commerce, pp. 147\u2013154 (2005)","DOI":"10.1145\/1064009.1064025"},{"key":"13_CR21","unstructured":"Frikken, K.B., Li, J., Atallah, M.J.: Trust negotiation with hidden credentials, hidden policies, and policy cycles. In: NDSS 2006. The Internet Society, San Diego (February 2006)"},{"key":"13_CR22","doi-asserted-by":"publisher","unstructured":"Galil, Z., Paul, W.J.: An efficient general purpose parallel computer. In: 13th ACM STOC, pp. 247\u2013262. ACM Press, Milwaukee (May 1981). https:\/\/doi.org\/10.1145\/800076.802478","DOI":"10.1145\/800076.802478"},{"key":"13_CR23","doi-asserted-by":"publisher","unstructured":"Garg, S., Gentry, C., Halevi, S., Raykova, M., Sahai, A., Waters, B.: Candidate indistinguishability obfuscation and functional encryption for all circuits. In: 54th FOCS, pp. 40\u201349. IEEE Computer Society Press, Berkeley (October 2013). https:\/\/doi.org\/10.1109\/FOCS.2013.13","DOI":"10.1109\/FOCS.2013.13"},{"key":"13_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1007\/978-3-642-40084-1_27","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"S Garg","year":"2013","unstructured":"Garg, S., Gentry, C., Halevi, S., Sahai, A., Waters, B.: Attribute-based encryption for circuits from multilinear maps. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013, Part II. LNCS, vol. 8043, pp. 479\u2013499. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40084-1_27"},{"key":"13_CR25","unstructured":"Garg, S., Gentry, C., Halevi, S., Zhandry, M.: Fully secure attribute based encryption from multilinear maps. Cryptology ePrint Archive, Report 2014\/622 (2014). http:\/\/eprint.iacr.org\/2014\/622"},{"key":"13_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"626","DOI":"10.1007\/978-3-642-38348-9_37","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2013","author":"R Gennaro","year":"2013","unstructured":"Gennaro, R., Gentry, C., Parno, B., Raykova, M.: Quadratic span programs and succinct NIZKs without PCPs. In: Johansson, T., Nguyen, P.Q. (eds.) EUROCRYPT 2013. LNCS, vol. 7881, pp. 626\u2013645. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38348-9_37"},{"key":"13_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/978-3-642-14623-7_9","volume-title":"Advances in Cryptology \u2013 CRYPTO 2010","author":"C Gentry","year":"2010","unstructured":"Gentry, C., Halevi, S., Vaikuntanathan, V.: i-hop homomorphic encryption and rerandomizable Yao circuits. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol. 6223, pp. 155\u2013172. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14623-7_9"},{"key":"13_CR28","doi-asserted-by":"publisher","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. (ed.) 19th ACM STOC, pp. 218\u2013229. ACM Press, New York City (May 1987). https:\/\/doi.org\/10.1145\/28395.28420","DOI":"10.1145\/28395.28420"},{"key":"13_CR29","doi-asserted-by":"publisher","unstructured":"Gorbunov, S., Vaikuntanathan, V., Wee, H.: Attribute-based encryption for circuits. In: Boneh, D., Roughgarden, T., Feigenbaum, J. (eds.) 45th ACM STOC, pp. 545\u2013554. ACM Press, Palo Alto (June 2013). https:\/\/doi.org\/10.1145\/2488608.2488677","DOI":"10.1145\/2488608.2488677"},{"key":"13_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/978-3-319-70697-9_16","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2017","author":"D G\u00fcnther","year":"2017","unstructured":"G\u00fcnther, D., Kiss, \u00c1., Schneider, T.: More efficient universal circuit constructions. In: Takagi, T., Peyrin, T. (eds.) ASIACRYPT 2017, Part II. LNCS, vol. 10625, pp. 443\u2013470. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70697-9_16"},{"key":"13_CR31","doi-asserted-by":"publisher","unstructured":"Heath, D., Kolesnikov, V., Peceny, S.: MOTIF: (almost) free branching in GMW. In: Moriai, S., Wang, H. (eds.) ASIACRYPT 2020, Part III. LNCS, vol. 12493, pp. 3\u201330. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64840-4_1","DOI":"10.1007\/978-3-030-64840-4_1"},{"key":"13_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/978-3-030-59013-0_20","volume-title":"Computer Security \u2013 ESORICS 2020","author":"M Holz","year":"2020","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. (eds.) ESORICS 2020, Part II. LNCS, vol. 12309, pp. 401\u2013420. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-59013-0_20"},{"key":"13_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"458","DOI":"10.1007\/978-3-662-44381-1_26","volume-title":"Advances in Cryptology \u2013 CRYPTO 2014","author":"Y Huang","year":"2014","unstructured":"Huang, Y., Katz, J., Kolesnikov, V., Kumaresan, R., Malozemoff, A.J.: Amortizing garbled circuits. In: Garay, J.A., Gennaro, R. (eds.) CRYPTO 2014, Part II. LNCS, vol. 8617, pp. 458\u2013475. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44381-1_26"},{"key":"13_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1007\/978-3-540-70936-7_31","volume-title":"Theory of Cryptography","author":"Y Ishai","year":"2007","unstructured":"Ishai, Y., Paskin, A.: Evaluating branching programs on encrypted data. In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol. 4392, pp. 575\u2013594. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-70936-7_31"},{"key":"13_CR35","unstructured":"Kamara, S., Raykova, M.: Secure outsourced computation in a multi-tenant cloud. In: IBM Workshop on Cryptography and Security in Clouds, pp. 15\u201316 (2011)"},{"key":"13_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"556","DOI":"10.1007\/978-3-642-25385-0_30","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2011","author":"J Katz","year":"2011","unstructured":"Katz, J., Malka, L.: Constant-round private function evaluation with linear complexity. In: Lee, D.H., Wang, X. (eds.) ASIACRYPT 2011. LNCS, vol. 7073, pp. 556\u2013571. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25385-0_30"},{"key":"13_CR37","doi-asserted-by":"publisher","unstructured":"Kiss, \u00c1., Schneider, T.: Valiant\u2019s universal circuit is practical. In: Fischlin, M., Coron, J.S. (eds.) EUROCRYPT 2016, Part I. LNCS, vol. 9665, pp. 699\u2013728. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49890-3_27","DOI":"10.1007\/978-3-662-49890-3_27"},{"key":"13_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"486","DOI":"10.1007\/978-3-540-70583-3_40","volume-title":"Automata, Languages and Programming","author":"V Kolesnikov","year":"2008","unstructured":"Kolesnikov, V., Schneider, T.: Improved garbled circuit: free XOR gates and applications. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part II. LNCS, vol. 5126, pp. 486\u2013498. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-70583-3_40"},{"key":"13_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/978-3-540-85230-8_7","volume-title":"Financial Cryptography and Data Security","author":"V Kolesnikov","year":"2008","unstructured":"Kolesnikov, V., Schneider, T.: A practical universal circuit construction and secure evaluation of private functions. In: Tsudik, G. (ed.) FC 2008. LNCS, vol. 5143, pp. 83\u201397. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85230-8_7"},{"key":"13_CR40","doi-asserted-by":"publisher","unstructured":"Lindell, Y., Riva, B.: Blazing fast 2PC in the offline\/online setting with security for malicious adversaries. In: Ray, I., Li, N., Kruegel, C. (eds.) ACM CCS 2015, pp. 579\u2013590. ACM Press, Denver (October 2015). https:\/\/doi.org\/10.1145\/2810103.2813666","DOI":"10.1145\/2810103.2813666"},{"key":"13_CR41","unstructured":"Lipmaa, H., Mohassel, P., Sadeghian, S.: Valiant\u2019s universal circuit: improvements, implementation, and applications. Cryptology ePrint Archive, Report 2016\/017 (2016). http:\/\/eprint.iacr.org\/2016\/017"},{"key":"13_CR42","unstructured":"Liu, H., Yu, Y., Zhao, S., Zhang, J., Liu, W., Hu, Z.: Pushing the limits of Valiant\u2019s universal circuits: simpler, tighter and more compact. Cryptology ePrint Archive, Report 2020\/161 (2020). https:\/\/eprint.iacr.org\/2020\/161"},{"key":"13_CR43","doi-asserted-by":"crossref","unstructured":"Lov\u00e1sz, L., Plummer, M.D.: Matching Theory, vol. 367. American Mathematical Society, Providence (2009)","DOI":"10.1090\/chel\/367"},{"key":"13_CR44","unstructured":"Malkhi, D., Nisan, N., Pinkas, B., Sella, Y.: Fairplay - secure two-party computation system. In: Blaze, M. (ed.) USENIX Security 2004, pp. 287\u2013302. USENIX Association, San Diego (August 2004)"},{"key":"13_CR45","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/BFb0036483","volume-title":"Theoretical Computer Science","author":"F Meyer auf der Heide","year":"1982","unstructured":"Meyer auf der Heide, F.: Efficiency of universal parallel computers. In: Cremers, A.B., Kriegel, H.-P. (eds.) GI-TCS 1983. LNCS, vol. 145, pp. 221\u2013229. Springer, Heidelberg (1982). https:\/\/doi.org\/10.1007\/BFb0036483"},{"key":"13_CR46","doi-asserted-by":"publisher","unstructured":"Mohassel, P., Rosulek, M.: Non-interactive secure 2PC in the offline\/online and batch settings. In: Coron, J., Nielsen, J.B. (eds.) EUROCRYPT 2017, Part III. LNCS, vol. 10212, pp. 425\u2013455. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-56617-7_15","DOI":"10.1007\/978-3-319-56617-7_15"},{"key":"13_CR47","doi-asserted-by":"publisher","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 2013. LNCS, vol. 7881, pp. 557\u2013574. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38348-9_33","DOI":"10.1007\/978-3-642-38348-9_33"},{"key":"13_CR48","doi-asserted-by":"crossref","unstructured":"Niksefat, S., Sadeghiyan, B., Mohassel, P., Sadeghian, S.: Zids: a privacy-preserving intrusion detection system using secure two-party computation protocols. Comput. J. 57(4), 494\u2013509 (2014)","DOI":"10.1093\/comjnl\/bxt019"},{"key":"13_CR49","doi-asserted-by":"publisher","unstructured":"Ostrovsky, R., Skeith III, W.E.: Private searching on streaming data. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol. 3621, pp. 223\u2013240. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11535218_14","DOI":"10.1007\/11535218_14"},{"key":"13_CR50","doi-asserted-by":"publisher","unstructured":"Pappas, V., et al.: Blind seer: a scalable private DBMS. In: 2014 IEEE Symposium on Security and Privacy, pp. 359\u2013374. IEEE Computer Society Press, Berkeley (May 2014). https:\/\/doi.org\/10.1109\/SP.2014.30","DOI":"10.1109\/SP.2014.30"},{"key":"13_CR51","unstructured":"Sadeghian, S.S.: New techniques for private function evaluation. Ph.D. thesis (2015)"},{"key":"13_CR52","unstructured":"Tillich, S., Smart, N.: Circuits of basic functions suitable for MPC and FHE (2015). https:\/\/homes.esat.kuleuven.be\/~nsmart\/MPC\/"},{"key":"13_CR53","doi-asserted-by":"crossref","unstructured":"Valiant, L.G.: Universal circuits (preliminary report). In: 8th ACM STOC, pp. 196\u2013203 (1976)","DOI":"10.1145\/800113.803649"},{"key":"13_CR54","doi-asserted-by":"crossref","unstructured":"Wegener, I.: The Complexity of Boolean Functions. Wiley, Hoboken (1987)","DOI":"10.1007\/3-540-18170-9_185"},{"key":"13_CR55","doi-asserted-by":"publisher","unstructured":"Yao, A.C.C.: Protocols for secure computations (extended abstract). In: 23rd FOCS, pp. 160\u2013164. IEEE Computer Society Press, Chicago (November 1982). https:\/\/doi.org\/10.1109\/SFCS.1982.38","DOI":"10.1109\/SFCS.1982.38"},{"key":"13_CR56","doi-asserted-by":"publisher","unstructured":"Yao, A.C.C.: How to generate and exchange secrets (extended abstract). In: 27th FOCS, pp. 162\u2013167. IEEE Computer Society Press, Toronto (October 1986). https:\/\/doi.org\/10.1109\/SFCS.1986.25","DOI":"10.1109\/SFCS.1986.25"},{"key":"13_CR57","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/978-3-030-34578-5_15","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2019","author":"S Zhao","year":"2019","unstructured":"Zhao, S., Yu, Yu., Zhang, J., Liu, H.: Valiant\u2019s universal circuits revisited: an overall improvement and a lower bound. In: Galbraith, S.D., Moriai, S. (eds.) ASIACRYPT 2019, Part I. LNCS, vol. 11921, pp. 401\u2013425. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-34578-5_15"},{"key":"13_CR58","doi-asserted-by":"publisher","unstructured":"Zhu, R., Cassel, D., Sabry, A., Huang, Y.: NANOPI: extreme-scale actively-secure multi-party computation. In: Lie, D., Mannan, M., Backes, M., Wang, X. (eds.) ACM CCS 2018, pp. 862\u2013879. ACM Press, Toronto (October 2018). https:\/\/doi.org\/10.1145\/3243734.3243850","DOI":"10.1145\/3243734.3243850"},{"key":"13_CR59","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1007\/978-3-662-46803-6_15","volume-title":"Advances in Cryptology - EUROCRYPT 2015","author":"J Zimmerman","year":"2015","unstructured":"Zimmerman, J.: How to obfuscate programs directly. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015, Part II. LNCS, vol. 9057, pp. 439\u2013467. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46803-6_15"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2021"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-84245-1_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,11]],"date-time":"2024-08-11T00:13:46Z","timestamp":1723335226000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-84245-1_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030842444","9783030842451"],"references-count":59,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-84245-1_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"11 August 2021","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":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 August 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 August 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"41","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"crypto2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"HotCRP","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"426","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"103","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"24% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"20.9","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"1 invited paper is also included.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}