{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,25]],"date-time":"2025-12-25T07:23:55Z","timestamp":1766647435295,"version":"3.41.0"},"publisher-location":"Berlin, Heidelberg","reference-count":35,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662536438"},{"type":"electronic","value":"9783662536445"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-662-53644-5_19","type":"book-chapter","created":{"date-parts":[[2016,10,20]],"date-time":"2016-10-20T03:24:08Z","timestamp":1476933848000},"page":"485-514","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":29,"title":["How to Share a Secret, Infinitely"],"prefix":"10.1007","author":[{"given":"Ilan","family":"Komargodski","sequence":"first","affiliation":[]},{"given":"Moni","family":"Naor","sequence":"additional","affiliation":[]},{"given":"Eylon","family":"Yogev","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,10,21]]},"reference":[{"key":"19_CR1","unstructured":"Beimel, A.: Secure Schemes for Secret Sharing and Key Distribution. Ph.D. thesis, Technion - Israel Institute of Technology (1996). http:\/\/www.cs.bgu.ac.il\/beimel\/Papers\/thesis.ps"},{"key":"19_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/978-3-642-20901-7_2","volume-title":"Coding and Cryptology","author":"A Beimel","year":"2011","unstructured":"Beimel, A.: Secret-sharing schemes: a survey. In: Chee, Y.M., Guo, Z., Ling, S., Shao, F., Tang, Y., Wang, H., Xing, C. (eds.) IWCC 2011. LNCS, vol. 6639, pp. 11\u201346. Springer, Heidelberg (2011)"},{"key":"19_CR3","doi-asserted-by":"crossref","unstructured":"Beimel, A., Ishai, Y.: On the power of nonlinear secrect-sharing. In: 16th Annual IEEE Conference on Computational Complexity, CCC, pp. 188\u2013202 (2001)","DOI":"10.1109\/CCC.2001.933886"},{"key":"19_CR4","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation (extended abstract). In: STOC, pp. 1\u201310 (1988)","DOI":"10.1145\/62212.62213"},{"key":"19_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/0-387-34799-2_3","volume-title":"Advances in Cryptology - CRYPTO 1988","author":"JC Benaloh","year":"1990","unstructured":"Benaloh, J.C., Leichter, J.: Generalized secret sharing and monotone functions. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol. 403, pp. 27\u201335. Springer, Heidelberg (1990)"},{"key":"19_CR6","unstructured":"Benaloh, J.C., Rudich, S.: Unpublished, private Communication with Steven Rudich. (1989)"},{"issue":"3","key":"19_CR7","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1016\/0020-0190(76)90071-5","volume":"5","author":"JL Bentley","year":"1976","unstructured":"Bentley, J.L., Yao, A.C.: An almost optimal algorithm for unbounded searching. Inf. Process. Lett. 5(3), 82\u201387 (1976)","journal-title":"Inf. Process. Lett."},{"key":"19_CR8","doi-asserted-by":"crossref","unstructured":"Blakley, G.R.: Safeguarding cryptographic keys. In: Proceedings of the AFIPS National Computer Conference, vol. 22, pp. 313\u2013317 (1979)","DOI":"10.1109\/MARK.1979.8817296"},{"key":"19_CR9","unstructured":"Bogdanov, A., Guo, S., Komargodski, I.: Threshold secret sharing requires a linear size alphabet. Electronic Colloquium on Computational Complexity (ECCC) 23, 131 (2016). http:\/\/eccc.hpi-web.de\/report\/2016\/131 , to appear in TCC 2016B"},{"issue":"2","key":"19_CR10","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1016\/0022-0000(86)90027-9","volume":"32","author":"RB Boppana","year":"1986","unstructured":"Boppana, R.B.: Threshold functions and bounded depth monotone circuits. J. Comput. Syst. Sci. 32(2), 222\u2013229 (1986)","journal-title":"J. Comput. Syst. Sci."},{"key":"19_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/3-540-60693-9_22","volume-title":"Cryptography and Coding","author":"C Cachin","year":"1995","unstructured":"Cachin, C.: On-line secret sharing. In: Boyd, C. (ed.) Cryptography and Coding 1995. LNCS, vol. 1025, pp. 190\u2013198. Springer, Heidelberg (1995)"},{"issue":"9","key":"19_CR12","doi-asserted-by":"publisher","first-page":"5600","DOI":"10.1109\/TIT.2013.2264504","volume":"59","author":"CI Pueyo","year":"2013","unstructured":"Pueyo, C.I., Cramer, R., Xing, C.: Bounds on the threshold gap in secret sharing and its applications. IEEE Trans. Inf. Theory 59(9), 5600\u20135612 (2013)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"19_CR13","volume-title":"Elements of Information Theory","author":"TM Cover","year":"2006","unstructured":"Cover, T.M., Thomas, J.A.: Elements of Information Theory, 2nd edn. Wiley, New York (2006)","edition":"2"},{"key":"19_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1007\/3-540-45539-6_22","volume-title":"Advances in Cryptology - EUROCRYPT 2000","author":"R Cramer","year":"2000","unstructured":"Cramer, R., Damg\u00e5rd, I.B., Maurer, U.M.: General secure multi-party computation from any linear secret-sharing scheme. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 316\u2013334. Springer, Heidelberg (2000)"},{"issue":"1","key":"19_CR15","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/s10623-011-9540-y","volume":"63","author":"L Csirmaz","year":"2012","unstructured":"Csirmaz, L., Tardos, G.: On-line secret sharing. Des. Codes Crypt. 63(1), 127\u2013147 (2012)","journal-title":"Des. Codes Crypt."},{"key":"19_CR16","doi-asserted-by":"crossref","unstructured":"Dodis, Y., Patrascu, M., Thorup, M.: Changing base without losing space. In: STOC, pp. 593\u2013602 (2010)","DOI":"10.1145\/1806689.1806771"},{"issue":"2","key":"19_CR17","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1109\/TIT.1975.1055349","volume":"21","author":"P Elias","year":"1975","unstructured":"Elias, P.: Universal codeword sets and representations of the integers. IEEE Trans. Inf. Theory 21(2), 194\u2013203 (1975)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"19_CR18","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1145\/359460.359480","volume":"21","author":"S Even","year":"1978","unstructured":"Even, S., Rodeh, M.: Economical encoding of commas between strings. Commun. ACM 21(4), 315\u2013317 (1978)","journal-title":"Commun. ACM"},{"issue":"3","key":"19_CR19","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1137\/0215047","volume":"15","author":"J Friedman","year":"1986","unstructured":"Friedman, J.: Constructing $${O}(n \\log n)$$ size monotone formulae for the $$k$$-th threshold function of $$n$$ boolean variables. SIAM J. Comput. 15(3), 641\u2013654 (1986)","journal-title":"SIAM J. Comput."},{"key":"19_CR20","unstructured":"Geographic, N.: NASA declares end to deep impact comet mission. http:\/\/news.nationalgeographic.com\/news\/2013\/09\/130920-deep-impact-ends-comet-mission-nasa-jpl\/ . Acccessed 07 Feb 2016"},{"key":"19_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1007\/3-540-44750-4_27","volume-title":"Advances in Cryptology - CRYPTO 1995","author":"A Herzberg","year":"1995","unstructured":"Herzberg, A., Jarecki, S., Krawczyk, H., Yung, M.: Proactive secret sharing or: how to cope with perpetual leakage. In: Coppersmith, D. (ed.) CRYPTO 1995. LNCS, vol. 963, pp. 339\u2013352. Springer, Heidelberg (1995)"},{"issue":"1","key":"19_CR22","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/BF02620229","volume":"6","author":"M Ito","year":"1993","unstructured":"Ito, M., Saito, A., Nishizeki, T.: Multiple assignment scheme for sharing secret. J. Cryptol. 6(1), 15\u201320 (1993)","journal-title":"J. Cryptol."},{"issue":"4","key":"19_CR23","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1137\/0405049","volume":"5","author":"S Kannan","year":"1992","unstructured":"Kannan, S., Naor, M., Rudich, S.: Implicit representation of graphs. SIAM J. Discrete Math. 5(4), 596\u2013603 (1992)","journal-title":"SIAM J. Discrete Math."},{"key":"19_CR24","doi-asserted-by":"crossref","unstructured":"Karchmer, M., Wigderson, A.: On span programs. In: 8th Annual Structure in Complexity Theory Conference, pp. 102\u2013111 (1993)","DOI":"10.1109\/SCT.1993.336536"},{"key":"19_CR25","unstructured":"Kilian, J., Nisan, N.: Unpublished (1990). see [12]"},{"key":"19_CR26","doi-asserted-by":"crossref","unstructured":"Kol, G., Naor, M.: Games for exchanging information. In: STOC, pp. 423\u2013432 (2008)","DOI":"10.1145\/1374376.1374437"},{"key":"19_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1007\/978-3-662-45608-8_14","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2014","author":"I Komargodski","year":"2014","unstructured":"Komargodski, I., Naor, M., Yogev, E.: Secret-sharing for NP. In: Sarkar, P., Iwata, T. (eds.) ASIACRYPT 2014, Part II. LNCS, vol. 8874, pp. 254\u2013273. Springer, Heidelberg (2014)"},{"key":"19_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1007\/3-540-48329-2_12","volume-title":"Advances in Cryptology - CRYPTO 1993","author":"H Krawczyk","year":"1994","unstructured":"Krawczyk, H.: Secret sharing made short. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol. 773, pp. 136\u2013146. Springer, Heidelberg (1994)"},{"key":"19_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1007\/3-540-46035-7_27","volume-title":"Advances in Cryptology - EUROCRYPT 2002","author":"T Malkin","year":"2002","unstructured":"Malkin, T., Micciancio, D., Miner, S.K.: Efficient generic forward-secure signatures with an unbounded number of time periods. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol. 2332, pp. 400\u2013417. Springer, Heidelberg (2002)"},{"key":"19_CR30","doi-asserted-by":"crossref","unstructured":"Pagh, R., Segev, G., Wieder, U.: How to approximate a set without knowing its size in advance. In: 54th Annual IEEE Symposium on Foundations of Computer Science, FOCS, pp. 80\u201389 (2013)","DOI":"10.1109\/FOCS.2013.17"},{"issue":"11","key":"19_CR31","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":"19_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/978-3-540-24582-7_12","volume-title":"Progress in Cryptology - INDOCRYPT 2003","author":"V Vinod","year":"2003","unstructured":"Vinod, V., Narayanan, A., Srinathan, K., Pandu Rangan, C., Kim, K.: On the power of computational secret sharing. In: Johansson, T., Maitra, S. (eds.) INDOCRYPT 2003. LNCS, vol. 2904, pp. 162\u2013176. Springer, Heidelberg (2003)"},{"key":"19_CR33","unstructured":"Wikipedia: IPv4 address exhaustion. https:\/\/en.wikipedia.org\/wiki\/IPv4_address_exhaustion . Acccessed 07 Feb 2016"},{"key":"19_CR34","doi-asserted-by":"crossref","unstructured":"Wikipedia: Year 2000 problem. https:\/\/en.wikipedia.org\/wiki\/Year_2000_problem . Acccessed 07 Feb 2016","DOI":"10.1007\/1-4020-0613-6_21303"},{"key":"19_CR35","unstructured":"Yao, A.C.: Unpublished, mentioned in [2]. See also [32]"}],"container-title":["Lecture Notes in Computer Science","Theory of Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-53644-5_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,11]],"date-time":"2025-06-11T18:03:40Z","timestamp":1749665020000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-53644-5_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662536438","9783662536445"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-53644-5_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"21 October 2016","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":"Beijing","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2016","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 November 2016","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 November 2016","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tcc2016","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}