{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,30]],"date-time":"2026-01-30T15:39:20Z","timestamp":1769787560248,"version":"3.49.0"},"publisher-location":"Cham","reference-count":52,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319783710","type":"print"},{"value":"9783319783727","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.springernature.com\/gp\/researchers\/text-and-data-mining"},{"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.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-78372-7_20","type":"book-chapter","created":{"date-parts":[[2018,3,30]],"date-time":"2018-03-30T06:13:04Z","timestamp":1522390384000},"page":"618-650","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":22,"title":["Non-malleable Codes from Average-Case Hardness: $${\\mathsf {A}}{\\mathsf {C}}^0$$, Decision Trees, and Streaming Space-Bounded Tampering"],"prefix":"10.1007","author":[{"given":"Marshall","family":"Ball","sequence":"first","affiliation":[]},{"given":"Dana","family":"Dachman-Soled","sequence":"additional","affiliation":[]},{"given":"Mukul","family":"Kulkarni","sequence":"additional","affiliation":[]},{"given":"Tal","family":"Malkin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,3,31]]},"reference":[{"key":"20_CR1","doi-asserted-by":"crossref","unstructured":"Aggarwal, D., Agrawal, S., Gupta, D., Maji, H.K., Pandey, O., Prabhakaran, M.: Optimal computational split-state non-malleable codes. In: [43], pp. 393\u2013417","DOI":"10.1007\/978-3-662-49099-0_15"},{"key":"20_CR2","doi-asserted-by":"crossref","unstructured":"Aggarwal, D., Dodis, Y., Kazana, T., Obremski, M.: Non-malleable reductions and applications. In: Servedio, R.A., Rubinfeld, R. (eds.) 47th ACM STOC, pp. 459\u2013468. ACM Press, June 2015","DOI":"10.1145\/2746539.2746544"},{"key":"20_CR3","doi-asserted-by":"crossref","unstructured":"Aggarwal, D., Dodis, Y., Lovett, S.: Non-malleable codes from additive combinatorics. In: Shmoys, D.B. (ed.) 46th ACM STOC, pp. 774\u2013783. ACM Press, May\/June 2014","DOI":"10.1145\/2591796.2591804"},{"key":"20_CR4","doi-asserted-by":"crossref","unstructured":"Aggarwal, D., Dziembowski, S., Kazana, T., Obremski, M.: Leakage-resilient non-malleable codes. In: [27], pp. 398\u2013426","DOI":"10.1007\/978-3-662-46494-6_17"},{"key":"20_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1007\/978-3-662-47989-6_26","volume-title":"Advances in Cryptology \u2013 CRYPTO 2015","author":"S Agrawal","year":"2015","unstructured":"Agrawal, S., Gupta, D., Maji, H.K., Pandey, O., Prabhakaran, M.: Explicit non-malleable codes against bit-wise tampering and permutations. In: Gennaro, R., Robshaw, M. (eds.) CRYPTO 2015, Part I. LNCS, vol. 9215, pp. 538\u2013557. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-47989-6_26"},{"key":"20_CR6","doi-asserted-by":"crossref","unstructured":"Agrawal, S., Gupta, D., Maji, H.K., Pandey, O., Prabhakaran, M.: A rate-optimizing compiler for non-malleable codes against bit-wise tampering and permutations. In: [27], pp. 375\u2013397","DOI":"10.1007\/978-3-662-46494-6_16"},{"key":"20_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"881","DOI":"10.1007\/978-3-662-49896-5_31","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2016","author":"M Ball","year":"2016","unstructured":"Ball, M., Dachman-Soled, D., Kulkarni, M., Malkin, T.: Non-malleable codes for bounded depth, bounded fan-in circuits. In: Fischlin, M., Coron, J.-S. (eds.) EUROCRYPT 2016, Part II. LNCS, vol. 9666, pp. 881\u2013908. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49896-5_31"},{"key":"20_CR8","unstructured":"Ball, M., Dachman-Soled, D., Kulkarni, M., Malkin, T.: Non-malleable codes from average-case hardness: AC0, decision trees, and streaming space-bounded tampering. Cryptology ePrint Archive, Report 2017\/1061 (2017). http:\/\/eprint.iacr.org\/2017\/1061"},{"key":"20_CR9","doi-asserted-by":"crossref","unstructured":"Bogdanov, A., Lee, C.H.: Homomorphic evaluation requires depth. In: [42], pp. 365\u2013371","DOI":"10.1007\/978-3-662-49096-9_15"},{"key":"20_CR10","doi-asserted-by":"crossref","unstructured":"Chabanne, H., Cohen, G.D., Flori, J., Patey, A.: Non-malleable codes from the wire-tap channel. CoRR abs\/1105.3879 (2011)","DOI":"10.1109\/ITW.2011.6089565"},{"key":"20_CR11","unstructured":"Chandran, N., Goyal, V., Mukherjee, P., Pandey, O., Upadhyay, J.: Block-wise non-malleable codes. Cryptology ePrint Archive, Report 2015\/129 (2015). http:\/\/eprint.iacr.org\/2015\/129"},{"key":"20_CR12","unstructured":"Chandran, N., Goyal, V., Mukherjee, P., Pandey, O., Upadhyay, J.: Block-wise non-malleable codes. In: Chatzigiannakis, I., Mitzenmacher, M., Rabani, Y., Sangiorgi, D. (eds.) ICALP 2016. LIPIcs, vol. 55, pp. 31:1\u201331:14. Schloss Dagstuhl, July 2016"},{"key":"20_CR13","doi-asserted-by":"crossref","unstructured":"Chandran, N., Kanukurthi, B., Ostrovsky, R.: Locally updatable and locally decodable codes. In: [46], pp. 489\u2013514","DOI":"10.1007\/978-3-642-54242-8_21"},{"key":"20_CR14","doi-asserted-by":"crossref","unstructured":"Chandran, N., Kanukurthi, B., Raghuraman, S.: Information-theoretic local non-malleable codes and their applications. In: [43], pp. 367\u2013392","DOI":"10.1007\/978-3-662-49099-0_14"},{"key":"20_CR15","doi-asserted-by":"crossref","unstructured":"Chattopadhyay, E., Goyal, V., Li, X.: Non-malleable extractors and codes, with their many tampered extensions. In: [52], pp. 285\u2013298","DOI":"10.1145\/2897518.2897547"},{"key":"20_CR16","doi-asserted-by":"crossref","unstructured":"Chattopadhyay, E., Li, X.: Non-malleable codes and extractors for small-depth circuits, and affine functions. In: Hatami, H., McKenzie, P., King, V. (eds.) 49th ACM STOC, pp. 1171\u20131184. ACM Press, June 2017","DOI":"10.1145\/3055399.3055483"},{"key":"20_CR17","doi-asserted-by":"crossref","unstructured":"Chattopadhyay, E., Zuckerman, D.: Non-malleable codes against constant split-state tampering. In: 55th FOCS, pp. 306\u2013315. IEEE Computer Society Press, October 2014","DOI":"10.1109\/FOCS.2014.40"},{"key":"20_CR18","doi-asserted-by":"crossref","unstructured":"Chattopadhyay, E., Zuckerman, D.: Explicit two-source extractors and resilient functions. In: [52], pp. 670\u2013683","DOI":"10.1145\/2897518.2897528"},{"key":"20_CR19","doi-asserted-by":"crossref","unstructured":"Cheraghchi, M., Guruswami, V.: Capacity of non-malleable codes. In: Naor, M. (ed.) ITCS 2014, pp. 155\u2013168. ACM, January 2014","DOI":"10.1145\/2554797.2554814"},{"key":"20_CR20","doi-asserted-by":"crossref","unstructured":"Cheraghchi, M., Guruswami, V.: Non-malleable coding against bit-wise and split-state tampering. In: [46], pp. 440\u2013464","DOI":"10.1007\/978-3-642-54242-8_19"},{"key":"20_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"740","DOI":"10.1007\/978-3-642-25385-0_40","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2011","author":"SG Choi","year":"2011","unstructured":"Choi, S.G., Kiayias, A., Malkin, T.: BiTR: built-in tamper resilience. In: Lee, D.H., Wang, X. (eds.) ASIACRYPT 2011. LNCS, vol. 7073, pp. 740\u2013758. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25385-0_40"},{"key":"20_CR22","doi-asserted-by":"crossref","unstructured":"Coretti, S., Dodis, Y., Tackmann, B., Venturi, D.: Non-malleable encryption: simpler, shorter, stronger. In: [42], pp. 306\u2013335","DOI":"10.1007\/978-3-662-49096-9_13"},{"key":"20_CR23","doi-asserted-by":"crossref","unstructured":"Coretti, S., Maurer, U., Tackmann, B., Venturi, D.: From single-bit to multi-bit public-key encryption via non-malleable codes. In: [27], pp. 532\u2013560","DOI":"10.1007\/978-3-662-46494-6_22"},{"key":"20_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1007\/978-3-662-54365-8_13","volume-title":"Public-Key Cryptography \u2013 PKC 2017","author":"D Dachman-Soled","year":"2017","unstructured":"Dachman-Soled, D., Kulkarni, M., Shahverdi, A.: Tight upper and lower bounds for leakage-resilient, locally decodable and updatable non-malleable codes. In: Fehr, S. (ed.) PKC 2017, Part I. LNCS, vol. 10174, pp. 310\u2013332. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-662-54365-8_13"},{"key":"20_CR25","doi-asserted-by":"crossref","unstructured":"Dachman-Soled, D., Liu, F.H., Shi, E., Zhou, H.S.: Locally decodable and updatable non-malleable codes and their applications. In: [27], pp. 427\u2013450","DOI":"10.1007\/978-3-662-46494-6_18"},{"key":"20_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.4086\/toc.gs.2008.001","volume":"1","author":"R De Wolf","year":"2008","unstructured":"De Wolf, R.: A brief introduction to fourier analysis on the boolean cube. Theory Comput. Grad. Surv. 1, 1\u201320 (2008)","journal-title":"Theory Comput. Grad. Surv."},{"key":"20_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-46494-6","volume-title":"Theory of Cryptography","year":"2015","unstructured":"Dodis, Y., Nielsen, J.B. (eds.): TCC 2015, Part I. LNCS, vol. 9014. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46494-6"},{"key":"20_CR28","unstructured":"D\u00f6ttling, N., Nielsen, J.B., Obremski, M.: Information theoretic continuously non-malleable codes in the constant split-state model. Cryptology ePrint Archive, Report 2017\/357 (2017). http:\/\/eprint.iacr.org\/2017\/357"},{"key":"20_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1007\/978-3-540-24676-3_21","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"C Dwork","year":"2004","unstructured":"Dwork, C., Naor, M., Reingold, O.: Immunizing encryption schemes from decryption errors. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 342\u2013360. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24676-3_21"},{"key":"20_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/978-3-642-40084-1_14","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"S Dziembowski","year":"2013","unstructured":"Dziembowski, S., Kazana, T., Obremski, M.: Non-malleable codes from two-source extractors. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013, Part II. LNCS, vol. 8043, pp. 239\u2013257. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40084-1_14"},{"key":"20_CR31","unstructured":"Dziembowski, S., Pietrzak, K., Wichs, D.: Non-malleable codes. In: Yao, A.C.C. (ed.) ICS 2010, pp. 434\u2013452. Tsinghua University Press, January 2010"},{"key":"20_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/978-3-319-63715-0_4","volume-title":"Advances in Cryptology \u2013 CRYPTO 2017","author":"S Faust","year":"2017","unstructured":"Faust, S., Host\u00e1kov\u00e1, K., Mukherjee, P., Venturi, D.: Non-malleable codes for space-bounded tampering. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017, Part II. LNCS, vol. 10402, pp. 95\u2013126. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63715-0_4"},{"key":"20_CR33","doi-asserted-by":"crossref","unstructured":"Faust, S., Mukherjee, P., Nielsen, J.B., Venturi, D.: Continuous non-malleable codes. In: [46], pp. 465\u2013488","DOI":"10.1007\/978-3-642-54242-8_20"},{"key":"20_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1007\/978-3-662-46447-2_26","volume-title":"Public-Key Cryptography \u2013 PKC 2015","author":"S Faust","year":"2015","unstructured":"Faust, S., Mukherjee, P., Nielsen, J.B., Venturi, D.: A tamper and leakage resilient von Neumann architecture. In: Katz, J. (ed.) PKC 2015. LNCS, vol. 9020, pp. 579\u2013603. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46447-2_26"},{"key":"20_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/978-3-642-55220-5_7","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2014","author":"S Faust","year":"2014","unstructured":"Faust, S., Mukherjee, P., Venturi, D., Wichs, D.: Efficient non-malleable codes and key-derivation for poly-size tampering circuits. In: Nguyen, P.Q., Oswald, E. (eds.) EUROCRYPT 2014. LNCS, vol. 8441, pp. 111\u2013128. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-55220-5_7"},{"key":"20_CR36","doi-asserted-by":"crossref","unstructured":"Goyal, V., Pandey, O., Richelson, S.: Textbook non-malleable commitments. In: [52], pp. 1128\u20131141","DOI":"10.1145\/2897518.2897657"},{"key":"20_CR37","doi-asserted-by":"crossref","unstructured":"Jafargholi, Z., Wichs, D.: Tamper detection and continuous non-malleable codes. In: [27], pp. 451\u2013480","DOI":"10.1007\/978-3-662-46494-6_19"},{"key":"20_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/978-3-642-22792-9_21","volume-title":"Advances in Cryptology \u2013 CRYPTO 2011","author":"YT Kalai","year":"2011","unstructured":"Kalai, Y.T., Kanukurthi, B., Sahai, A.: Cryptography with tamperable and leaky memory. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol. 6841, pp. 373\u2013390. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22792-9_21"},{"key":"20_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1007\/978-3-319-70503-3_11","volume-title":"Theory of Cryptography","author":"B Kanukurthi","year":"2017","unstructured":"Kanukurthi, B., Obbattu, S.L.B., Sekar, S.: Four-state non-malleable codes with explicit constant rate. In: Kalai, Y., Reyzin, L. (eds.) TCC 2017, Part II. LNCS, vol. 10678, pp. 344\u2013375. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70503-3_11"},{"key":"20_CR40","unstructured":"Kanukurthi, B., Obbattu, S.L.B., Sekar, S.: Non-malleable randomness encoders and their applications. Cryptology ePrint Archive, Report 2017\/1097 (2017). https:\/\/eprint.iacr.org\/2017\/1097"},{"key":"20_CR41","doi-asserted-by":"crossref","unstructured":"Kiayias, A., Liu, F.H., Tselekounis, Y.: Practical non-malleable codes from l-more extractable hash functions. In: Weippl, E.R., Katzenbeisser, S., Kruegel, C., Myers, A.C., Halevi, S. (eds.) ACM CCS 2016, pp. 1317\u20131328. ACM Press, October 2016","DOI":"10.1145\/2976749.2978352"},{"key":"20_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49096-9","volume-title":"Theory of Cryptography","year":"2016","unstructured":"Kushilevitz, E., Malkin, T. (eds.): TCC 2016, Part I. LNCS, vol. 9562. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49096-9"},{"key":"20_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49099-0","volume-title":"Theory of Cryptography","year":"2016","unstructured":"Kushilevitz, E., Malkin, T. (eds.): TCC 2016, Part II. LNCS, vol. 9563. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49099-0"},{"key":"20_CR44","doi-asserted-by":"crossref","unstructured":"Li, X.: Improved two-source extractors, and affine extractors for polylogarithmic entropy. In: Dinur, I. (ed.) 57th FOCS, pp. 168\u2013177. IEEE Computer Society Press, October 2016","DOI":"10.1109\/FOCS.2016.26"},{"key":"20_CR45","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/3-540-39200-9_15","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2003","author":"Y Lindell","year":"2003","unstructured":"Lindell, Y.: A simpler construction of CCA2-secure public-key encryption under general assumptions. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol. 2656, pp. 241\u2013254. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-39200-9_15"},{"key":"20_CR46","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-54242-8","volume-title":"Theory of Cryptography","year":"2014","unstructured":"Lindell, Y. (ed.): TCC 2014. LNCS, vol. 8349. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-54242-8"},{"key":"20_CR47","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1007\/978-3-642-32009-5_30","volume-title":"Advances in Cryptology \u2013 CRYPTO 2012","author":"F-H Liu","year":"2012","unstructured":"Liu, F.-H., Lysyanskaya, A.: Tamper and leakage resilience in the split-state model. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 517\u2013532. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32009-5_30"},{"key":"20_CR48","doi-asserted-by":"crossref","unstructured":"Naor, M., Yung, M.: Public-key cryptosystems provably secure against chosen ciphertext attacks. In: 22nd ACM STOC, pp. 427\u2013437. ACM Press, May 1990","DOI":"10.1145\/100216.100273"},{"key":"20_CR49","doi-asserted-by":"crossref","unstructured":"Raz, R.: Fast learning requires good memory: A time-space lower bound for parity learning. CoRR abs\/1602.05161 (2016)","DOI":"10.1109\/FOCS.2016.36"},{"key":"20_CR50","doi-asserted-by":"crossref","unstructured":"Sahai, A.: Non-malleable non-interactive zero knowledge and adaptive chosen-ciphertext security. In: 40th FOCS, pp. 543\u2013553. IEEE Computer Society Press, October 1999","DOI":"10.1109\/SFFCS.1999.814628"},{"key":"20_CR51","unstructured":"Tal, A.: Tight bounds on the fourier spectrum of AC0. In: O\u2019Donnell, R. (ed.) 32nd Computational Complexity Conference, CCC 2017, Riga, Latvia, 6\u20139 July 2017. LIPIcs, vol. 79, pp. 15:1\u201315:31. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2017)"},{"key":"20_CR52","unstructured":"Wichs, D., Mansour, Y. (eds.): 48th ACM STOC. ACM Press, June 2016"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2018"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-78372-7_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,3]],"date-time":"2025-07-03T04:02:17Z","timestamp":1751515337000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-78372-7_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319783710","9783319783727"],"references-count":52,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-78372-7_20","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":"31 March 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EUROCRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Conference on the Theory and Applications of Cryptographic Techniques","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tel Aviv","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Israel","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":"29 April 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 May 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"37","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eurocrypt2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/eurocrypt.iacr.org\/2018\/index.html","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"}]}}