{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,27]],"date-time":"2026-04-27T11:02:15Z","timestamp":1777287735557,"version":"3.51.4"},"publisher-location":"Cham","reference-count":60,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030568764","type":"print"},{"value":"9783030568771","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-56877-1_4","type":"book-chapter","created":{"date-parts":[[2020,8,11]],"date-time":"2020-08-11T17:17:58Z","timestamp":1597166278000},"page":"97-126","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Non-malleability Against Polynomial Tampering"],"prefix":"10.1007","author":[{"given":"Marshall","family":"Ball","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eshan","family":"Chattopadhyay","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jyun-Jie","family":"Liao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tal","family":"Malkin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Li-Yang","family":"Tan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,8,10]]},"reference":[{"key":"4_CR1","unstructured":"Aggarwal, D., et al.: Stronger leakage-resilient and non-malleable secret-sharing schemes for general access structures. IACR Cryptology ePrint Archive 2018, 1147 (2018)"},{"key":"4_CR2","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":"4_CR3","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":"4_CR4","doi-asserted-by":"crossref","unstructured":"Aggarwal, D., Obremski, M.: A constant-rate non-malleable code in the split-state model. IACR Cryptology ePrint Archive 2019, 1299 (2019)","DOI":"10.1007\/978-3-030-17653-2_18"},{"key":"4_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/978-3-662-46494-6_16","volume-title":"Theory of Cryptography","author":"S Agrawal","year":"2015","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: Dodis, Y., Nielsen, J.B. (eds.) TCC 2015, Part I. LNCS, vol. 9014, pp. 375\u2013397. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46494-6_16"},{"key":"4_CR6","unstructured":"Badrinarayanan, S., Srinivasan, A.: Revisiting non-malleable secret sharing. IACR Cryptology ePrint Archive 2018, 1144 (2018)"},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"Ball, M., Chattopadhyay, E., Liao, J., Malkin, T., Tan, L.: Non-malleability against polynomial tampering. IACR Cryptology ePrint Archive 2020, 147 (2020). https:\/\/eprint.iacr.org\/2020\/147","DOI":"10.1007\/978-3-030-56877-1_4"},{"key":"4_CR8","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":"4_CR9","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. LNCS, vol. 9666, pp. 881\u2013908. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49896-5_31"},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"Ball, M., Guo, S., Wichs, D.: Non-malleable codes for decision trees. IACR Cryptology ePrint Archive 2019, 379 (2019)","DOI":"10.1007\/978-3-030-26948-7_15"},{"issue":"4","key":"4_CR11","doi-asserted-by":"publisher","first-page":"1095","DOI":"10.1137\/S0097539705447141","volume":"36","author":"B Barak","year":"2006","unstructured":"Barak, B., Impagliazzo, R., Wigderson, A.: Extracting randomness using few independent sources. SIAM J. Comput. 36(4), 1095\u20131118 (2006). https:\/\/doi.org\/10.1137\/S0097539705447141","journal-title":"SIAM J. Comput."},{"key":"4_CR12","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1137\/0217014","volume":"17","author":"C Bennett","year":"1988","unstructured":"Bennett, C., Brassard, G., Robert, J.M.: Privacy amplification by public discussion. SIAM J. Comput. 17, 210\u2013229 (1988)","journal-title":"SIAM J. Comput."},{"key":"4_CR13","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"},{"issue":"01","key":"4_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1142\/S1793042105000108","volume":"01","author":"J Bourgain","year":"2005","unstructured":"Bourgain, J.: More on the sum-product phenomenon in prime fields and its applications. Int. J. Number Theory 01(01), 1\u201332 (2005). https:\/\/doi.org\/10.1142\/S1793042105000108","journal-title":"Int. J. Number Theory"},{"issue":"1","key":"4_CR15","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/s00039-007-0593-z","volume":"17","author":"J Bourgain","year":"2007","unstructured":"Bourgain, J.: On the construction of affine extractors. GAFA Geom. Funct. Anal. 17(1), 33\u201357 (2007)","journal-title":"GAFA Geom. Funct. Anal."},{"key":"4_CR16","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":"4_CR17","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":"4_CR18","unstructured":"Chattopadhyay, E., Li, X.: Non-malleable codes, extractors and secret sharing for interleaved tampering and composition of tampering. Technical report, Cryptology ePrint Archive, Report 2018\/1069, 2018 (2019)"},{"key":"4_CR19","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"},{"issue":"3","key":"4_CR20","doi-asserted-by":"publisher","first-page":"653","DOI":"10.4007\/annals.2019.189.3.1","volume":"189","author":"E Chattopadhyay","year":"2019","unstructured":"Chattopadhyay, E., Zuckerman, D.: Explicit two-source extractors and resilient functions. Ann. Math. 189(3), 653\u2013705 (2019). https:\/\/doi.org\/10.4007\/annals.2019.189.3.1","journal-title":"Ann. Math."},{"key":"4_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1007\/978-3-642-54242-8_19","volume-title":"Theory of Cryptography","author":"M Cheraghchi","year":"2014","unstructured":"Cheraghchi, M., Guruswami, V.: Non-malleable coding against bit-wise and split-state tampering. In: Lindell, Y. (ed.) TCC 2014. LNCS, vol. 8349, pp. 440\u2013464. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-54242-8_19"},{"key":"4_CR22","unstructured":"Cheraghchi, M., Shokrollahi, A.: Almost-uniform sampling of points on high-dimensional algebraic varieties. In: 26th International Symposium on Theoretical Aspects of Computer Science, STACS 2009, Freiburg, Germany, 26\u201328 February 2009, Proceedings, pp. 277\u2013288 (2009)"},{"issue":"2","key":"4_CR23","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."},{"key":"4_CR24","doi-asserted-by":"publisher","unstructured":"Chor, B., Goldreich, O., Hasted, J., Freidmann, J., Rudich, S., Smolensky, R.: The bit extraction problem or t-resilient functions. In: IEEE Symposium on Foundations of Computer Science, pp. 396\u2013407 (1985). https:\/\/doi.org\/10.1109\/SFCS.1985.55","DOI":"10.1109\/SFCS.1985.55"},{"key":"4_CR25","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"},{"issue":"2","key":"4_CR26","doi-asserted-by":"publisher","first-page":"800","DOI":"10.1137\/120868414","volume":"43","author":"Y Dodis","year":"2014","unstructured":"Dodis, Y., Li, X., Wooley, T.D., Zuckerman, D.: Privacy amplification and nonmalleable extractors via character sums. SIAM J. Comput. 43(2), 800\u2013830 (2014)","journal-title":"SIAM J. Comput."},{"key":"4_CR27","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":"4_CR28","unstructured":"Dusart, P.: Estimates of some functions over primes without RH. arXiv preprint arXiv:1002.0442 (2010)"},{"issue":"4","key":"4_CR29","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/s00037-011-0023-3","volume":"21","author":"Z Dvir","year":"2012","unstructured":"Dvir, Z.: Extractors for varieties. Comput. Complex. 21(4), 515\u2013572 (2012)","journal-title":"Comput. Complex."},{"issue":"1","key":"4_CR30","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00037-009-0258-4","volume":"18","author":"Z Dvir","year":"2009","unstructured":"Dvir, Z., Gabizon, A., Wigderson, A.: Extractors and rank extractors for polynomial sources. Comput. Complex. 18(1), 1\u201358 (2009)","journal-title":"Comput. Complex."},{"key":"4_CR31","doi-asserted-by":"crossref","unstructured":"Dvir, Z., Kopparty, S., Saraf, S., Sudan, M.: Extensions to the method of multiplicities, with applications to Kakeya sets and mergers. In: Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science, pp. 181\u2013190 (2009)","DOI":"10.1109\/FOCS.2009.40"},{"key":"4_CR32","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"},{"issue":"4","key":"4_CR33","doi-asserted-by":"publisher","first-page":"20:1","DOI":"10.1145\/3178432","volume":"65","author":"S Dziembowski","year":"2018","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","journal-title":"J. ACM"},{"issue":"4","key":"4_CR34","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/s00493-008-2259-3","volume":"28","author":"A Gabizon","year":"2008","unstructured":"Gabizon, A., Raz, R.: Deterministic extractors for affine sources over large fields. Combinatorica 28(4), 415\u2013440 (2008)","journal-title":"Combinatorica"},{"key":"4_CR35","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":"4_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1007\/978-3-319-96884-1_17","volume-title":"Advances in Cryptology \u2013 CRYPTO 2018","author":"V Goyal","year":"2018","unstructured":"Goyal, V., Kumar, A.: Non-malleable secret sharing for general access structures. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018, Part I. LNCS, vol. 10991, pp. 501\u2013530. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96884-1_17"},{"key":"4_CR37","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":"4_CR38","unstructured":"Gupta, D., Maji, H.K., Wang, M.: Constant-rate non-malleable codes in the split-state model. Technical report, Technical Report Report 2017\/1048, Cryptology ePrint Archive (2018)"},{"issue":"4","key":"4_CR39","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1538902.1538904","volume":"56","author":"V Guruswami","year":"2009","unstructured":"Guruswami, V., Umans, C., Vadhan, S.P.: Unbalanced expanders and randomness extractors from Parvaresh-Vardy codes. J. ACM 56(4), 1\u201334 (2009)","journal-title":"J. ACM"},{"key":"4_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1007\/BFb0054889","volume-title":"Algorithmic Number Theory","author":"M-D Huang","year":"1998","unstructured":"Huang, M.-D., Wong, Y.-C.: An algorithm for approximate counting of points on algebraic sets over finite fields. In: Buhler, J.P. (ed.) ANTS 1998. LNCS, vol. 1423, pp. 514\u2013527. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0054889"},{"key":"4_CR41","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":"4_CR42","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 their 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"},{"issue":"9","key":"4_CR43","doi-asserted-by":"publisher","first-page":"570","DOI":"10.1109\/LCOMM.2004.833807","volume":"8","author":"J Lacan","year":"2004","unstructured":"Lacan, J., Fimes, J.: Systematic MDS erasure codes based on vandermonde matrices. IEEE Commun. Lett. 8(9), 570\u2013572 (2004). https:\/\/doi.org\/10.1109\/LCOMM.2004.833807","journal-title":"IEEE Commun. Lett."},{"key":"4_CR44","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":"4_CR45","unstructured":"Li, X.: Non-malleable extractors and non-malleable codes: partially optimal constructions. In: 34th Computational Complexity Conference, CCC 2019, New Brunswick, NJ, USA, 18\u201320 July 2019, pp. 28:1\u201328:49 (2019)"},{"key":"4_CR46","unstructured":"Lin, F., Cheraghchi, M., Guruswami, V., Safavi-Naini, R., Wang, H.: Non-malleable secret sharing against affine tampering. arXiv preprint arXiv:1902.06195 (2019)"},{"key":"4_CR47","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/3-540-45708-9_17","volume-title":"Advances in Cryptology \u2014 CRYPTO 2002","author":"C-J Lu","year":"2002","unstructured":"Lu, C.-J.: Hyper-encryption against space-bounded adversaries from on-line strong extractors. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 257\u2013271. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45708-9_17"},{"issue":"1","key":"4_CR48","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1006\/jcss.1996.0004","volume":"52","author":"N Nisan","year":"1996","unstructured":"Nisan, N., Zuckerman, D.: Randomness is linear in space. J. Comput. Syst. Sci. 52(1), 43\u201352 (1996). https:\/\/doi.org\/10.1006\/jcss.1996.0004","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"4_CR49","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1137\/0209024","volume":"9","author":"MO Rabin","year":"1980","unstructured":"Rabin, M.O.: Probabilistic algorithms in finite fields. SIAM J. Comput. 9(2), 273\u2013280 (1980). https:\/\/doi.org\/10.1137\/0209024","journal-title":"SIAM J. Comput."},{"key":"4_CR50","unstructured":"Rao, A.: An exposition of Bourgain\u2019s 2-source extractor. In: Electronic Colloquium on Computational Complexity (ECCC), vol. 14 (2007)"},{"issue":"2","key":"4_CR51","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1137\/0108018","volume":"8","author":"IS Reed","year":"1960","unstructured":"Reed, I.S., Solomon, G.: Polynomial codes over certain finite fields. J. Soc. Ind. Appl. Math. 8(2), 300\u2013304 (1960)","journal-title":"J. Soc. Ind. Appl. Math."},{"issue":"57","key":"4_CR52","first-page":"17","volume":"43","author":"G Robin","year":"1988","unstructured":"Robin, G.: Permanence de relations de r\u00e9currence dans certains d\u00e9veloppements asymptotiques. Pub. Inst. Math. Beograd 43(57), 17\u201325 (1988)","journal-title":"Pub. Inst. Math. Beograd"},{"issue":"1","key":"4_CR53","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1112\/plms\/s2-45.1.21","volume":"2","author":"B Rosser","year":"1939","unstructured":"Rosser, B.: The n-th prime is greater than nlogn. Proc. Lond. Math. Soc. 2(1), 21\u201344 (1939)","journal-title":"Proc. Lond. Math. Soc."},{"key":"4_CR54","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/3-540-09519-5_72","volume-title":"Symbolic and Algebraic Computation","author":"JT Schwartz","year":"1979","unstructured":"Schwartz, J.T.: Probabilistic algorithms for verification of polynomial identities. In: Ng, E.W. (ed.) Symbolic and Algebraic Computation. LNCS, vol. 72, pp. 200\u2013215. Springer, Heidelberg (1979). https:\/\/doi.org\/10.1007\/3-540-09519-5_72"},{"issue":"11","key":"4_CR55","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"},{"issue":"2","key":"4_CR56","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1109\/TIT.1964.1053661","volume":"10","author":"RC Singleton","year":"1964","unstructured":"Singleton, R.C.: Maximum distance q-nary codes. IEEE Trans. Inf. Theory 10(2), 116\u2013118 (1964). https:\/\/doi.org\/10.1109\/TIT.1964.1053661","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"12","key":"4_CR57","doi-asserted-by":"publisher","first-page":"3015","DOI":"10.1109\/TIT.2004.838377","volume":"50","author":"A Ta-Shma","year":"2004","unstructured":"Ta-Shma, A., Zuckerman, D.: Extractor codes. IEEE Trans. Inf. Theory 50(12), 3015\u20133025 (2004)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"5","key":"4_CR58","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1073\/pnas.34.5.204","volume":"34","author":"A Weil","year":"1948","unstructured":"Weil, A.: On some exponential sums. Proc. Natl. Acad. Sci. U.S.A. 34(5), 204 (1948)","journal-title":"Proc. Natl. Acad. Sci. U.S.A."},{"key":"4_CR59","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1007\/3-540-09519-5_73","volume-title":"Symbolic and Algebraic Computation","author":"R Zippel","year":"1979","unstructured":"Zippel, R.: Probabilistic algorithms for sparse polynomials. In: Ng, E.W. (ed.) Symbolic and Algebraic Computation. LNCS, vol. 72, pp. 216\u2013226. Springer, Heidelberg (1979). https:\/\/doi.org\/10.1007\/3-540-09519-5_73"},{"key":"4_CR60","doi-asserted-by":"crossref","unstructured":"Zuckerman, D.: Linear degree extractors and the inapproximability of max clique and chromatic number. In: Proceedings of the Thirty-Eighth Annual ACM Symposium on Theory of Computing, pp. 681\u2013690 (2006)","DOI":"10.1145\/1132516.1132612"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2020"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-56877-1_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,11]],"date-time":"2023-08-11T00:05:48Z","timestamp":1691712348000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-56877-1_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030568764","9783030568771"],"references-count":60,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-56877-1_4","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":"10 August 2020","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":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 August 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 August 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"40","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"crypto2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2020\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"HotCRP","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"371","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":"85","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"23% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.82","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":"19.43","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"}]}}