{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,27]],"date-time":"2026-09-27T08:59:33Z","timestamp":1790499573706,"version":"4.1.0"},"publisher-location":"Cham","reference-count":41,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319968773","type":"print"},{"value":"9783319968780","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-96878-0_13","type":"book-chapter","created":{"date-parts":[[2018,7,23]],"date-time":"2018-07-23T08:53:57Z","timestamp":1532336037000},"page":"365-391","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":41,"title":["Optimizing Authenticated Garbling for Faster Secure Two-Party Computation"],"prefix":"10.1007","author":[{"given":"Jonathan","family":"Katz","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Samuel","family":"Ranellucci","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mike","family":"Rosulek","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiao","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2018,7,24]]},"reference":[{"key":"13_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":"13_CR2","doi-asserted-by":"crossref","unstructured":"Ames, S., Hazay, C., Ishai, Y., Venkitasubramaniam, M.: Ligero: lightweight sublinear arguments without a trusted setup. In: ACM CCS 2017, pp. 2087\u20132104. ACM Press (2017)","DOI":"10.1145\/3133956.3134104"},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"Araki, T., Barak, A., Furukawa, J., Lichter, T., Lindell, Y., Nof, A., Ohara, K., Watzman, A., Weinstein, O.: Optimized honest-majority MPC for malicious adversaries - breaking the 1 billion-gate per second barrier. In: 2017 IEEE Symposium on Security and Privacy, San Jose, CA, USA, 22\u201326 May 2017, pp. 843\u2013862. IEEE Computer Society Press (2017)","DOI":"10.1109\/SP.2017.15"},{"key":"13_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1007\/3-540-46766-1_34","volume-title":"Advances in Cryptology \u2014 CRYPTO 1991","author":"D Beaver","year":"1992","unstructured":"Beaver, D.: Efficient multiparty protocols using circuit randomization. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 420\u2013432. Springer, Heidelberg (1992). https:\/\/doi.org\/10.1007\/3-540-46766-1_34"},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"Beaver, D., Micali, S., Rogaway, P.: The round complexity of secure protocols. In: Proceedings of the Twenty-Second Annual ACM Symposium on Theory of Computing, pp. 503\u2013513. ACM (1990)","DOI":"10.1145\/100216.100287"},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"Bellare, M., Hoang, V.T., Keelveedhi, S., Rogaway, P.: Efficient garbling from a fixed-key blockcipher. In: 2013 IEEE Symposium on Security and Privacy, Berkeley, CA, USA, 19\u201322 May 2013, pp. 478\u2013492. IEEE Computer Society Press (2013)","DOI":"10.1109\/SP.2013.39"},{"key":"13_CR7","unstructured":"Ben-Efraim, A.: On multiparty garbling of arithmetic circuits. Cryptology ePrint Archive, Report 2017\/1186 (2017). https:\/\/eprint.iacr.org\/2017\/1186"},{"key":"13_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1007\/978-3-642-42045-0_23","volume-title":"Advances in Cryptology - ASIACRYPT 2013","author":"LTAN Brand\u00e3o","year":"2013","unstructured":"Brand\u00e3o, L.T.A.N.: Secure two-party computation with reusable bit-commitments, via a cut-and-choose with forge-and-lose technique. In: Sako, K., Sarkar, P. (eds.) ASIACRYPT 2013, Part II. LNCS, vol. 8270, pp. 441\u2013463. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-42045-0_23"},{"key":"13_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1007\/978-3-642-32009-5_38","volume-title":"Advances in Cryptology \u2013 CRYPTO 2012","author":"I Damg\u00e5rd","year":"2012","unstructured":"Damg\u00e5rd, I., Pastro, V., Smart, N.P., Zakarias, S.: Multiparty computation from somewhat homomorphic encryption. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 643\u2013662. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32009-5_38"},{"key":"13_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1007\/978-3-642-38348-9_32","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2013","author":"TK Frederiksen","year":"2013","unstructured":"Frederiksen, T.K., Jakobsen, T.P., Nielsen, J.B., Nordholt, P.S., Orlandi, C.: MiniLEGO: efficient secure two-party computation from general assumptions. In: Johansson, T., Nguyen, P.Q. (eds.) EUROCRYPT 2013. LNCS, vol. 7881, pp. 537\u2013556. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38348-9_32"},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"Gueron, S., Lindell, Y., Nof, A., Pinkas, B.: Fast garbling of circuits under standard assumptions. In: Ray, I., Li, N., Kruegel: C. (eds.) ACM CCS 2015, Denver, CO, USA, 12\u201316 October 2015, pp. 567\u2013578. ACM Press (2015)","DOI":"10.1145\/2810103.2813619"},{"key":"13_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-70503-3_1","volume-title":"Theory of Cryptography","author":"C Hazay","year":"2017","unstructured":"Hazay, C., Ishai, Y., Venkitasubramaniam, M.: Actively secure garbled circuits with constant communication overhead in the plain model. In: Kalai, Y., Reyzin, L. (eds.) TCC 2017, Part II. LNCS, vol. 10678, pp. 3\u201339. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70503-3_1"},{"key":"13_CR13","doi-asserted-by":"crossref","unstructured":"Huang, Y., Evans, D., Katz, J., Malka, L.: Faster secure two-party computation using garbled circuits. In: USENIX Security 2011 (2011)","DOI":"10.1007\/978-3-642-25560-1_2"},{"key":"13_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/978-3-642-40084-1_2","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"Y Huang","year":"2013","unstructured":"Huang, Y., Katz, J., Evans, D.: Efficient secure two-party computation using symmetric cut-and-choose. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013, Part II. LNCS, vol. 8043, pp. 18\u201335. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40084-1_2"},{"key":"13_CR15","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_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/978-3-540-45146-4_9","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"Y Ishai","year":"2003","unstructured":"Ishai, Y., Kilian, J., Nissim, K., Petrank, E.: Extending oblivious transfers efficiently. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 145\u2013161. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45146-4_9"},{"key":"13_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1007\/978-3-662-44381-1_25","volume-title":"Advances in Cryptology \u2013 CRYPTO 2014","author":"V Kolesnikov","year":"2014","unstructured":"Kolesnikov, V., Mohassel, P., Rosulek, M.: FleXOR: flexible garbling for XOR gates that beats free-XOR. In: Garay, J.A., Gennaro, R. (eds.) CRYPTO 2014, Part II. LNCS, vol. 8617, pp. 440\u2013457. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44381-1_25"},{"key":"13_CR18","doi-asserted-by":"crossref","unstructured":"Kolesnikov, V., Nielsen, J.B., Rosulek, M., Trieu, N., Trifiletti, R.: DUPLO: unifying cut-and-choose for garbled circuits. In: ACM CCS 2017, pp. 3\u201320. ACM Press (2017)","DOI":"10.1145\/3133956.3133991"},{"key":"13_CR19","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_CR20","unstructured":"Kreuter, B., Shelat, A., Shen, C.H.: Billion-gate secure computation with malicious adversaries. In: USENIX Security 2012 (2012)"},{"key":"13_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-40084-1_1","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"Y Lindell","year":"2013","unstructured":"Lindell, Y.: Fast cut-and-choose based protocols for malicious and covert adversaries. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013, Part II. LNCS, vol. 8043, pp. 1\u201317. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40084-1_1"},{"key":"13_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/978-3-540-72540-4_4","volume-title":"Advances in Cryptology - EUROCRYPT 2007","author":"Y Lindell","year":"2007","unstructured":"Lindell, Y., Pinkas, B.: An efficient protocol for secure two-party computation in the presence of malicious adversaries. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol. 4515, pp. 52\u201378. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-72540-4_4"},{"key":"13_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/978-3-642-19571-6_20","volume-title":"Theory of Cryptography","author":"Y Lindell","year":"2011","unstructured":"Lindell, Y., Pinkas, B.: Secure two-party computation via cut-and-choose oblivious transfer. In: Ishai, Y. (ed.) TCC 2011. LNCS, vol. 6597, pp. 329\u2013346. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-19571-6_20"},{"key":"13_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"476","DOI":"10.1007\/978-3-662-44381-1_27","volume-title":"Advances in Cryptology \u2013 CRYPTO 2014","author":"Y Lindell","year":"2014","unstructured":"Lindell, Y., Riva, B.: Cut-and-choose Yao-based secure computation in the online\/offline and batch settings. In: Garay, J.A., Gennaro, R. (eds.) CRYPTO 2014, Part II. LNCS, vol. 8617, pp. 476\u2013494. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44381-1_27"},{"key":"13_CR25","doi-asserted-by":"crossref","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, Denver, CO, USA, 12\u201316 October 2015, pp. 579\u2013590. ACM Press (2015)","DOI":"10.1145\/2810103.2813666"},{"key":"13_CR26","unstructured":"Malkhi, D., Nisan, N., Pinkas, B., Sella, Y.: Fairplay\u2014a secure two-party computation system. In: USENIX Security 2004 (2004)"},{"key":"13_CR27","doi-asserted-by":"crossref","unstructured":"Naor, M., Pinkas, B., Sumner, R.: Privacy preserving auctions and mechanism design. In: 1st ACM Conference on Electronic Commerce (1999)","DOI":"10.1145\/336992.337028"},{"key":"13_CR28","doi-asserted-by":"crossref","unstructured":"Nielsen, J., Schneider, T., Trifiletti, R.: Constant-round maliciously secure 2PC with function-independent preprocessing using LEGO. In: Network and Distributed System Security Symposium (NDSS) (2017)","DOI":"10.14722\/ndss.2017.23075"},{"key":"13_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"681","DOI":"10.1007\/978-3-642-32009-5_40","volume-title":"Advances in Cryptology \u2013 CRYPTO 2012","author":"JB Nielsen","year":"2012","unstructured":"Nielsen, J.B., Nordholt, P.S., Orlandi, C., Burra, S.S.: A new approach to practical active-secure two-party computation. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 681\u2013700. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32009-5_40"},{"key":"13_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1007\/978-3-642-00457-5_22","volume-title":"Theory of Cryptography","author":"JB Nielsen","year":"2009","unstructured":"Nielsen, J.B., Orlandi, C.: LEGO for two-party secure computation. In: Reingold, O. (ed.) TCC 2009. LNCS, vol. 5444, pp. 368\u2013386. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00457-5_22"},{"key":"13_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"582","DOI":"10.1007\/978-3-662-53641-4_22","volume-title":"Theory of Cryptography","author":"JB Nielsen","year":"2016","unstructured":"Nielsen, J.B., Orlandi, C.: Cross and clean: amortized garbled circuits with constant overhead. In: Hirt, M., Smith, A.D. (eds.) TCC 2016, Part I. LNCS, vol. 9985, pp. 582\u2013603. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53641-4_22"},{"key":"13_CR32","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":"13_CR33","unstructured":"Rindal, P., Rosulek, M.: Faster malicious 2-party secure computation with online\/offline dual execution. In: USENIX Security 2016 (2016)"},{"key":"13_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1007\/978-3-642-20465-4_22","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2011","author":"A Shelat","year":"2011","unstructured":"Shelat, A., Shen, C.H.: Two-output secure computation with malicious adversaries. In: Paterson, K.G. (ed.) EUROCRYPT 2011. LNCS, vol. 6632, pp. 386\u2013405. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-20465-4_22"},{"key":"13_CR35","doi-asserted-by":"crossref","unstructured":"Shelat, A., Shen, C.H.: Fast two-party secure computation with minimal assumptions. In: Sadeghi, A.R., Gligor, V.D., Yung, M. (eds.) ACM CCS 2013, Berlin, Germany, 4\u20138 November 2013, pp. 523\u2013534. ACM Press (2013)","DOI":"10.1145\/2508859.2516698"},{"key":"13_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/978-3-319-56617-7_14","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2017","author":"X Wang","year":"2017","unstructured":"Wang, X., Malozemoff, A.J., Katz, J.: Faster secure two-party computation in the single-execution setting. In: Coron, J.-S., Nielsen, J.B. (eds.) EUROCRYPT 2017, Part II. LNCS, vol. 10212, pp. 399\u2013424. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-56617-7_14"},{"key":"13_CR37","doi-asserted-by":"crossref","unstructured":"Wang, X., Ranellucci, S., Katz, J.: Authenticated garbling and efficient maliciously secure two-party computation. In: ACM CCS 2017, pp. 21\u201337. ACM Press (2017)","DOI":"10.1145\/3133956.3134053"},{"key":"13_CR38","doi-asserted-by":"crossref","unstructured":"Wang, X., Ranellucci, S., Katz, J.: Global-scale secure multiparty computation. In: ACM CCS 2017, pp. 39\u201356. ACM Press (2017)","DOI":"10.1145\/3133956.3133979"},{"key":"13_CR39","doi-asserted-by":"crossref","unstructured":"Yao, A.C.C.: How to generate and exchange secrets (extended abstract). In: 27th FOCS, Toronto, Ontario, Canada, 27\u201329 October 1986, pp. 162\u2013167. IEEE Computer Society Press (1986)","DOI":"10.1109\/SFCS.1986.25"},{"key":"13_CR40","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, Part II. LNCS, vol. 9057, pp. 220\u2013250. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46803-6_8"},{"key":"13_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1007\/978-3-319-70697-9_19","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2017","author":"R Zhu","year":"2017","unstructured":"Zhu, R., Huang, Y.: JIMU: faster LEGO-based secure computation using additive homomorphic hashes. In: Takagi, T., Peyrin, T. (eds.) ASIACRYPT 2017, Part II. LNCS, vol. 10625, pp. 529\u2013572. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70697-9_19"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2018"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-96878-0_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,5]],"date-time":"2025-07-05T19:34:42Z","timestamp":1751744082000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-96878-0_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319968773","9783319968780"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-96878-0_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"24 July 2018","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":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 August 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 August 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"38","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"crypto2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2018\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}