{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,4]],"date-time":"2026-02-04T17:43:44Z","timestamp":1770227024088,"version":"3.49.0"},"publisher-location":"Singapore","reference-count":58,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819987207","type":"print"},{"value":"9789819987214","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-981-99-8721-4_1","type":"book-chapter","created":{"date-parts":[[2023,12,17]],"date-time":"2023-12-17T05:01:44Z","timestamp":1702789304000},"page":"3-37","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Breaking the\u00a0Size Barrier: Universal Circuits Meet Lookup Tables"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2085-0454","authenticated-orcid":false,"given":"Yann","family":"Disser","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3615-0583","authenticated-orcid":false,"given":"Daniel","family":"G\u00fcnther","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8090-1316","authenticated-orcid":false,"given":"Thomas","family":"Schneider","sequence":"additional","affiliation":[]},{"given":"Maximilian","family":"Stillger","sequence":"additional","affiliation":[]},{"given":"Arthur","family":"Wigandt","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6438-534X","authenticated-orcid":false,"given":"Hossein","family":"Yalame","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,12,18]]},"reference":[{"key":"1_CR1","unstructured":"Intel Quartus Prime Software. https:\/\/www.intel.com\/content\/www\/us\/en\/products\/details\/fpga\/development-tools\/quartus-prime.html"},{"key":"1_CR2","unstructured":"Verilog to Routing. https:\/\/verilogtorouting.org\/"},{"key":"1_CR3","unstructured":"Vivado 2023.1 - Logic Synthesis. https:\/\/www.xilinx.com\/support\/documentation-navigation\/design-hubs\/dh0018-vivado-synthesis-hub.html"},{"key":"1_CR4","unstructured":"XST Synthesis. https:\/\/www.xilinx.com\/products\/design-tools\/xst.html"},{"key":"1_CR5","unstructured":"Synopsys Inc., Design Compiler (2010). http:\/\/www.synopsys.com\/Tools\/Implementation\/RTLSynthesis\/DesignCompiler"},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"Abadi, M., Feigenbaum, J.: Secure circuit evaluation. JoC (1990)","DOI":"10.1007\/BF02252866"},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"Alhassan, M.Y., G\u00fcnther, D., Kiss, \u00c1., Schneider, T.: Efficient and Scalable Universal Circuits. JoC (2020)","DOI":"10.1007\/s00145-020-09346-z"},{"key":"1_CR8","unstructured":"Attrapadung, N.: Fully Secure and Succinct Attribute Based Encryption for Circuits from Multi-linear Maps. Cryptology ePrint Archive, Report 2014\/772 (2016)"},{"key":"1_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1007\/978-3-642-04444-1_26","volume-title":"Computer Security \u2013 ESORICS 2009","author":"M Barni","year":"2009","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"},{"key":"1_CR10","unstructured":"Berkeley Logic Synthesis and Verification Group: ABC: A system for sequential synthesis and verification. http:\/\/www.eecs.berkeley.edu\/alanmi\/abc\/"},{"key":"1_CR11","unstructured":"Bhandari, J., et al.: Not All Fabrics Are Created Equal: Exploring eFPGA Parameters For IP Redaction. CoRR: abs\/2111.04222 (2021)"},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"Br\u00fcggemann, A., Hundt, R., Schneider, T., Suresh, A., Yalame, H.: FLUTE: fast and secure lookup table evaluations. In: S &P (2023)","DOI":"10.1109\/SP46215.2023.10179345"},{"key":"1_CR13","doi-asserted-by":"crossref","unstructured":"Demmler, D., Schneider, T., Zohner, M.: ABY - a framework for efficient mixed-protocol secure two-party computation. In: NDSS (2015)","DOI":"10.14722\/ndss.2015.23113"},{"key":"1_CR14","doi-asserted-by":"crossref","unstructured":"Dessouky, G., Koushanfar, F., Sadeghi, A., Schneider, T., Zeitouni, S., Zohner, M.: Pushing the communication barrier in secure computation using lookup tables. In: NDSS (2017)","DOI":"10.14722\/ndss.2017.23097"},{"key":"1_CR15","doi-asserted-by":"crossref","unstructured":"Disser, Y., G\u00fcnther, D., Schneider, T., Stillger, M., Wigandt, A., Yalame, H.: Breaking the Size Barrier: Universal Circuits meet Lookup Tables. Cryptology ePrint Archive, Report 2022\/1652 (2022)","DOI":"10.1007\/978-981-99-8721-4_1"},{"key":"1_CR16","doi-asserted-by":"crossref","unstructured":"Fiore, D., Gennaro, R., Pastro, V.: Efficiently verifiable computation on encrypted data. In: CCS (2014)","DOI":"10.1145\/2660267.2660366"},{"key":"1_CR17","doi-asserted-by":"crossref","unstructured":"Frikken, K.B., Atallah, M.J., Zhang, C.: Privacy-preserving credit checking. In: ACM Conference on Electronic Commerce (2005)","DOI":"10.1145\/1064009.1064025"},{"key":"1_CR18","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":"1_CR19","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":"1_CR20","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: STOC (1987)","DOI":"10.1145\/28395.28420"},{"key":"1_CR21","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: CCS (2019)","DOI":"10.1145\/3319535.3363251"},{"key":"1_CR22","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":"1_CR23","doi-asserted-by":"crossref","unstructured":"Henecka, W., K\u00f6gl, S., Sadeghi, A., Schneider, T., Wehrenberg, I.: TASTY: Tool for Automating Secure Two-Party Computations. In: CCS (2010)","DOI":"10.1145\/1866307.1866358"},{"key":"1_CR24","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. LNCS, vol. 12309, pp. 401\u2013420. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-59013-0_20"},{"key":"1_CR25","doi-asserted-by":"publisher","first-page":"1252","DOI":"10.1109\/TIFS.2023.3236457","volume":"18","author":"K Ji","year":"2023","unstructured":"Ji, K., Zhang, B., Lu, T., Ren, K.: Multi-party private function evaluation for RAM. IEEE Trans. Inf. Forensics Secur. 18, 1252\u20131267 (2023)","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"1_CR26","unstructured":"Kamali, H.M., Azar, K.Z., Gaj, K., Homayoun, H., Sasan, A.: LUT-lock: a novel LUT-based logic obfuscation for FPGA-bitstream and ASIC-hardware protection. In: ISVLSI (2018)"},{"key":"1_CR27","unstructured":"Kamara, S., Raykova, M.: Secure outsourced computation in a multi-tenant cloud. In: IBM Workshop on Cryptography and Security in Clouds (2011)"},{"key":"1_CR28","unstructured":"Karatsuba, A.A., Ofman, Y.P.: Multiplication of many-digital numbers by automatic computers. In: SSSR Academy of Sciences (1962)"},{"key":"1_CR29","first-page":"593","volume":"72","author":"M Karnaugh","year":"1953","unstructured":"Karnaugh, M.: The map method for synthesis of combinational logic circuits. Trans. Am. Inst. Electrical Eng. 72, 593\u2013599 (1953)","journal-title":"Trans. Am. Inst. Electrical Eng."},{"key":"1_CR30","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":"1_CR31","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":"1_CR32","unstructured":"Kluczniak, K.: Circuit privacy for FHEW\/TFHE-style fully homomorphic encryption in practice. Cryptology ePrint Archive, Report 2022\/1459 (2022)"},{"key":"1_CR33","doi-asserted-by":"crossref","unstructured":"Kolesnikov, V., Sadeghi, A.R., Schneider, T.: Improved garbled circuit building blocks and applications to auctions and computing minima. In: CANS (2009)","DOI":"10.1007\/978-3-642-10433-6_1"},{"key":"1_CR34","unstructured":"Kolesnikov, V., Schneider, T.: A practical universal circuit construction and secure evaluation of private functions. In: FC (2008)"},{"key":"1_CR35","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":"1_CR36","unstructured":"Lipmaa, H., Mohassel, P., Sadeghian, S.S.: Valiant\u2019s Universal Circuit: Improvements, Implementation, and Applications. Cryptology ePrint Archive, Report 2016\/017 (2016)"},{"key":"1_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/978-3-030-84245-1_13","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"H Liu","year":"2021","unstructured":"Liu, H., Yu, Yu., Zhao, S., Zhang, J., Liu, W., Hu, Z.: Pushing the limits of valiant\u2019s universal circuits: simpler, tighter and more compact. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021. LNCS, vol. 12826, pp. 365\u2013394. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84245-1_13"},{"key":"1_CR38","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/978-3-030-97121-2_13","volume-title":"PKC 2022","author":"Y Liu","year":"2022","unstructured":"Liu, Y., Wang, Q., Yiu, S.: Making private function evaluation safer, faster, and simpler. In: Hanaoka, G., Shikata, J., Watanabe, Y. (eds.) PKC 2022. LNCS, vol. 13177, pp. 349\u2013378. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-030-97121-2_13"},{"key":"1_CR39","unstructured":"Malkhi, D., Nisan, N., Pinkas, B., Sella, Y.: Fairplay - secure two-party computation system. In: USENIX Security (2004)"},{"key":"1_CR40","unstructured":"Masserova, E., Garg, D., Mai, K., Pileggi, L., Goyal, V., Parno, B.: Logic Locking-Connecting Theory and Practice. Cryptology ePrint Archive, Report 2022\/545 (2022)"},{"key":"1_CR41","unstructured":"Patra, A., Schneider, T., Suresh, A., Yalame, H.: ABY2.0: improved mixed-protocol secure two-party computation. In: USENIX Security (2021)"},{"key":"1_CR42","doi-asserted-by":"crossref","unstructured":"Patra, A., Schneider, T., Suresh, A., Yalame, H.: SynCirc: efficient synthesis of depth-optimized circuits for secure computation. In: HOST (2021)","DOI":"10.1109\/HOST49136.2021.9702293"},{"key":"1_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/978-3-642-01957-9_6","volume-title":"Applied Cryptography and Network Security","author":"A Paus","year":"2009","unstructured":"Paus, A., Sadeghi, A.-R., Schneider, T.: Practical secure evaluation of semi-private functions. In: Abdalla, M., Pointcheval, D., Fouque, P.-A., Vergnaud, D. (eds.) ACNS 2009. LNCS, vol. 5536, pp. 89\u2013106. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-01957-9_6"},{"key":"1_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1007\/978-3-642-10366-7_15","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2009","author":"B Pinkas","year":"2009","unstructured":"Pinkas, B., Schneider, T., Smart, N.P., Williams, S.C.: Secure two-party computation is practical. In: Matsui, M. (ed.) ASIACRYPT 2009. LNCS, vol. 5912, pp. 250\u2013267. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-10366-7_15"},{"key":"1_CR45","unstructured":"Pohle, E., Abidin, A., Preneel, B.: Poster: fast evaluation of S-boxes in MPC. In: NDSS (2022)"},{"key":"1_CR46","doi-asserted-by":"crossref","unstructured":"Quine, W.V.: The problem of simplifying truth functions. The American Mathematical Monthly (1952)","DOI":"10.1080\/00029890.1952.11988183"},{"key":"1_CR47","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1007\/978-3-030-84242-0_5","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"M Rosulek","year":"2021","unstructured":"Rosulek, M., Roy, L.: Three halves make a whole? Beating the half-gates lower bound for garbled circuits. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021. LNCS, vol. 12825, pp. 94\u2013124. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84242-0_5"},{"key":"1_CR48","doi-asserted-by":"crossref","unstructured":"Sadeghi, A.R., Schneider, T.: Generalized universal circuits for secure evaluation of private functions with application to data classification. In: ICISC (2008)","DOI":"10.1007\/978-3-642-00730-9_21"},{"key":"1_CR49","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1002\/j.1538-7305.1949.tb03624.x","volume":"28","author":"CE Shannon","year":"1949","unstructured":"Shannon, C.E.: The synthesis of two-terminal switching circuits. Bell Syst. Tech. J. 28, 59\u201398 (1949)","journal-title":"Bell Syst. Tech. J."},{"key":"1_CR50","unstructured":"Smart, N., Tillich, S.: Bristol Fashion MPC circuits. https:\/\/homes.esat.kuleuven.be\/nsmart\/MPC\/old-circuits.html"},{"key":"1_CR51","doi-asserted-by":"crossref","unstructured":"Valiant, L.G.: Universal Circuits (Preliminary Report). In: STOC (1976)","DOI":"10.1145\/800113.803649"},{"key":"1_CR52","volume-title":"The Complexity of Boolean Functions","author":"I Wegener","year":"1987","unstructured":"Wegener, I.: The Complexity of Boolean Functions. Wiley, New York (1987)"},{"key":"1_CR53","unstructured":"Wolf, C., Glaser, J., Kepler, J.: Yosys - a free Verilog synthesis suite. In: Austrian Workshop on Microelectronics (2013)"},{"key":"1_CR54","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: How to generate and exchange secrets (Extended Abstract). In: FOCS (1986)","DOI":"10.1109\/SFCS.1986.25"},{"key":"1_CR55","doi-asserted-by":"crossref","unstructured":"Yasin, M., Sengupta, A., Nabeel, M.T., Ashraf, M., Rajendran, J., Sinanoglu, O.: Provably-secure logic locking: from theory to practice. In: CCS (2017)","DOI":"10.1145\/3133956.3133985"},{"key":"1_CR56","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1007\/978-3-662-46803-6_8","volume-title":"Advances in Cryptology - EUROCRYPT 2015","author":"S Zahur","year":"2015","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 2015. LNCS, vol. 9057, pp. 220\u2013250. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46803-6_8"},{"key":"1_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. LNCS, vol. 11921, pp. 401\u2013425. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-34578-5_15"},{"key":"1_CR58","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. 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 2023"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-99-8721-4_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,17]],"date-time":"2025-12-17T01:02:12Z","timestamp":1765933332000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-99-8721-4_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9789819987207","9789819987214"],"references-count":58,"URL":"https:\/\/doi.org\/10.1007\/978-981-99-8721-4_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"18 December 2023","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":"Guangzhou","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 December 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 December 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"asiacrypt2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/asiacrypt.iacr.org\/2023\/","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":"375","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":"106","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":"28% - 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":"12","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":"This content has been made available to all.","name":"free","label":"Free to read"}]}}