{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,8]],"date-time":"2025-04-08T22:10:15Z","timestamp":1744150215807,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030657444"},{"type":"electronic","value":"9783030657451"}],"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-65745-1_17","type":"book-chapter","created":{"date-parts":[[2020,12,18]],"date-time":"2020-12-18T08:03:25Z","timestamp":1608278605000},"page":"292-308","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["$$AC^0$$ Constructions of Secret Sharing Schemes \u2013 Accommodating New Parties"],"prefix":"10.1007","author":[{"given":"Shion Samadder","family":"Chaudhury","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sabyasachi","family":"Dutta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kouichi","family":"Sakurai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,12,19]]},"reference":[{"key":"17_CR1","doi-asserted-by":"crossref","unstructured":"Akavia, A., Bogdanov, A., Guo, S., Kamath, A., Rosen, A.: Candidate weak pseudorandom functions in ac0 mod2. In: Proceedings of the 5th Conference on Innovations in Theoretical Computer Science. pp. 251\u2013260 (2014)","DOI":"10.1145\/2554797.2554821"},{"key":"17_CR2","doi-asserted-by":"publisher","unstructured":"Applebaum, B., Ishai, Y., Kushilevitz, E.: Cryptography in nc$${}^{\\text{0}}$$. SIAM J. Comput. 36(4), 845\u2013888 (2006). https:\/\/doi.org\/10.1137\/S0097539705446950","DOI":"10.1137\/S0097539705446950"},{"key":"17_CR3","doi-asserted-by":"publisher","unstructured":"Applebaum, B., Ishai, Y., Kushilevitz, E.: Cryptography with constant input locality. J. Cryptology 22(4), 429\u2013469 (2009). https:\/\/doi.org\/10.1007\/s00145-009-9039-0","DOI":"10.1007\/s00145-009-9039-0"},{"key":"17_CR4","unstructured":"Ball, M., Rosen, A., Sabin, M., Vasudevan, P.N.: Average-case fine-grained hardness. Electronic Colloquium on Computational Complexity (ECCC) 24, 39 (2017), https:\/\/eccc.weizmann.ac.il\/report\/2017\/039"},{"key":"17_CR5","doi-asserted-by":"publisher","unstructured":"Beimel, A.: Secret-sharing schemes: A survey. In: Coding and Cryptology - Third International Workshop, IWCC 2011, Qingdao, China, May 30-June 3, 2011. pp. 11\u201346 (2011). https:\/\/doi.org\/10.1007\/978-3-642-20901-7_2","DOI":"10.1007\/978-3-642-20901-7_2"},{"key":"17_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/978-3-319-98113-0_17","volume-title":"Security and Cryptography for Networks","author":"A Beimel","year":"2018","unstructured":"Beimel, A., Othman, H.: Evolving ramp secret-sharing schemes. In: Catalano, D., De Prisco, R. (eds.) SCN 2018. LNCS, vol. 11035, pp. 313\u2013332. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-98113-0_17"},{"key":"17_CR7","doi-asserted-by":"publisher","unstructured":"Blakley, G.R.: Safeguarding cryptographic keys. In: IEEE Computer Society Managing Requirements Knowledge, International Workshop on. p. 313. Los Alamitos, CA, USA (1979). https:\/\/doi.org\/10.1109\/AFIPS.1979.98","DOI":"10.1109\/AFIPS.1979.98"},{"key":"17_CR8","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":"17_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/3-540-62494-5_14","volume-title":"Security Protocols","author":"L Chen","year":"1997","unstructured":"Chen, L., Gollmann, D., Mitchell, C.J.: Key escrow in mutually mistrusting domains. In: Lomas, M. (ed.) Security Protocols 1996. LNCS, vol. 1189, pp. 139\u2013153. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/3-540-62494-5_14"},{"key":"17_CR10","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1007\/978-3-319-70503-3_14","volume-title":"Theory of Cryptography","author":"K Cheng","year":"2017","unstructured":"Cheng, K., Ishai, Y., Li, X.: Near-optimal secret sharing and error correcting codes in $$ac0$$. In: Kalai, Y., Reyzin, L. (eds.) Theory of Cryptography, pp. 424\u2013458. Springer International Publishing, Cham (2017)"},{"key":"17_CR11","doi-asserted-by":"publisher","unstructured":"Cheraghchi, M.: Nearly optimal robust secret sharing. Designs, Codes and Cryptography 87(8), 1777\u20131796 (Aug 2019). https:\/\/doi.org\/10.1007\/s10623-018-0578-y","DOI":"10.1007\/s10623-018-0578-y"},{"key":"17_CR12","unstructured":"Desmedt, Y., Jajodia, S.: Redistributing secret shares to new access structures and its applications. In: George Mason University, Technical Report ISSE-TR-97-01, July (1997)"},{"key":"17_CR13","doi-asserted-by":"publisher","unstructured":"Desmedt, Y., Morozov, K.: Parity check based redistribution of secret shares. In: 2015 IEEE International Symposium on Information Theory (ISIT). pp. 959\u2013963 (2015). https:\/\/doi.org\/10.1109\/ISIT.2015.7282597","DOI":"10.1109\/ISIT.2015.7282597"},{"key":"17_CR14","doi-asserted-by":"publisher","unstructured":"Frankel, Y., Gemmell, P., MacKenzie, P.D., Moti Yung: Optimal-resilience proactive public-key cryptosystems. In: Proceedings 38th Annual Symposium on Foundations of Computer Science. pp. 384\u2013393 (1997). https:\/\/doi.org\/10.1109\/SFCS.1997.646127","DOI":"10.1109\/SFCS.1997.646127"},{"key":"17_CR15","doi-asserted-by":"publisher","unstructured":"Guruswami, V., Smith, A.D.: Optimal rate code constructions for computationally simple channels. J. ACM 63(4), 35:1\u201335:37 (2016). https:\/\/doi.org\/10.1145\/2936015","DOI":"10.1145\/2936015"},{"key":"17_CR16","doi-asserted-by":"publisher","unstructured":"Ito, M., Saito, A., Nishizeki, T.: Multiple assignment scheme for sharing secret. J. Cryptology 6(1), 15\u201320 (1993). https:\/\/doi.org\/10.1007\/BF02620229","DOI":"10.1007\/BF02620229"},{"key":"17_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1007\/978-3-662-53644-5_19","volume-title":"Theory of Cryptography","author":"I Komargodski","year":"2016","unstructured":"Komargodski, I., Naor, M., Yogev, E.: How to share a secret, infinitely. In: Hirt, M., Smith, A. (eds.) TCC 2016. LNCS, vol. 9986, pp. 485\u2013514. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53644-5_19"},{"key":"17_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/978-3-319-70503-3_12","volume-title":"Theory of Cryptography","author":"I Komargodski","year":"2017","unstructured":"Komargodski, I., Paskin-Cherniavsky, A.: Evolving secret sharing: dynamic thresholds and robustness. In: Kalai, Y., Reyzin, L. (eds.) TCC 2017. LNCS, vol. 10678, pp. 379\u2013393. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70503-3_12"},{"key":"17_CR19","unstructured":"Minsky, M., Papert, S.: Perceptrons. MIT Press (1969)"},{"key":"17_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BFb0053419","volume-title":"Advances in Cryptology \u2014 EUROCRYPT\u201994","author":"M Naor","year":"1995","unstructured":"Naor, M., Shamir, A.: Visual cryptography. In: De Santis, A. (ed.) EUROCRYPT 1994. LNCS, vol. 950, pp. 1\u201312. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/BFb0053419"},{"key":"17_CR21","doi-asserted-by":"publisher","unstructured":"Nojoumian, M., Stinson, D.R.: On dealer-free dynamic threshold schemes. Adv. in Math. of Comm. 7(1), 39\u201356 (2013). https:\/\/doi.org\/10.3934\/amc.2013.7.39","DOI":"10.3934\/amc.2013.7.39"},{"key":"17_CR22","doi-asserted-by":"publisher","unstructured":"Shamir, A.: How to share a secret. Commun. ACM 22(11), 612\u2013613 (1979). https:\/\/doi.org\/10.1145\/359168.359176","DOI":"10.1145\/359168.359176"},{"key":"17_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/3-540-46513-8_15","volume-title":"Selected Areas in Cryptography","author":"DR Stinson","year":"2000","unstructured":"Stinson, D.R., Wei, R.: Unconditionally secure proactive secret sharing scheme with combinatorial structures. In: Heys, H., Adams, C. (eds.) SAC 1999. LNCS, vol. 1758, pp. 200\u2013214. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-46513-8_15"}],"container-title":["Lecture Notes in Computer Science","Network and System Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-65745-1_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,18]],"date-time":"2020-12-18T08:41:40Z","timestamp":1608280900000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-65745-1_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030657444","9783030657451"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-65745-1_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"19 December 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"NSS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Network and System Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Melbourne, VIC","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","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":"25 November 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 November 2020","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":"nss2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/nsclab.org\/nss2020\/","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":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"60","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":"17","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":"9","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":"28% - 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,2","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":"2,75","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 the 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)"}}]}}