{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,14]],"date-time":"2025-11-14T07:39:32Z","timestamp":1763105972369,"version":"3.40.3"},"publisher-location":"Cham","reference-count":55,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031491863"},{"type":"electronic","value":"9783031491870"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-49187-0_17","type":"book-chapter","created":{"date-parts":[[2023,11,30]],"date-time":"2023-11-30T12:02:36Z","timestamp":1701345756000},"page":"327-347","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Evolving Conditional Disclosure of\u00a0Secrets"],"prefix":"10.1007","author":[{"given":"Naty","family":"Peter","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,12,1]]},"reference":[{"key":"17_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":"17_CR2","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"},{"key":"17_CR3","doi-asserted-by":"crossref","unstructured":"Applebaum, B., Beimel, A., Nir, O., Peter, N.: Better secret sharing via robust conditional disclosure of secrets. In: STOC 2020, pp. 280\u2013293. ACM (2020)","DOI":"10.1145\/3357713.3384293"},{"key":"17_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1007\/978-3-030-84252-9_21","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"B Applebaum","year":"2021","unstructured":"Applebaum, B., Nir, O.: Upslices, downslices, and secret-sharing with complexity of $$1.5^n$$. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021. LNCS, vol. 12827, pp. 627\u2013655. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84252-9_21"},{"key":"17_CR5","doi-asserted-by":"crossref","unstructured":"Boyle, E., Couteau, G., Gilboa, N., Ishai, Y., Orr\u00f9, M.: Homomorphic secret sharing: optimizations and applications. In: CCS 2017, pp. 2105\u20132122. ACM (2017)","DOI":"10.1145\/3133956.3134107"},{"issue":"2","key":"17_CR6","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/BF00196772","volume":"4","author":"EF Brickell","year":"1991","unstructured":"Brickell, E.F., Davenport, D.M.: On the classification of ideal secret sharing schemes. J. Cryptol. 4(2), 123\u2013134 (1991)","journal-title":"J. Cryptol."},{"key":"17_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/978-3-662-46803-6_12","volume-title":"Advances in Cryptology - EUROCRYPT 2015","author":"E Boyle","year":"2015","unstructured":"Boyle, E., Gilboa, N., Ishai, Y.: Function secret sharing. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015. LNCS, vol. 9057, pp. 337\u2013367. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46803-6_12"},{"key":"17_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1007\/978-3-662-53018-4_19","volume-title":"Advances in Cryptology \u2013 CRYPTO 2016","author":"E Boyle","year":"2016","unstructured":"Boyle, E., Gilboa, N., Ishai, Y.: Breaking the circuit size barrier for secure computation under DDH. In: Robshaw, M., Katz, J. (eds.) CRYPTO 2016. LNCS, vol. 9814, pp. 509\u2013539. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53018-4_19"},{"key":"17_CR9","doi-asserted-by":"crossref","unstructured":"Boyle, E., Gilboa, N., Ishai, Y.: Function secret sharing: improvements and extensions. In: CCS 2016, pp. 1292\u20131303. ACM (2016)","DOI":"10.1145\/2976749.2978429"},{"key":"17_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/3-540-57220-1_53","volume-title":"Advances in Cryptology \u2014 AUSCRYPT \u201992","author":"M Bertilsson","year":"1993","unstructured":"Bertilsson, M., Ingemarsson, I.: A construction of practical secret sharing schemes using linear block codes. In: Seberry, J., Zheng, Y. (eds.) AUSCRYPT 1992. LNCS, vol. 718, pp. 67\u201379. Springer, Heidelberg (1993). https:\/\/doi.org\/10.1007\/3-540-57220-1_53"},{"key":"17_CR11","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"},{"key":"17_CR12","doi-asserted-by":"crossref","unstructured":"Blakley, G.R.: Safeguarding cryptographic keys. In: AFIPS NCC 1979, volume 48 of AFIPS Conference proceedings, pp. 313\u2013317. AFIPS Press (1979)","DOI":"10.1109\/MARK.1979.8817296"},{"key":"17_CR13","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_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1007\/978-3-030-45721-1_19","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2020","author":"A Beimel","year":"2020","unstructured":"Beimel, A., Othman, H.: Evolving ramp secret sharing with a small gap. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020. LNCS, vol. 12105, pp. 529\u2013555. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45721-1_19"},{"key":"17_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"748","DOI":"10.1007\/978-3-030-84252-9_25","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"A Beimel","year":"2021","unstructured":"Beimel, A., Othman, H., Peter, N.: Quadratic secret sharing and conditional disclosure of secrets. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021. LNCS, vol. 12827, pp. 748\u2013778. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84252-9_25"},{"key":"17_CR16","doi-asserted-by":"crossref","unstructured":"Beimel, A., Othman, H., Peter, N.: Quadratic secret sharing and conditional disclosure of secrets. IEEE Trans. Inf. Theory (2023)","DOI":"10.1109\/TIT.2023.3296588"},{"key":"17_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1007\/978-3-030-03332-3_13","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2018","author":"A Beimel","year":"2018","unstructured":"Beimel, A., Peter, N.: Optimal linear multiparty conditional disclosure of secrets protocols. In: Peyrin, T., Galbraith, S. (eds.) ASIACRYPT 2018. LNCS, vol. 11274, pp. 332\u2013362. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03332-3_13"},{"key":"17_CR18","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). https:\/\/doi.org\/10.1007\/3-540-60693-9_22"},{"key":"17_CR19","doi-asserted-by":"publisher","unstructured":"Chaudhury, S.S., Dutta, S., Sakurai, K.: $$AC^0$$ constructions of secret sharing schemes - accommodating new parties. In: Kutylowski, M., Zhang, J., Chen, C. (eds.) Network and System Security, NSS 2020. LNCS, vol. 12570, pp. 292\u2013308. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-65745-1_17","DOI":"10.1007\/978-3-030-65745-1_17"},{"key":"17_CR20","doi-asserted-by":"crossref","unstructured":"Chaudhury, S.S., Dutta, S., Sakurai, K.: Perpetual secret sharing from dynamic data structures. In: DSC 2021, pp. 1\u20138. IEEE (2021)","DOI":"10.1109\/DSC49826.2021.9346272"},{"key":"17_CR21","doi-asserted-by":"crossref","unstructured":"Chor, B., Goldwasser, S., Micali, S., Awerbuch, B.: Verifiable secret sharing and achieving simultaneity in the presence of faults (extended abstract). In: FOCS 1985, pp. 383\u2013395. IEEE Computer Society (1985)","DOI":"10.1109\/SFCS.1985.64"},{"issue":"12","key":"17_CR22","doi-asserted-by":"crossref","first-page":"3936","DOI":"10.1007\/s10773-020-04644-5","volume":"59","author":"SS Chaudhury","year":"2020","unstructured":"Chaudhury, S.S.: A quantum evolving secret sharing scheme. Int. J. Theor. Phys. 59(12), 3936\u20133950 (2020)","journal-title":"Int. J. Theor. Phys."},{"issue":"5 & 6","key":"17_CR23","first-page":"0385","volume":"21","author":"SS Chaudhury","year":"2022","unstructured":"Chaudhury, S.S.: On quantum evolving secret sharing schemes - further studies and improvements. Quantum Inf. Comput. 21(5 & 6), 0385\u20130407 (2022)","journal-title":"Quantum Inf. Comput."},{"key":"17_CR24","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":"17_CR25","first-page":"429","volume":"32","author":"L Csirmaz","year":"1996","unstructured":"Csirmaz, L.: The dealer\u2019s random bits in perfect secret sharing schemes. Stud. Sci. Math. Hung. 32(3), 429\u2013438 (1996)","journal-title":"Stud. Sci. Math. Hung."},{"issue":"4","key":"17_CR26","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1007\/s001459900029","volume":"10","author":"L Csirmaz","year":"1997","unstructured":"Csirmaz, L.: The size of a share must be large. J. Cryptol. 10(4), 223\u2013231 (1997)","journal-title":"J. Cryptol."},{"issue":"1","key":"17_CR27","doi-asserted-by":"crossref","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 Cryptogr. 63(1), 127\u2013147 (2012)","journal-title":"Des. Codes Cryptogr."},{"key":"17_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/978-3-030-31578-8_16","volume-title":"Cryptology and Network Security","author":"Y Desmedt","year":"2019","unstructured":"Desmedt, Y., Dutta, S., Morozov, K.: Evolving perfect hash families: a\u00a0combinatorial viewpoint of evolving secret sharing. In: Mu, Y., Deng, R.H., Huang, X. (eds.) CANS 2019. LNCS, vol. 11829, pp. 291\u2013307. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-31578-8_16"},{"key":"17_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/978-3-642-15317-4_9","volume-title":"Security and Cryptography for Networks","author":"F Dav\u00ec","year":"2010","unstructured":"Dav\u00ec, F., Dziembowski, S., Venturi, D.: Leakage-resilient storage. In: Garay, J.A., De Prisco, R. (eds.) SCN 2010. LNCS, vol. 6280, pp. 121\u2013137. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15317-4_9"},{"key":"17_CR30","doi-asserted-by":"crossref","unstructured":"Dziembowski, S., Pietrzak,K.: Intrusion-resilient secret sharing. In: FOCS 2007, pp. 227\u2013237. IEEE Computer Society (2007)","DOI":"10.1109\/FOCS.2007.63"},{"key":"17_CR31","unstructured":"D\u2019Arco, P., De Prisco, R., De Santis, A., P\u00e9rez del Pozo, A.L., Vaccaro, U.: Probabilistic secret sharing. In: MFCS 2018, volume 117 of LIPIcs, pp. 64:1\u201364:16. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2018)"},{"key":"17_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1007\/978-3-030-39303-8_14","volume-title":"Information Security Applications","author":"S Dutta","year":"2020","unstructured":"Dutta, S., Roy, P.S., Fukushima, K., Kiyomoto, S., Sakurai, K.: Secret sharing on evolving multi-level access structure. In: You, I. (ed.) WISA 2019. LNCS, vol. 11897, pp. 180\u2013191. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-39303-8_14"},{"key":"17_CR33","doi-asserted-by":"crossref","unstructured":"Feldman, P.: A practical scheme for non-interactive verifiable secret sharing. In: FOCS 1987, pp. 427\u2013437. IEEE Computer Society (1987)","DOI":"10.1109\/SFCS.1987.4"},{"issue":"3","key":"17_CR34","doi-asserted-by":"crossref","first-page":"592","DOI":"10.1006\/jcss.1999.1689","volume":"60","author":"Y Gertner","year":"2000","unstructured":"Gertner, Y., Ishai, Y., Kushilevitz, E., Malkin, T.: Protecting data privacy in private information retrieval schemes. J. Comput. Syst. Sci. 60(3), 592\u2013629 (2000)","journal-title":"J. Comput. Syst. Sci."},{"key":"17_CR35","doi-asserted-by":"crossref","unstructured":"Goyal, V., Kumar, A.: Non-malleable secret sharing. In: STOC 2018, pp. 685\u2013698. ACM (2018)","DOI":"10.1145\/3188745.3188872"},{"key":"17_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. LNCS, vol. 10991, pp. 501\u2013530. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96884-1_17"},{"key":"17_CR37","doi-asserted-by":"crossref","first-page":"1829","DOI":"10.1103\/PhysRevA.59.1829","volume":"59","author":"M Hillery","year":"1999","unstructured":"Hillery, M., Bu\u017eek, V., Berthiaume, A.: Quantum secret sharing. Phys. Rev. A 59, 1829\u20131834 (1999)","journal-title":"Phys. Rev. A"},{"key":"17_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/3-540-44750-4_27","volume-title":"Advances in Cryptology \u2014 CRYPT0\u2019 95","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). https:\/\/doi.org\/10.1007\/3-540-44750-4_27"},{"key":"17_CR39","unstructured":"Ito, M., Saito, A., Nishizeki, T.: Secret sharing scheme realizing general access structure, pp. 99\u2013102 (1987)"},{"issue":"1","key":"17_CR40","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/BF02620229","volume":"6","author":"M Ito","year":"1993","unstructured":"Ito, M., Saio, A., Nishizeki, T.: Multiple assignment scheme for sharing secret. J. Cryptol. 6(1), 15\u201320 (1993)","journal-title":"J. Cryptol."},{"key":"17_CR41","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1103\/PhysRevA.59.162","volume":"59","author":"A Karlsson","year":"1999","unstructured":"Karlsson, A., Koashi, M., Imoto, N.: Quantum entanglement for secret sharing and secret splitting. Phys. Rev. A 59, 162\u2013168 (1999)","journal-title":"Phys. Rev. A"},{"key":"17_CR42","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_CR43","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_CR44","doi-asserted-by":"crossref","unstructured":"Karchmer, M., Wigderson, A.: On span programs. In: SCT 1993, pp. 102\u2013111. IEEE Computer Society (1993)","DOI":"10.1109\/SCT.1993.336536"},{"key":"17_CR45","doi-asserted-by":"crossref","unstructured":"Liu, T., Vaikuntanathan, V.: Breaking the circuit-size barrier in secret sharing. In: STOC 2018, pp. 699\u2013708. ACM (2018)","DOI":"10.1145\/3188745.3188936"},{"key":"17_CR46","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"567","DOI":"10.1007\/978-3-319-78381-9_21","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2018","author":"T Liu","year":"2018","unstructured":"Liu, T., Vaikuntanathan, V., Wee, H.: Towards breaking the exponential barrier for general secret sharing. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018. LNCS, vol. 10820, pp. 567\u2013596. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78381-9_21"},{"key":"17_CR47","unstructured":"Mazor, N.: A lower bound on the share size in evolving secret sharing. In: ITC 2023, volume 267 of LIPIcs, pp. 2:1\u20132:9. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2023)"},{"key":"17_CR48","unstructured":"Okamura, R., Koga, H.: New constructions of an evolving $$2$$-threshold scheme based on binary or $$D$$-ary prefix codes. In: ISITA 2020, pp. 432\u2013436. IEEE (2020)"},{"key":"17_CR49","doi-asserted-by":"crossref","unstructured":"Pramanik, J., Adhikari, A.: Evolving secret sharing with essential participants. IACR Cryptol. ePrint Arch., 1035 (2020)","DOI":"10.1007\/978-981-15-7834-2_64"},{"key":"17_CR50","doi-asserted-by":"crossref","unstructured":"Pramanik, J., Adhikari, A.: Evolving secret sharing in almost semi-honest model. IACR Cryptol. ePrint Arch., 1156 (2021)","DOI":"10.1007\/978-3-030-90553-8_9"},{"key":"17_CR51","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/978-3-030-85987-9_5","volume-title":"Advances in Information and Computer Security","author":"K Phalakarn","year":"2021","unstructured":"Phalakarn, K., Suppakitpaisarn, V., Attrapadung, N., Matsuura, K.: Evolving homomorphic secret sharing for hierarchical access structures. In: Nakanishi, T., Nojima, R. (eds.) IWSEC 2021. LNCS, vol. 12835, pp. 77\u201396. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-85987-9_5"},{"issue":"11","key":"17_CR52","doi-asserted-by":"crossref","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":"17_CR53","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"},{"key":"17_CR54","unstructured":"Xing, C., Yuan, C.: Evolving secret sharing schemes based on polynomial evaluations and algebraic geometry codes. IACR Cryptol. ePrint Arch., 1115 (2021)"},{"issue":"5","key":"17_CR55","doi-asserted-by":"crossref","first-page":"2906","DOI":"10.1109\/TCOMM.2023.3253720","volume":"71","author":"W Yan","year":"2023","unstructured":"Yan, W., Lin, S.-J., Han, Y.S.: A new metric and the construction for evolving $$2$$-threshold secret sharing schemes based on prefix coding of integers. IEEE Trans. Commun. 71(5), 2906\u20132915 (2023)","journal-title":"IEEE Trans. Commun."}],"container-title":["Lecture Notes in Computer Science","Information Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-49187-0_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,8]],"date-time":"2025-04-08T21:35:36Z","timestamp":1744148136000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-49187-0_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031491863","9783031491870"],"references-count":55,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-49187-0_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"1 December 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ISC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Information Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Groningen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Netherlands","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 November 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 November 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"isw2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/isc23.cs.rug.nl\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}