{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,21]],"date-time":"2025-12-21T01:02:43Z","timestamp":1766278963629,"version":"3.48.0"},"publisher-location":"Cham","reference-count":52,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031223174"},{"type":"electronic","value":"9783031223181"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-031-22318-1_12","type":"book-chapter","created":{"date-parts":[[2022,12,21]],"date-time":"2022-12-21T03:04:30Z","timestamp":1671591870000},"page":"327-354","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On Secret Sharing, Randomness, and\u00a0Random-less Reductions for\u00a0Secret Sharing"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3841-0262","authenticated-orcid":false,"given":"Divesh","family":"Aggarwal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0048-4610","authenticated-orcid":false,"given":"Eldon","family":"Chung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4174-0438","authenticated-orcid":false,"given":"Maciej","family":"Obremski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9870-0501","authenticated-orcid":false,"given":"Jo\u00e3o","family":"Ribeiro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,12,21]]},"reference":[{"key":"12_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"510","DOI":"10.1007\/978-3-030-26951-7_18","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"D Aggarwal","year":"2019","unstructured":"Aggarwal, D., et al.: Stronger leakage-resilient and non-malleable secret sharing schemes for general access structures. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11693, pp. 510\u2013539. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26951-7_18"},{"key":"12_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/978-3-319-70503-3_10","volume-title":"Theory of Cryptography","author":"D Aggarwal","year":"2017","unstructured":"Aggarwal, D., Kazana, T., Obremski, M.: Inception makes non-malleable codes stronger. In: Kalai, Y., Reyzin, L. (eds.) TCC 2017. LNCS, vol. 10678, pp. 319\u2013343. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70503-3_10"},{"key":"12_CR3","doi-asserted-by":"publisher","unstructured":"Aggarwal, D., Obremski, M.: A constant rate non-malleable code in the split-state model. In: 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS), pp. 1285\u20131294 (2020). https:\/\/doi.org\/10.1109\/FOCS46700.2020.00122","DOI":"10.1109\/FOCS46700.2020.00122"},{"key":"12_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/978-3-030-45721-1_13","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2020","author":"D Aggarwal","year":"2020","unstructured":"Aggarwal, D., Obremski, M., Ribeiro, J., Siniscalchi, L., Visconti, I.: How to extract useful randomness from unreliable sources. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020. LNCS, vol. 12105, pp. 343\u2013372. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45721-1_13"},{"key":"12_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1007\/978-3-662-44371-2_26","volume-title":"Advances in Cryptology \u2013 CRYPTO 2014","author":"P Austrin","year":"2014","unstructured":"Austrin, P., Chung, K.-M., Mahmoody, M., Pass, R., Seth, K.: On the impossibility of cryptography with tamperable randomness. In: Garay, J.A., Gennaro, R. (eds.) CRYPTO 2014. LNCS, vol. 8616, pp. 462\u2013479. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44371-2_26"},{"key":"12_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"675","DOI":"10.1007\/978-3-319-28166-7_33","volume-title":"Applied Cryptography and Network Security","author":"M Backes","year":"2015","unstructured":"Backes, M., Kate, A., Meiser, S., Ruffing, T.: Secrecy without perfect randomness: cryptography with (bounded) weak sources. In: Malkin, T., Kolesnikov, V., Lewko, A.B., Polychronakis, M. (eds.) ACNS 2015. LNCS, vol. 9092, pp. 675\u2013695. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-28166-7_33"},{"key":"12_CR7","doi-asserted-by":"publisher","unstructured":"Bellare, M., Rompel, J.: Randomness-efficient oblivious sampling. In: Proceedings 35th Annual Symposium on Foundations of Computer Science, pp. 276\u2013287 (1994). https:\/\/doi.org\/10.1109\/SFCS.1994.365687","DOI":"10.1109\/SFCS.1994.365687"},{"key":"12_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/978-3-642-10366-7_14","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2009","author":"M Bellare","year":"2009","unstructured":"Bellare, M., et al.: Hedged public-key encryption: how to protect against bad randomness. In: Matsui, M. (ed.) ASIACRYPT 2009. LNCS, vol. 5912, pp. 232\u2013249. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-10366-7_14"},{"key":"12_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/0-387-34799-2_3","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 88","author":"J Benaloh","year":"1990","unstructured":"Benaloh, J., Leichter, J.: Generalized secret sharing and monotone functions. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol. 403, pp. 27\u201335. Springer, New York (1990). https:\/\/doi.org\/10.1007\/0-387-34799-2_3"},{"issue":"2","key":"12_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00145-021-09375-2","volume":"34","author":"F Benhamouda","year":"2021","unstructured":"Benhamouda, F., Degwekar, A., Ishai, Y., Rabin, T.: On the local leakage resilience of linear secret sharing schemes. J. Cryptol. 34(2), 1\u201365 (2021). https:\/\/doi.org\/10.1007\/s00145-021-09375-2","journal-title":"J. Cryptol."},{"key":"12_CR11","doi-asserted-by":"publisher","unstructured":"Bhowmick, A., Gabizon, A., L\u00ea, T.H., Zuckerman, D.: Deterministic extractors for additive sources: extended abstract. In: Roughgarden, T. (ed.) Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science, ITCS 2015, Rehovot, Israel, 11\u201313 January 2015, pp. 277\u2013286. ACM (2015). https:\/\/doi.org\/10.1145\/2688073.2688090","DOI":"10.1145\/2688073.2688090"},{"key":"12_CR12","doi-asserted-by":"publisher","unstructured":"Blakley, G.R.: Safeguarding cryptographic keys. In: 1979 International Workshop on Managing Requirements Knowledge (MARK), pp. 313\u2013318 (1979). https:\/\/doi.org\/10.1109\/MARK.1979.8817296","DOI":"10.1109\/MARK.1979.8817296"},{"issue":"2","key":"12_CR13","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/BF02579167","volume":"6","author":"M Blum","year":"1986","unstructured":"Blum, M.: Independent unbiased coin flips from a correlated biased source-a finite state Markov chain. Combinatorica 6(2), 97\u2013108 (1986)","journal-title":"Combinatorica"},{"key":"12_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-70936-7_1","volume-title":"Theory of Cryptography","author":"C Bosley","year":"2007","unstructured":"Bosley, C., Dodis, Y.: Does privacy require true randomness? In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol. 4392, pp. 1\u201320. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-70936-7_1"},{"issue":"1","key":"12_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":"12_CR16","doi-asserted-by":"publisher","unstructured":"Canetti, R., Pass, R., Shelat, A.: Cryptography from sunspots: how to use an imperfect reference string. In: 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2007), pp. 249\u2013259 (2007). https:\/\/doi.org\/10.1109\/FOCS.2007.70","DOI":"10.1109\/FOCS.2007.70"},{"key":"12_CR17","doi-asserted-by":"publisher","unstructured":"Chattopadhyay, E., et al.: Extractors and secret sharing against bounded collusion protocols. In: 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS), pp. 1226\u20131242 (2020). https:\/\/doi.org\/10.1109\/FOCS46700.2020.00117","DOI":"10.1109\/FOCS46700.2020.00117"},{"key":"12_CR18","doi-asserted-by":"crossref","unstructured":"Chattopadhyay, E., Li, X.: Extractors for sumset sources. In: Proceedings of the Forty-Eighth Annual ACM Symposium on Theory of Computing, pp. 299\u2013311. ACM (2016)","DOI":"10.1145\/2897518.2897643"},{"issue":"2","key":"12_CR19","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). https:\/\/doi.org\/10.1137\/0217015","journal-title":"SIAM J. Comput."},{"key":"12_CR20","doi-asserted-by":"crossref","unstructured":"Chor, B., Goldreich, O., H\u00e5stad, J., Friedman, J., Rudich, S., Smolensky, R.: The bit extraction problem or $$t$$-resilient functions. In: Proceedings of the 26th IEEE Symposium on Foundation of Computer Science, pp. 396\u2013407 (1985)","DOI":"10.1109\/SFCS.1985.55"},{"key":"12_CR21","doi-asserted-by":"publisher","unstructured":"Cramer, R., Damg\u00e5rd, I.B., Nielsen, J.B.: Secure Multiparty Computation and Secret Sharing. Cambridge University Press (2015). https:\/\/doi.org\/10.1017\/CBO9781107337756","DOI":"10.1017\/CBO9781107337756"},{"key":"12_CR22","unstructured":"Dodis, Y.: Exposure-resilient cryptography. Ph.D. thesis, Massachusetts Institute of Technology (2000)"},{"key":"12_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1007\/978-3-642-32009-5_29","volume-title":"Advances in Cryptology \u2013 CRYPTO 2012","author":"Y Dodis","year":"2012","unstructured":"Dodis, Y., L\u00f3pez-Alt, A., Mironov, I., Vadhan, S.: Differential privacy with imperfect randomness. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 497\u2013516. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32009-5_29"},{"key":"12_CR24","doi-asserted-by":"publisher","unstructured":"Dodis, Y., Ong, S.J., Prabhakaran, M., Sahai, A.: On the (im)possibility of cryptography with imperfect randomness. In: 45th Annual IEEE Symposium on Foundations of Computer Science, pp. 196\u2013205 (2004). https:\/\/doi.org\/10.1109\/FOCS.2004.44","DOI":"10.1109\/FOCS.2004.44"},{"key":"12_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1007\/11681878_31","volume-title":"Theory of Cryptography","author":"Y Dodis","year":"2006","unstructured":"Dodis, Y., Pietrzak, K., Przydatek, B.: Separating sources for encryption and secret sharing. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol. 3876, pp. 601\u2013616. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11681878_31"},{"key":"12_CR26","doi-asserted-by":"publisher","unstructured":"Dodis, Y., Spencer, J.: On the (non)universality of the one-time pad. In: 43rd Annual IEEE Symposium on Foundations of Computer Science, pp. 376\u2013385 (2002). https:\/\/doi.org\/10.1109\/SFCS.2002.1181962","DOI":"10.1109\/SFCS.2002.1181962"},{"key":"12_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/978-3-662-48000-7_23","volume-title":"Advances in Cryptology \u2013 CRYPTO 2015","author":"Y Dodis","year":"2015","unstructured":"Dodis, Y., Yao, Y.: Privacy with imperfect randomness. In: Gennaro, R., Robshaw, M. (eds.) CRYPTO 2015. LNCS, vol. 9216, pp. 463\u2013482. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48000-7_23"},{"key":"12_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-36594-2_1","volume-title":"Theory of Cryptography","author":"Y Dodis","year":"2013","unstructured":"Dodis, Y., Yu, Yu.: Overcoming weak expectations. In: Sahai, A. (ed.) TCC 2013. LNCS, vol. 7785, pp. 1\u201322. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36594-2_1"},{"issue":"4","key":"12_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). https:\/\/doi.org\/10.1007\/s00037-011-0023-3","journal-title":"Comput. Complex."},{"issue":"1","key":"12_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). https:\/\/doi.org\/10.1007\/s00037-009-0258-4","journal-title":"Comput. Complex."},{"key":"12_CR31","doi-asserted-by":"publisher","unstructured":"Dziembowski, S., Pietrzak, K., Wichs, D.: Non-malleable codes. J. ACM 65(4) (2018). https:\/\/doi.org\/10.1145\/3178432","DOI":"10.1145\/3178432"},{"issue":"1\u20132","key":"12_CR32","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/BF02772959","volume":"51","author":"P Erd\u00f6s","year":"1985","unstructured":"Erd\u00f6s, P., Frankl, P., F\u00fcredi, Z.: Families of finite sets in which no set is covered by the union of $$r$$ others. Isr. J. Math. 51(1\u20132), 79\u201389 (1985)","journal-title":"Isr. J. Math."},{"key":"12_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1007\/978-3-642-22670-0_22","volume-title":"Studies in Complexity and Cryptography. Miscellanea on the Interplay between Randomness and Computation","author":"O Goldreich","year":"2011","unstructured":"Goldreich, O.: Three XOR-lemmas \u2014 an exposition. In: Goldreich, O. (ed.) Studies in Complexity and Cryptography. Miscellanea on the Interplay between Randomness and Computation. LNCS, vol. 6650, pp. 248\u2013272. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22670-0_22"},{"key":"12_CR34","doi-asserted-by":"publisher","unstructured":"Goyal, V., Kumar, A.: Non-malleable secret sharing. In: STOC 2018, pp. 685\u2013698 (2018). https:\/\/doi.org\/10.1145\/3188745.3188872","DOI":"10.1145\/3188745.3188872"},{"issue":"1","key":"12_CR35","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/j.jcss.2010.06.014","volume":"77","author":"J Kamp","year":"2011","unstructured":"Kamp, J., Rao, A., Vadhan, S.P., Zuckerman, D.: Deterministic extractors for small-space sources. J. Comput. Syst. Sci. 77(1), 191\u2013220 (2011). https:\/\/doi.org\/10.1016\/j.jcss.2010.06.014","journal-title":"J. Comput. Syst. Sci."},{"key":"12_CR36","doi-asserted-by":"publisher","unstructured":"Kumar, A., Meka, R., Sahai, A.: Leakage-resilient secret sharing against colluding parties. In: 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS), pp. 636\u2013660 (2019). https:\/\/doi.org\/10.1109\/FOCS.2019.00045","DOI":"10.1109\/FOCS.2019.00045"},{"issue":"3","key":"12_CR37","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF02125896","volume":"9","author":"D Lichtenstein","year":"1989","unstructured":"Lichtenstein, D., Linial, N., Saks, M.: Some extremal problems arising from discrete control processes. Combinatorica 9(3), 269\u2013287 (1989)","journal-title":"Combinatorica"},{"key":"12_CR38","doi-asserted-by":"publisher","unstructured":"Lin, F., Cheraghchi, M., Guruswami, V., Safavi-Naini, R., Wang, H.: Leakage-resilient secret sharing in non-compartmentalized models. In: Kalai, Y.T., Smith, A.D., Wichs, D. (eds.) 1st Conference on Information-Theoretic Cryptography (ITC 2020). Leibniz International Proceedings in Informatics (LIPIcs), vol. 163, pp. 7:1\u20137:24. Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl (2020). https:\/\/doi.org\/10.4230\/LIPIcs.ITC.2020.7","DOI":"10.4230\/LIPIcs.ITC.2020.7"},{"key":"12_CR39","unstructured":"Maji, H., Paskin-Cherniavsky, A., Suad, T., Wang, M.: On leakage-resilient secret sharing. Cryptology ePrint Archive, Report 2020\/1517 (2020). https:\/\/eprint.iacr.org\/2020\/1517"},{"key":"12_CR40","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":"12_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1007\/3-540-38424-3_31","volume-title":"Advances in Cryptology-CRYPT0\u2019 90","author":"JL McInnes","year":"1991","unstructured":"McInnes, J.L., Pinkas, B.: On the impossibility of private key cryptography with weakly random keys. In: Menezes, A.J., Vanstone, S.A. (eds.) CRYPTO 1990. LNCS, vol. 537, pp. 421\u2013435. Springer, Heidelberg (1991). https:\/\/doi.org\/10.1007\/3-540-38424-3_31"},{"key":"12_CR42","unstructured":"von Neumann, J.: Various techniques used in connection with random digits. Monte Carlo Method. U.S. Nat. Bur. Stand. Appl. Math. Ser. 12, 36\u201338 (1951)"},{"issue":"2","key":"12_CR43","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/S0022-0000(05)80043-1","volume":"49","author":"N Nisan","year":"1994","unstructured":"Nisan, N., Wigderson, A.: Hardness vs randomness. J. Comput. Syst. Sci. 49(2), 149\u2013167 (1994). https:\/\/doi.org\/10.1016\/S0022-0000(05)80043-1","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"12_CR44","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1006\/jcss.2002.1824","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. J. Comput. Syst. Sci. 65(1), 97\u2013128 (2002). https:\/\/doi.org\/10.1006\/jcss.2002.1824","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"12_CR45","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/S0195-6698(85)80023-8","volume":"6","author":"V R\u00f6dl","year":"1985","unstructured":"R\u00f6dl, V.: On a packing and covering problem. Eur. J. Comb. 6(1), 69\u201378 (1985). https:\/\/doi.org\/10.1016\/S0195-6698(85)80023-8","journal-title":"Eur. J. Comb."},{"issue":"1","key":"12_CR46","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/0022-0000(86)90044-9","volume":"33","author":"M Santha","year":"1986","unstructured":"Santha, M., Vazirani, U.V.: Generating quasi-random sequences from semi-random sources. J. Comput. Syst. Sci. 33(1), 75\u201387 (1986). https:\/\/doi.org\/10.1016\/0022-0000(86)90044-9","journal-title":"J. Comput. Syst. Sci."},{"issue":"11","key":"12_CR47","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). https:\/\/doi.org\/10.1145\/359168.359176","journal-title":"Commun. ACM"},{"key":"12_CR48","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"480","DOI":"10.1007\/978-3-030-26951-7_17","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"A Srinivasan","year":"2019","unstructured":"Srinivasan, A., Vasudevan, P.N.: Leakage resilient secret sharing and applications. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11693, pp. 480\u2013509. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26951-7_17"},{"issue":"1","key":"12_CR49","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/s10623-017-0336-6","volume":"86","author":"DR Stinson","year":"2017","unstructured":"Stinson, D.R., Wei, R.: Combinatorial repairability for threshold schemes. Des. Codes Crypt. 86(1), 195\u2013210 (2017). https:\/\/doi.org\/10.1007\/s10623-017-0336-6","journal-title":"Des. Codes Crypt."},{"issue":"4","key":"12_CR50","doi-asserted-by":"publisher","first-page":"860","DOI":"10.1145\/502090.502099","volume":"48","author":"L Trevisan","year":"2001","unstructured":"Trevisan, L.: Extractors and pseudorandom generators. J. ACM 48(4), 860\u2013879 (2001). https:\/\/doi.org\/10.1145\/502090.502099","journal-title":"J. ACM"},{"key":"12_CR51","doi-asserted-by":"crossref","unstructured":"Trevisan, L., Vadhan, S.: Extracting randomness from samplable distributions. In: 41st Annual Symposium on Foundations of Computer Science, Redondo Beach, California, pp. 32\u201342. IEEE, November 2000","DOI":"10.1109\/SFCS.2000.892063"},{"issue":"5","key":"12_CR52","doi-asserted-by":"publisher","first-page":"1230","DOI":"10.1109\/TIFS.2017.2780802","volume":"13","author":"Y Yao","year":"2018","unstructured":"Yao, Y., Li, Z.: Differential privacy with bias-control limited sources. IEEE Trans. Inf. Forensics Secur. 13(5), 1230\u20131241 (2018). https:\/\/doi.org\/10.1109\/TIFS.2017.2780802","journal-title":"IEEE Trans. Inf. Forensics Secur."}],"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-031-22318-1_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,21]],"date-time":"2025-12-21T01:02:00Z","timestamp":1766278920000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-22318-1_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031223174","9783031223181"],"references-count":52,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-22318-1_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"21 December 2022","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":"Chicago, IL","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":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 November 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 November 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tcc2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tcc.iacr.org\/2022\/","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":"HotCRP","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"139","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":"60","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":"3.1","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":"9.9","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"}]}}