{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,17]],"date-time":"2025-12-17T08:46:42Z","timestamp":1765961202066,"version":"3.40.3"},"publisher-location":"Cham","reference-count":36,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030345778"},{"type":"electronic","value":"9783030345785"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-34578-5_15","type":"book-chapter","created":{"date-parts":[[2019,11,25]],"date-time":"2019-11-25T00:02:57Z","timestamp":1574640177000},"page":"401-425","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Valiant\u2019s Universal Circuits Revisited: An Overall Improvement and a Lower Bound"],"prefix":"10.1007","author":[{"given":"Shuoyao","family":"Zhao","sequence":"first","affiliation":[]},{"given":"Yu","family":"Yu","sequence":"additional","affiliation":[]},{"given":"Jiang","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Hanlin","family":"Liu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,11,25]]},"reference":[{"key":"15_CR1","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":"15_CR2","unstructured":"Alhassan, M.Y., G\u00fcnther, D., Kiss, \u00c1., Schneider, T.: Efficient and scalable universal circuits. Cryptology ePrint Archive, Report 2019\/348 (2019). https:\/\/eprint.iacr.org\/2019\/348"},{"key":"15_CR3","doi-asserted-by":"crossref","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 (SP 2017), pp. 843\u2013862 (2017)","DOI":"10.1109\/SP.2017.15"},{"key":"15_CR4","unstructured":"Attrapadung, N.: Fully secure and succinct attribute based encryption for circuits from multi-linear maps. Cryptology ePrint Archive, Report 2014\/772 (2014). https:\/\/eprint.iacr.org\/2014\/772"},{"key":"15_CR5","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":"15_CR6","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). https:\/\/eprint.iacr.org\/2017\/415"},{"issue":"4","key":"15_CR7","doi-asserted-by":"publisher","first-page":"833","DOI":"10.1137\/0214058","volume":"14","author":"SA Cook","year":"1985","unstructured":"Cook, S.A., Hoover, H.J.: A depth-universal circuit. SIAM J. Comput. 14(4), 833\u2013839 (1985)","journal-title":"SIAM J. Comput."},{"key":"15_CR8","doi-asserted-by":"crossref","unstructured":"Fiore, D., Gennaro, R., Pastro, V.: Efficiently verifiable computation on encrypted data. In: Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security (CCS 2014), pp. 844\u2013855 (2014)","DOI":"10.1145\/2660267.2660366"},{"key":"15_CR9","doi-asserted-by":"crossref","unstructured":"Fisch, B.A., et al.: Malicious-client security in blind seer: a scalable private DBMS. In: 2015 IEEE Symposium on Security and Privacy (SP 2015), pp. 395\u2013410 (2015)","DOI":"10.1109\/SP.2015.31"},{"key":"15_CR10","doi-asserted-by":"crossref","unstructured":"Galil, Z., Paul, W.J.: An efficient general purpose parallel computer. In: Proceedings of the 13th Annual ACM Symposium on Theory of Computing (STOC 1981), pp. 247\u2013262 (1981)","DOI":"10.1145\/800076.802478"},{"issue":"3","key":"15_CR11","doi-asserted-by":"publisher","first-page":"882","DOI":"10.1137\/14095772X","volume":"45","author":"S Garg","year":"2016","unstructured":"Garg, S., Gentry, C., Halevi, S., Raykova, M., Sahai, A., Waters, B.: Candidate indistinguishability obfuscation and functional encryption for all circuits. SIAM J. Comput. 45(3), 882\u2013929 (2016)","journal-title":"SIAM J. Comput."},{"key":"15_CR12","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. LNCS, vol. 8043, pp. 479\u2013499. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40084-1_27"},{"key":"15_CR13","unstructured":"Garg, S., Gentry, C., Halevi, S., Zhandry, M.: Fully secure attribute based encryption from multilinear maps. IACR Cryptology ePrint Archive 2014, 622 (2014). http:\/\/eprint.iacr.org\/2014\/622"},{"key":"15_CR14","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":"15_CR15","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"},{"issue":"6","key":"15_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2824233","volume":"62","author":"Sergey Gorbunov","year":"2015","unstructured":"Gorbunov, S., Vaikuntanathan, V., Wee, H.: Attribute-based encryption for circuits. J. ACM 62(6), 45:1\u201345:33 (2015)","journal-title":"Journal of the ACM"},{"key":"15_CR17","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. LNCS, vol. 10625, pp. 443\u2013470. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70697-9_16"},{"key":"15_CR18","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. LNCS, vol. 8617, pp. 458\u2013475. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44381-1_26"},{"key":"15_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"699","DOI":"10.1007\/978-3-662-49890-3_27","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2016","author":"\u00c1 Kiss","year":"2016","unstructured":"Kiss, \u00c1., Schneider, T.: Valiant\u2019s universal circuit is practical. In: Fischlin, M., Coron, J.-S. (eds.) EUROCRYPT 2016. LNCS, vol. 9665, pp. 699\u2013728. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49890-3_27"},{"key":"15_CR20","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. LNCS, vol. 5126, pp. 486\u2013498. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-70583-3_40"},{"key":"15_CR21","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":"15_CR22","doi-asserted-by":"crossref","unstructured":"Lindell, Y., Riva, B.: Blazing fast 2PC in the offline\/online setting with security for malicious adversaries. In: Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security (CCS 2015), pp. 579\u2013590 (2015)","DOI":"10.1145\/2810103.2813666"},{"key":"15_CR23","unstructured":"Lipmaa, H., Mohassel, P., Sadeghian, S.: Valiant\u2019s universal circuit: Improvements, implementation, and applications. Cryptology ePrint Archive, Report 2016\/017 (2016). https:\/\/eprint.iacr.org\/2016\/017"},{"key":"15_CR24","unstructured":"Malkhi, D., Nisan, N., Pinkas, B., Sella, Y.: Fairplay - secure two-party computation system. In: Proceedings of the 13th USENIX Security Symposium, pp. 287\u2013302 (2004)"},{"key":"15_CR25","doi-asserted-by":"crossref","unstructured":"Meyer auf der Heide, F.: Efficiency of universal parallel computers. In: Theoretical Computer Science, pp. 221\u2013241 (1983)","DOI":"10.1007\/BFb0009647"},{"key":"15_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1007\/978-3-642-38348-9_33","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2013","author":"P Mohassel","year":"2013","unstructured":"Mohassel, P., Sadeghian, 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"},{"key":"15_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"486","DOI":"10.1007\/978-3-662-45608-8_26","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2014","author":"P Mohassel","year":"2014","unstructured":"Mohassel, P., Sadeghian, S., Smart, N.P.: Actively secure private function evaluation. In: Sarkar, P., Iwata, T. (eds.) ASIACRYPT 2014. LNCS, vol. 8874, pp. 486\u2013505. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-45608-8_26"},{"key":"15_CR28","doi-asserted-by":"crossref","unstructured":"Pappas, V., et al.: Blind seer: a scalable private DBMS. In: 2014 IEEE Symposium on Security and Privacy (SP 2014), pp. 359\u2013374 (2014)","DOI":"10.1109\/SP.2014.30"},{"key":"15_CR29","unstructured":"Sadeghian, S.S.: New Techniques for Private Function Evaluation. Ph.D. thesis, University of Calgary (2015)"},{"key":"15_CR30","unstructured":"Tillich, S., Smart, N.: Circuits of basic functions suitable for MPC and FHE (2015). https:\/\/homes.esat.kuleuven.be\/%7Ensmart\/MPC\/"},{"key":"15_CR31","doi-asserted-by":"crossref","unstructured":"Valiant, L.G.: Universal circuits (preliminary report). In: Proceedings of the 8th Annual ACM Symposium on Theory of Computing (STOC 1976), pp. 196\u2013203 (1976)","DOI":"10.1145\/800113.803649"},{"key":"15_CR32","doi-asserted-by":"crossref","unstructured":"Wegener, I.: The complexity of boolean functions. ECCC books, lectures and surveys (1987). https:\/\/bit.ly\/2I7MGJi","DOI":"10.1007\/3-540-18170-9_185"},{"key":"15_CR33","unstructured":"Zhao, S.: The c++ source code of our 4-way uc implementation (2018). https:\/\/github.com\/Anonymous8012\/UC"},{"key":"15_CR34","unstructured":"Zhao, S.: A proof for that the graph in Figure 1 is a 4-way supernode. shared in a double-blind way (registration\/log-in not required for upload and download) (2018). https:\/\/www.filedropper.com\/sn-proof"},{"key":"15_CR35","doi-asserted-by":"crossref","unstructured":"Zhu, R., Cassel, D., Sabry, A., Huang, Y.: nanoPI: extreme-scale actively-secure multi-party computation. In: Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security (CCS 2018), pp. 862\u2013879 (2018)","DOI":"10.1145\/3243734.3243850"},{"key":"15_CR36","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 ASIACRYPT 2019"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-34578-5_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T10:53:22Z","timestamp":1710327202000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-34578-5_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030345778","9783030345785"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-34578-5_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"25 November 2019","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":"Kobe","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 December 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 December 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"asiacrypt2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/asiacrypt.iacr.org\/2019\/index.html","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":"IACR Web submission software","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"307","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":"71","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":"23% - 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.5","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":"18","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)"}}]}}