{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,27]],"date-time":"2026-04-27T11:02:13Z","timestamp":1777287733617,"version":"3.51.4"},"publisher-location":"Cham","reference-count":61,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030643805","type":"print"},{"value":"9783030643812","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[[2020]]},"DOI":"10.1007\/978-3-030-64381-2_21","type":"book-chapter","created":{"date-parts":[[2020,12,12]],"date-time":"2020-12-12T18:04:25Z","timestamp":1607796265000},"page":"584-613","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Non-malleable Codes, Extractors and Secret Sharing for Interleaved Tampering and Composition of Tampering"],"prefix":"10.1007","author":[{"given":"Eshan","family":"Chattopadhyay","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xin","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,12,9]]},"reference":[{"issue":"2","key":"21_CR1","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1016\/j.ipl.2014.10.015","volume":"115","author":"D Aggarwal","year":"2015","unstructured":"Aggarwal, D.: Affine-evasive sets modulo a prime. Inf. Process. Lett. 115(2), 382\u2013385 (2015)","journal-title":"Inf. Process. Lett."},{"key":"21_CR2","doi-asserted-by":"crossref","unstructured":"Aggarwal, D., Bri\u00ebt, J.: Revisiting the sanders-Bogolyubov-Ruzsa theorem in Fpn and its application to non-malleable codes. In: 2016 IEEE International Symposium on Information Theory (ISIT), pp. 1322\u20131326. IEEE (2016)","DOI":"10.1109\/ISIT.2016.7541513"},{"key":"21_CR3","first-page":"1147","volume":"2018","author":"D Aggarwal","year":"2018","unstructured":"Aggarwal, D., et al.: Stronger leakage-resilient and non-malleable secret-sharing schemes for general access structures. IACR Crypt. ePrint Arch. 2018, 1147 (2018)","journal-title":"IACR Crypt. ePrint Arch."},{"key":"21_CR4","doi-asserted-by":"crossref","unstructured":"Aggarwal, D., Dodis, Y., Kazana, T., Obremski, M.: Non-malleable reductions and applications. In: Proceedings of the Forty-Seventh Annual ACM Symposium on Theory of Computing, pp. 459\u2013468. ACM (2015)","DOI":"10.1145\/2746539.2746544"},{"issue":"2","key":"21_CR5","doi-asserted-by":"publisher","first-page":"524","DOI":"10.1137\/140985251","volume":"47","author":"D Aggarwal","year":"2018","unstructured":"Aggarwal, D., Dodis, Y., Lovett, S.: Non-malleable codes from additive combinatorics. SIAM J. Comput. 47(2), 524\u2013546 (2018)","journal-title":"SIAM J. Comput."},{"key":"21_CR6","doi-asserted-by":"crossref","unstructured":"Aggarwal, D., Dziembowski, S., Kazana, T., Obremski, M.: Leakage resilient non-malleable codes. In: Theory of Cryptography Conference, TCC 2015, pp. 398\u2013426 (2015)","DOI":"10.1007\/978-3-662-46494-6_17"},{"key":"21_CR7","first-page":"1299","volume":"2019","author":"D Aggarwal","year":"2019","unstructured":"Aggarwal, D., Obremski, M.: A constant-rate non-malleable code in the split-state model. IACR Crypt. ePrint Arch. 2019, 1299 (2019)","journal-title":"IACR Crypt. ePrint Arch."},{"key":"21_CR8","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: Theory of Cryptography - 12th Theory of Cryptography Conference, TCC 2015, Warsaw, Poland, 23\u201325 March 2015, Proceedings, Part I, pp. 375\u2013397 (2015)","DOI":"10.1007\/978-3-662-46494-6_16"},{"key":"21_CR9","first-page":"1144","volume":"2018","author":"S Badrinarayanan","year":"2018","unstructured":"Badrinarayanan, S., Srinivasan, A.: Revisiting non-malleable secret sharing. IACR Crypt. ePrint Arch. 2018, 1144 (2018)","journal-title":"IACR Crypt. ePrint Arch."},{"key":"21_CR10","doi-asserted-by":"crossref","unstructured":"Ball, M., Chattopadhyay, E., Liao, J.J., Malkin, T., Tan, L.Y.: Non-malleability against polynomial tampering. In: Crypto (2020), to appear","DOI":"10.1007\/978-3-030-56877-1_4"},{"key":"21_CR11","doi-asserted-by":"crossref","unstructured":"Ball, M., Dachman-Soled, D., Guo, S., Malkin, T., Tan, L.Y.: Non-malleable codes for small-depth circuits. In: 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS) pp. 826\u2013837. IEEE (2018)","DOI":"10.1109\/FOCS.2018.00083"},{"key":"21_CR12","doi-asserted-by":"crossref","unstructured":"Ball, M., Dachman-Soled, D., Kulkarni, M., Malkin, T.: Non-malleable codes for bounded depth, bounded fan-in circuits. In: TCC (2016)","DOI":"10.1007\/978-3-662-49896-5_31"},{"key":"21_CR13","first-page":"379","volume":"2019","author":"M Ball","year":"2019","unstructured":"Ball, M., Guo, S., Wichs, D.: Non-malleable codes for decision trees. IACR Crypt. ePrint Arch. 2019, 379 (2019)","journal-title":"IACR Crypt. ePrint Arch."},{"key":"21_CR14","doi-asserted-by":"crossref","unstructured":"Blakley, G.R.: Safeguarding cryptographic keys. In: Proceedings of the 1979 AFIPS National Computer Conference, pp. 313\u2013317 (1979)","DOI":"10.1109\/MARK.1979.8817296"},{"key":"21_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1007\/978-3-662-53015-3_21","volume-title":"Advances in Cryptology \u2013 CRYPTO 2016","author":"A Bogdanov","year":"2016","unstructured":"Bogdanov, A., Ishai, Y., Viola, E., \u00a0Williamson, C.: Bounded indistinguishability and the complexity of recovering secrets. In: Robshaw, M., Katz, J. (eds.) CRYPTO 2016. LNCS, vol. 9816, pp. 593\u2013618. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53015-3_21"},{"key":"21_CR16","unstructured":"Bogdanov, A., Williamson, C.: Approximate bounded indistinguishability. In: International Colloquium on Automata, Languages, and Programming (2017)"},{"key":"21_CR17","doi-asserted-by":"crossref","unstructured":"Carpentieri, M., Santis, A.D., Vaccaro, U.: Size of shares and probability of cheating in threshold schemes. In: EUROCRYPT 1993, 12th Annual International Conference on the Theory and Applications of Cryptographic Techniques (1993)","DOI":"10.1007\/3-540-48285-7_10"},{"key":"21_CR18","doi-asserted-by":"crossref","unstructured":"Chattopadhyay, E., Goyal, V., Li, X.: Non-malleable extractors and codes, with their many tampered extensions. In: STOC (2016)","DOI":"10.1145\/2897518.2897547"},{"key":"21_CR19","first-page":"293","volume":"2018","author":"E Chattopadhyay","year":"2018","unstructured":"Chattopadhyay, E., Kanukurthi, B., Obbattu, S.L.B., Sekar, S.: Privacy amplification from non-malleable codes. IACR Crypt. ePrint Arch. 2018, 293 (2018)","journal-title":"IACR Crypt. ePrint Arch."},{"key":"21_CR20","doi-asserted-by":"crossref","unstructured":"Chattopadhyay, E., Li, X.: Extractors for sumset sources. In: STOC (2016)","DOI":"10.1145\/2897518.2897643"},{"key":"21_CR21","doi-asserted-by":"crossref","unstructured":"Chattopadhyay, E., Li, X.: Non-malleable codes and extractors for small-depth circuits, and affine functions. In: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing pp. 1171\u20131184. ACM (2017)","DOI":"10.1145\/3055399.3055483"},{"key":"21_CR22","doi-asserted-by":"crossref","unstructured":"Chattopadhyay, E., Zuckerman, D.: Non-malleable codes against constant split-state tampering. In: Proceedings of the 55th Annual IEEE Symposium on Foundations of Computer Science, pp. 306\u2013315 (2014)","DOI":"10.1109\/FOCS.2014.40"},{"key":"21_CR23","doi-asserted-by":"crossref","unstructured":"Chattopadhyay, E., Zuckerman, D.: Explicit two-source extractors and resilient functions. In: STOC (2016)","DOI":"10.1145\/2897518.2897528"},{"key":"21_CR24","unstructured":"Chattopadhyay, E., Zuckerman, D.: New extractors for interleaved sources. In: CCC (2016)"},{"key":"21_CR25","doi-asserted-by":"crossref","unstructured":"Cheng, K., Ishai, Y., Li, X.: Near-optimal secret sharing and error correcting codes in AC0. In: TCC, pp. 424\u2013458 (2017)","DOI":"10.1007\/978-3-319-70503-3_14"},{"issue":"3","key":"21_CR26","doi-asserted-by":"publisher","first-page":"1097","DOI":"10.1109\/TIT.2015.2511784","volume":"62","author":"M Cheraghchi","year":"2016","unstructured":"Cheraghchi, M., Guruswami, V.: Capacity of non-malleable codes. IEEE Trans. Inf. Theor. 62(3), 1097\u20131118 (2016). https:\/\/doi.org\/10.1109\/TIT.2015.2511784","journal-title":"IEEE Trans. Inf. Theor."},{"issue":"1","key":"21_CR27","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/s00145-015-9219-z","volume":"30","author":"M Cheraghchi","year":"2017","unstructured":"Cheraghchi, M., Guruswami, V.: Non-malleable coding against bit-wise and split-state tampering. J. Crypt. 30(1), 191\u2013241 (2017)","journal-title":"J. Crypt."},{"issue":"2","key":"21_CR28","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1137\/0217015","volume":"17","author":"B Chor","year":"1988","unstructured":"Chor, B., Goldreich, O.: Unbiased bits from sources of weak randomness and probabilistic communication complexity. SIAM J. Comput. 17(2), 230\u2013261 (1988)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"21_CR29","doi-asserted-by":"publisher","first-page":"1297","DOI":"10.1137\/15M1029837","volume":"45","author":"G Cohen","year":"2016","unstructured":"Cohen, G.: Local correlation breakers and applications to three-source extractors and mergers. SIAM J. Comput. 45(4), 1297\u20131338 (2016)","journal-title":"SIAM J. Comput."},{"key":"21_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1007\/978-3-662-49096-9_13","volume-title":"Theory of Cryptography","author":"S Coretti","year":"2016","unstructured":"Coretti, S., Dodis, Y., Tackmann, B., Venturi, D.: Non-malleable encryption: simpler, shorter, stronger. In: Kushilevitz, E., Malkin, T. (eds.) TCC 2016. LNCS, vol. 9562, pp. 306\u2013335. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49096-9_13"},{"key":"21_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"532","DOI":"10.1007\/978-3-662-46494-6_22","volume-title":"Theory of Cryptography","author":"S Coretti","year":"2015","unstructured":"Coretti, S., Maurer, U., Tackmann, B., Venturi, D.: From single-bit to multi-bit public-key encryption via non-malleable codes. In: Dodis, Y., Nielsen, J.B. (eds.) TCC 2015. LNCS, vol. 9014, pp. 532\u2013560. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46494-6_22"},{"key":"21_CR32","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1137\/060651380","volume":"38","author":"Y Dodis","year":"2008","unstructured":"Dodis, Y., Ostrovsky, R., Reyzin, L., Smith, A.: Fuzzy extractors: how to generate strong keys from biometrics and other noisy data. SIAM J. Comput. 38, 97\u2013139 (2008)","journal-title":"SIAM J. Comput."},{"key":"21_CR33","doi-asserted-by":"crossref","unstructured":"Dodis, Y., Wichs, D.: Non-malleable extractors and symmetric key cryptography from weak secrets. In: STOC, pp. 601\u2013610 (2009)","DOI":"10.1145\/1536414.1536496"},{"key":"21_CR34","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. LNCS, vol. 8043, pp. 239\u2013257. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40084-1_14"},{"key":"21_CR35","doi-asserted-by":"publisher","unstructured":"Dziembowski, S., Pietrzak, K.: Intrusion-resilient secret sharing. In: Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2007, pp. 227\u2013237. IEEE Computer Society, Washington, DC, USA (2007). https:\/\/doi.org\/10.1109\/FOCS.2007.35","DOI":"10.1109\/FOCS.2007.35"},{"key":"21_CR36","doi-asserted-by":"publisher","unstructured":"Dziembowski, S., Pietrzak, K., Wichs, D.: Non-malleable codes. J. ACM 65(4), 20:1\u201320:32 (2018). https:\/\/doi.org\/10.1145\/3178432","DOI":"10.1145\/3178432"},{"key":"21_CR37","doi-asserted-by":"crossref","unstructured":"Goyal, V., Ishai, Y., Maji, H.K., Sahai, A., Sherstov, A.A.: Bounded-communication leakage resilience via parity-resilient circuits. In: Proceedings of the 57th Annual IEEE Symposium on Foundations of Computer Science (2016)","DOI":"10.1109\/FOCS.2016.10"},{"key":"21_CR38","doi-asserted-by":"crossref","unstructured":"Goyal, V., Kumar, A.: Non-malleable secret sharing. In: Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, pp. 685\u2013698. ACM (2018)","DOI":"10.1145\/3188745.3188872"},{"key":"21_CR39","doi-asserted-by":"crossref","unstructured":"Goyal, V., Kumar, A.: Non-malleable secret sharing for general access structures. In: Advances in Cryptology - CRYPTO 2018\u201338th Annual International Cryptology Conference, Santa Barbara, CA, USA, 19\u201323 August 2018, Proceedings, Part I, pp. 501\u2013530 (2018)","DOI":"10.1007\/978-3-319-96884-1_17"},{"key":"21_CR40","doi-asserted-by":"crossref","unstructured":"Goyal, V., Pandey, O., Richelson, S.: Textbook non-malleable commitments. In: Proceedings of the forty-eighth annual ACM symposium on Theory of Computing pp. 1128\u20131141. ACM (2016)","DOI":"10.1145\/2897518.2897657"},{"key":"21_CR41","unstructured":"Gupta, D., Maji, H.K., Wang, M.: Constant-rate non-malleable codes in the split-state model. Technical Report Report 2017\/1048, Cryptology ePrint Archive (2018)"},{"key":"21_CR42","doi-asserted-by":"crossref","unstructured":"Guruswami, V., Umans, C., Vadhan, S.P.: Unbalanced expanders and randomness extractors from Parvaresh-Vardy codes. J. ACM 56(4) (2009)","DOI":"10.1145\/1538902.1538904"},{"key":"21_CR43","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. LNCS, vol. 10678, pp. 344\u2013375. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70503-3_11"},{"key":"21_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1007\/978-3-319-78372-7_19","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2018","author":"B Kanukurthi","year":"2018","unstructured":"Kanukurthi, B., Obbattu, S.L.B., Sekar, S.: Non-malleable randomness encoders and\u00a0their applications. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018. LNCS, vol. 10822, pp. 589\u2013617. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78372-7_19"},{"key":"21_CR45","doi-asserted-by":"crossref","unstructured":"Li, X.: Improved two-source extractors, and affine extractors for polylogarithmic entropy. In: 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS), pp. 168\u2013177. IEEE (2016)","DOI":"10.1109\/FOCS.2016.26"},{"key":"21_CR46","doi-asserted-by":"crossref","unstructured":"Li, X.: Improved non-malleable extractors, non-malleable codes and independent source extractors. In: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2017, pp. 1144\u20131156 (2017)","DOI":"10.1145\/3055399.3055486"},{"key":"21_CR47","unstructured":"Li, X.: Non-malleable extractors and non-malleable codes: Partially optimal constructions. In: Electronic Colloquium on Computational Complexity (ECCC) (2018)"},{"key":"21_CR48","unstructured":"Lin, F., Cheraghchi, M., Guruswami, V., Safavi-Naini, R., Wang, H.: Secret sharing with binary shares. CoRR arXiv:cs\/1808.02974 (2018)"},{"key":"21_CR49","unstructured":"Lin, F., Cheraghchi, M., Guruswami, V., Safavi-Naini, R., Wang, H.: Non-malleable secret sharing against affine tampering. CoRR arXiv:cs\/1902.06195 (2019)"},{"key":"21_CR50","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/BFb0052244","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201997","author":"U Maurer","year":"1997","unstructured":"Maurer, U., Wolf, S.: Privacy amplification secure against active adversaries. In: Kaliski, B.S. (ed.) CRYPTO 1997. LNCS, vol. 1294, pp. 307\u2013321. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/BFb0052244"},{"key":"21_CR51","doi-asserted-by":"crossref","unstructured":"Rabin, T., Ben-Or, M.: Verifiable secret sharing and multiparty protocols with honest majority (extended abstract). In: Proceedings of the 21st Annual ACM Symposium on Theory of Computing, pp. 73\u201385 (1989)","DOI":"10.1145\/73007.73014"},{"key":"21_CR52","unstructured":"Rao, A.: An exposition of Bourgain\u2019s 2-source extractor. In: Electronic Colloquium on Computational Complexity (ECCC) 14(034) (2007)"},{"key":"21_CR53","doi-asserted-by":"crossref","unstructured":"Rao, A.: Extractors for low-weight affine sources. In: Proceedings of the 24th Annual IEEE Conference on Computational Complexity (2009)","DOI":"10.1109\/CCC.2009.36"},{"key":"21_CR54","unstructured":"Rasmussen, P.M.R., Sahai, A.: Expander graphs are non-malleable codes. CoRR (2018). https:\/\/arxiv.org\/abs\/1810.00106"},{"key":"21_CR55","doi-asserted-by":"crossref","unstructured":"Raz, R.: Extractors with weak random seeds. In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing, pp. 11\u201320 (2005)","DOI":"10.1145\/1060590.1060593"},{"issue":"1","key":"21_CR56","first-page":"97","volume":"65","author":"R Raz","year":"2002","unstructured":"Raz, R., Reingold, O., Vadhan, S.: Extracting all the randomness and reducing the error in Trevisan\u2019s extractors. JCSS 65(1), 97\u2013128 (2002)","journal-title":"JCSS"},{"key":"21_CR57","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/j.jcss.2010.06.013","volume":"77","author":"R Raz","year":"2011","unstructured":"Raz, R., Yehudayoff, A.: Multilinear formulas, maximal-partition discrepancy and mixed-sources extractors. J. Comput. Syst. Sci. 77, 167\u2013190 (2011). https:\/\/doi.org\/10.1016\/j.jcss.2010.06.013","journal-title":"J. Comput. Syst. Sci."},{"issue":"11","key":"21_CR58","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A Shamir","year":"1979","unstructured":"Shamir, A.: How to share a secret. Commun. ACM 22(11), 612\u2013613 (1979)","journal-title":"Commun. ACM"},{"key":"21_CR59","doi-asserted-by":"crossref","unstructured":"Trevisan, L.: Extractors and pseudorandom generators. J. ACM 48, 860\u2013879 (2001)","DOI":"10.1145\/502090.502099"},{"key":"21_CR60","doi-asserted-by":"publisher","unstructured":"Trevisan, L., Vadhan, S.P.: Extracting randomness from samplable distributions. In: IEEE Symposium on Foundations of Computer Science, pp. 32\u201342 (2000). https:\/\/doi.org\/10.1109\/SFCS.2000.892063","DOI":"10.1109\/SFCS.2000.892063"},{"key":"21_CR61","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1002\/(SICI)1098-2418(199712)11:4<345::AID-RSA4>3.0.CO;2-Z","volume":"11","author":"D Zuckerman","year":"1997","unstructured":"Zuckerman, D.: Randomness-optimal oblivious sampling. Random Struct. Algorithms 11, 345\u2013367 (1997)","journal-title":"Random Struct. Algorithms"}],"container-title":["Lecture Notes in Computer Science","Theory of Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-64381-2_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,19]],"date-time":"2024-08-19T00:06:42Z","timestamp":1724026002000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-64381-2_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030643805","9783030643812"],"references-count":61,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-64381-2_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"9 December 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TCC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Theory of Cryptography Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 November 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 November 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tcc2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tcc.iacr.org\/2020\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"websubrev","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"167","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":"43% - 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":"4","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":"17","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":"Due to the Corona pandemic this event was held virtually.","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"}]}}