{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,17]],"date-time":"2026-08-17T15:01:23Z","timestamp":1786978883183,"version":"build-2736575974"},"publisher-location":"Cham","reference-count":36,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030579890","type":"print"},{"value":"9783030579906","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":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[[2020]]},"DOI":"10.1007\/978-3-030-57990-6_28","type":"book-chapter","created":{"date-parts":[[2020,9,6]],"date-time":"2020-09-06T19:02:41Z","timestamp":1599418961000},"page":"566-578","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Secret Sharing Lower Bound: Either Reconstruction is Hard or Shares are Long"],"prefix":"10.1007","author":[{"given":"Kasper Green","family":"Larsen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mark","family":"Simkin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,9,7]]},"reference":[{"key":"28_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/978-3-030-03807-6_12","volume-title":"Theory of Cryptography","author":"B Applebaum","year":"2018","unstructured":"Applebaum, B., Arkis, B.: On the power of amortization in secret sharing: d-uniform secret sharing and CDS with constant information rate. In: Beimel, A., Dziembowski, S. (eds.) TCC 2018. LNCS, vol. 11239, pp. 317\u2013344. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03807-6_12"},{"key":"28_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"727","DOI":"10.1007\/978-3-319-63688-7_24","volume-title":"Advances in Cryptology \u2013 CRYPTO 2017","author":"B Applebaum","year":"2017","unstructured":"Applebaum, B., Arkis, B., Raykov, P., Vasudevan, P.N.: Conditional disclosure of secrets: amplification, closure, amortization, lower-bounds, and separations. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017. LNCS, vol. 10401, pp. 727\u2013757. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63688-7_24"},{"key":"28_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1007\/978-3-030-17659-4_15","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2019","author":"B Applebaum","year":"2019","unstructured":"Applebaum, B., Beimel, A., Farr\u00e0s, O., Nir, O., Peter, N.: Secret-sharing schemes for general and uniform access structures. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019. LNCS, vol. 11478, pp. 441\u2013471. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17659-4_15"},{"issue":"3","key":"28_CR4","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/s004930050058","volume":"19","author":"L Babai","year":"1999","unstructured":"Babai, L., G\u00e1l, A., Wigderson, A.: Superpolynomial lower bounds for monotone span programs. Combinatorica 19(3), 301\u2013319 (1999)","journal-title":"Combinatorica"},{"key":"28_CR5","unstructured":"Beimel, A.: Secure schemes for secret sharing and key distribution. Technion-Israel Institute of technology, Faculty of computer science (1996)"},{"key":"28_CR6","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., et al. (eds.) IWCC 2011. LNCS, vol. 6639, pp. 11\u201346. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-20901-7_2"},{"key":"28_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/978-3-540-70936-7_14","volume-title":"Theory of Cryptography","author":"A Beimel","year":"2007","unstructured":"Beimel, A., Franklin, M.: Weakly-private secret sharing schemes. In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol. 4392, pp. 253\u2013272. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-70936-7_14"},{"key":"28_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/978-3-642-54242-8_14","volume-title":"Theory of Cryptography","author":"A Beimel","year":"2014","unstructured":"Beimel, A., Ishai, Y., Kumaresan, R., Kushilevitz, E.: On the cryptographic complexity of the worst functions. In: Lindell, Y. (ed.) TCC 2014. LNCS, vol. 8349, pp. 317\u2013342. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-54242-8_14"},{"key":"28_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1007\/978-3-642-00457-5_32","volume-title":"Theory of Cryptography","author":"A Beimel","year":"2009","unstructured":"Beimel, A., Orlov, I.: Secret sharing and non-Shannon information inequalities. In: Reingold, O. (ed.) TCC 2009. LNCS, vol. 5444, pp. 539\u2013557. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00457-5_32"},{"key":"28_CR10","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation (extended abstract). In: 20th Annual ACM Symposium on Theory of Computing, Chicago, IL, USA, 2\u20134 May 1988, pp. 1\u201310. ACM Press (1988)","DOI":"10.1145\/62212.62213"},{"key":"28_CR11","doi-asserted-by":"crossref","unstructured":"Blakley, G.R.: Safeguarding cryptographic keys, pp. 313\u2013317. AFIPS Press (1979)","DOI":"10.1109\/MARK.1979.8817296"},{"key":"28_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1007\/3-540-48071-4_11","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 92","author":"C Blundo","year":"1993","unstructured":"Blundo, C., De Santis, A., Gargano, L., Vaccaro, U.: On the information rate of secret sharing schemes. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol. 740, pp. 148\u2013167. Springer, Heidelberg (1993). https:\/\/doi.org\/10.1007\/3-540-48071-4_11"},{"key":"28_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1007\/978-3-662-53644-5_18","volume-title":"Theory of Cryptography","author":"A Bogdanov","year":"2016","unstructured":"Bogdanov, A., Guo, S., Komargodski, I.: Threshold secret sharing requires a linear size alphabet. In: Hirt, M., Smith, A. (eds.) TCC 2016. LNCS, vol. 9986, pp. 471\u2013484. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53644-5_18"},{"key":"28_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/3-540-46766-1_7","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201991","author":"RM Capocelli","year":"1992","unstructured":"Capocelli, R.M., De Santis, A., Gargano, L., Vaccaro, U.: On the size of shares for secret sharing schemes. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 101\u2013113. Springer, Heidelberg (1992). https:\/\/doi.org\/10.1007\/3-540-46766-1_7"},{"key":"28_CR15","doi-asserted-by":"crossref","unstructured":"Chakraborty, D., Kamma, L., Larsen, K.G.: Tight cell probe bounds for succinct Boolean matrix-vector multiplication. In: Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2018, Los Angeles, CA, USA, 25\u201329 June 2018, pp. 1297\u20131306 (2018)","DOI":"10.1145\/3188745.3188830"},{"key":"28_CR16","doi-asserted-by":"crossref","unstructured":"Chaum, D., Cr\u00e9peau, C., Damg\u00e5rd, I.: Multiparty unconditionally secure protocols (extended abstract). In: 20th Annual ACM Symposium on Theory of Computing, Chicago, IL, USA, 2\u20134 May 1988, pp. 11\u201319. ACM Press (1988)","DOI":"10.1145\/62212.62214"},{"key":"28_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/BFb0053420","volume-title":"Advances in Cryptology \u2014 EUROCRYPT\u201994","author":"L Csirmaz","year":"1995","unstructured":"Csirmaz, L.: The size of a share must be large. In: De Santis, A. (ed.) EUROCRYPT 1994. LNCS, vol. 950, pp. 13\u201322. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/BFb0053420"},{"issue":"3","key":"28_CR18","first-page":"429","volume":"32","author":"L Csirmaz","year":"1996","unstructured":"Csirmaz, L.: The dealer\u2019s random bits in perfect secret sharing schemes. Studia Scientiarum Mathematicarum Hungarica 32(3), 429\u2013438 (1996)","journal-title":"Studia Scientiarum Mathematicarum Hungarica"},{"key":"28_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1007\/978-3-662-48000-7_24","volume-title":"Advances in Cryptology \u2013 CRYPTO 2015","author":"R Gay","year":"2015","unstructured":"Gay, R., Kerenidis, I., Wee, H.: Communication complexity of conditional disclosure of secrets and attribute-based encryption. In: Gennaro, R., Robshaw, M. (eds.) CRYPTO 2015. LNCS, vol. 9216, pp. 485\u2013502. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48000-7_24"},{"key":"28_CR20","doi-asserted-by":"crossref","unstructured":"Gertner, Y., Ishai, Y., Kushilevitz, E., Malkin, T.: Protecting data privacy in private information retrieval schemes. In: 30th Annual ACM Symposium on Theory of Computing, Dallas, TX, USA, 23\u201326 May 1998, pp. 151\u2013160. ACM Press (1988)","DOI":"10.1145\/276698.276723"},{"issue":"9","key":"28_CR21","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1002\/ecjc.4430720906","volume":"72","author":"M Ito","year":"1989","unstructured":"Ito, M., Saito, A., Nishizeki, T.: Secret sharing scheme realizing general access structure. Electron. Commun. Jpn. (Part III Fundam. Electron. Sci.) 72(9), 56\u201364 (1989)","journal-title":"Electron. Commun. Jpn. (Part III Fundam. Electron. Sci.)"},{"key":"28_CR22","unstructured":"Karchmer, M., Wigderson, A.: On span programs. In: Proceedings of the Eighth Annual Structure in Complexity Theory Conference 1993, pp. 102\u2013111. IEEE (1993)"},{"issue":"1","key":"28_CR23","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1109\/TIT.1983.1056621","volume":"29","author":"E Karnin","year":"1983","unstructured":"Karnin, E., Greene, J., Hellman, M.: On secret sharing systems. IEEE Trans. Inf. Theory 29(1), 35\u201341 (1983)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"28_CR24","doi-asserted-by":"crossref","unstructured":"Larsen, K.G.: The cell probe complexity of dynamic range counting. In: Proceedings of the 44th Symposium on Theory of Computing Conference, STOC 2012, New York, NY, USA, 19\u201322 May 2012, pp. 85\u201394 (2012)","DOI":"10.1145\/2213977.2213987"},{"key":"28_CR25","doi-asserted-by":"crossref","unstructured":"Larsen, K.G.: Higher cell probe lower bounds for evaluating polynomials. In: 53rd Annual IEEE Symposium on Foundations of Computer Science, FOCS 2012, New Brunswick, NJ, USA, 20\u201323 October 2012, pp. 293\u2013301 (2012)","DOI":"10.1109\/FOCS.2012.21"},{"key":"28_CR26","doi-asserted-by":"crossref","unstructured":"Larsen, K.G., Nelson, J.: Optimality of the Johnson-Lindenstrauss lemma. In: 58th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2017, Berkeley, CA, USA, 15\u201317 October 2017, pp. 633\u2013638 (2017)","DOI":"10.1109\/FOCS.2017.64"},{"key":"28_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1007\/978-3-319-96881-0_18","volume-title":"Advances in Cryptology \u2013 CRYPTO 2018","author":"KG Larsen","year":"2018","unstructured":"Larsen, K.G., Nielsen, J.B.: Yes, there is an oblivious RAM lower bound!. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018. LNCS, vol. 10992, pp. 523\u2013542. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96881-0_18"},{"key":"28_CR28","doi-asserted-by":"crossref","unstructured":"Liu, T., Vaikuntanathan, V.: Breaking the circuit-size barrier in secret sharing. In: Diakonikolas, I., Kempe, D., Henzinger, M. (eds.) 50th Annual ACM Symposium on Theory of Computing, Los Angeles, CA, USA, 25\u201329 June 2018, pp. 699\u2013708. ACM Press (2018)","DOI":"10.1145\/3188745.3188936"},{"key":"28_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"758","DOI":"10.1007\/978-3-319-63688-7_25","volume-title":"Advances in Cryptology \u2013 CRYPTO 2017","author":"T Liu","year":"2017","unstructured":"Liu, T., Vaikuntanathan, V., Wee, H.: Conditional disclosure of secrets via non-linear reconstruction. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017. LNCS, vol. 10401, pp. 758\u2013790. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63688-7_25"},{"key":"28_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/978-3-642-40084-1_16","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"S Mart\u00edn","year":"2013","unstructured":"Mart\u00edn, S., Padr\u00f3, C., Yang, A.: Secret sharing, rank inequalities and information inequalities. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013. LNCS, vol. 8043, pp. 277\u2013288. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40084-1_16"},{"issue":"4","key":"28_CR31","doi-asserted-by":"publisher","first-page":"932","DOI":"10.1137\/S0097539705447256","volume":"35","author":"M P\u01cetra\u015fcu","year":"2006","unstructured":"P\u01cetra\u015fcu, M., Demaine, E.D.: Logarithmic lower bounds in the cell-probe model. SIAM J. Comput. 35(4), 932\u2013963 (2006)","journal-title":"SIAM J. Comput."},{"key":"28_CR32","doi-asserted-by":"crossref","unstructured":"P\u01cetra\u015fcu, M., Viola, E.: Cell-probe lower bounds for succinct partial sums. In: Proceedings of the 21st ACM\/SIAM Symposium on Discrete Algorithms (SODA), pp. 117\u2013122 (2010)","DOI":"10.1137\/1.9781611973075.11"},{"key":"28_CR33","doi-asserted-by":"crossref","unstructured":"Pitassi, T., Robere, R.: Lifting Nullstellensatz to monotone span programs over any field. In: Diakonikolas, I., Kempe, D., Henzinger, M. (eds.) 50th Annual ACM Symposium on Theory of Computing, Los Angeles, CA, USA, 25\u201329 June 2018, pp. 1207\u20131219. ACM Press (2018)","DOI":"10.1145\/3188745.3188914"},{"key":"28_CR34","doi-asserted-by":"crossref","unstructured":"Rabin, T., Ben-Or, M.: Verifiable secret sharing and multiparty protocols with honest majority (extended abstract). In: 21st Annual ACM Symposium on Theory of Computing, Seattle, WA, USA, 15\u201317 May 1989, pp. 73\u201385. ACM Press (1989)","DOI":"10.1145\/73007.73014"},{"issue":"11","key":"28_CR35","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":"1","key":"28_CR36","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1137\/110842211","volume":"42","author":"E Verbin","year":"2013","unstructured":"Verbin, E., Zhang, Q.: The limits of buffering: a tight lower bound for dynamic membership in the external memory model. SIAM J. Comput. 42(1), 212\u2013229 (2013)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Security and Cryptography for Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-57990-6_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,13]],"date-time":"2024-08-13T03:35:01Z","timestamp":1723520101000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-57990-6_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030579890","9783030579906"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-57990-6_28","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":"7 September 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SCN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Security and Cryptography for Networks","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Amalfi","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","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":"14 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"scn2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/scn.unisa.it\/","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":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"87","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":"33","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":"38% - 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","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":"8","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":"The conference was held virtually due to the COVID-19 pandemic.","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)"}}]}}