{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,19]],"date-time":"2025-11-19T07:03:16Z","timestamp":1763535796219,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030625757"},{"type":"electronic","value":"9783030625764"}],"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-62576-4_18","type":"book-chapter","created":{"date-parts":[[2020,11,20]],"date-time":"2020-11-20T01:57:56Z","timestamp":1605837476000},"page":"361-378","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Optimal Threshold Changeable Secret Sharing with New Threshold Change Range"],"prefix":"10.1007","author":[{"given":"Jian","family":"Ding","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Changlu","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fuchun","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,11,20]]},"reference":[{"issue":"2","key":"18_CR1","doi-asserted-by":"publisher","first-page":"620","DOI":"10.1109\/TIT.2004.840857","volume":"51","author":"SG Barwick","year":"2005","unstructured":"Barwick, S.G., Jackson, W.-A., Martin, K.M.: Updating the parameters of a threshold scheme by minimal broadcast. IEEE Trans. Inf. Theory 51(2), 620\u2013633 (2005)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"18_CR2","doi-asserted-by":"publisher","first-page":"933","DOI":"10.1109\/TIT.2017.2723019","volume":"64","author":"R Bitar","year":"2017","unstructured":"Bitar, R., El Rouayheb, S.: Staircase codes for secret sharing with optimal communication and read overheads. IEEE Trans. Inf. Theory 64(2), 933\u2013943 (2017)","journal-title":"IEEE Trans. Inf. Theory"},{"doi-asserted-by":"crossref","unstructured":"Blakley, G.R.: Safeguarding cryptographic keys. In: Proceedings of the National Computer Conference, vol. 48 (1979)","key":"18_CR3","DOI":"10.1109\/MARK.1979.8817296"},{"key":"18_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/3-540-48329-2_10","volume-title":"Advances in Cryptology \u2014 CRYPTO\u201993","author":"C Blundo","year":"1994","unstructured":"Blundo, C., Cresti, A., De Santis, A., Vaccaro, U.: Fully dynamic secret sharing schemes. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol. 773, pp. 110\u2013125. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-48329-2_10"},{"key":"18_CR5","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":"18_CR6","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107337756","volume-title":"Secure Multiparty Computation and Secret Sharing","author":"R Cramer","year":"2015","unstructured":"Cramer, R., Damg\u00e5rd, I., Nielsen, J.B.: Secure Multiparty Computation and Secret Sharing. Cambridge University Press, Cambridge (2015)"},{"key":"18_CR7","first-page":"1288","volume-title":"Threshold Cryptography","author":"Y Desmedt","year":"2011","unstructured":"Desmedt, Y.: Threshold Cryptography, pp. 1288\u20131293. Springer, Boston (2011)"},{"unstructured":"Desmedty, Y., Jajodiay, S.: Redistributing secret shares to new access structures and its applications (1997)","key":"18_CR8"},{"issue":"12","key":"18_CR9","doi-asserted-by":"publisher","first-page":"7195","DOI":"10.1109\/TIT.2016.2616144","volume":"62","author":"W Huang","year":"2016","unstructured":"Huang, W., Langberg, M., Kliewer, J., Bruck, J.: Communication efficient secret sharing. IEEE Trans. Inf. Theory 62(12), 7195\u20137206 (2016)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"18_CR10","first-page":"51","volume":"14","author":"W-A Jackson","year":"1996","unstructured":"Jackson, W.-A., Martin, K.M.: A combinatorial interpretation of ramp schemes. Australas. J. Comb. 14, 51\u201360 (1996)","journal-title":"Australas. J. Comb."},{"key":"18_CR11","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/j.ins.2018.09.024","volume":"473","author":"X Jia","year":"2019","unstructured":"Jia, X., Wang, D., Nie, D., Luo, X., Sun, J.Z.: A new threshold changeable secret sharing scheme based on the chinese remainder theorem. Inf. Sci. 473, 13\u201330 (2019)","journal-title":"Inf. Sci."},{"unstructured":"Lin, F., Cheraghchi, M., Guruswami, V., Safavi-Naini, R., Wang, H.: Secret sharing with binary shares. In: 10th Innovations in Theoretical Computer Science Conference (ITCS 2019). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2018)","key":"18_CR12"},{"key":"18_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1007\/978-3-030-31578-8_17","volume-title":"Cryptology and Network Security","author":"F Lin","year":"2019","unstructured":"Lin, F., Ling, S., Wang, H., Zeng, N.: Threshold changeable ramp secret sharing. In: Mu, Y., Deng, R.H., Huang, X. (eds.) CANS 2019. LNCS, vol. 11829, pp. 308\u2013327. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-31578-8_17"},{"key":"18_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/3-540-47719-5_32","volume-title":"Information Security and Privacy","author":"A Maeda","year":"2001","unstructured":"Maeda, A., Miyaji, A., Tada, M.: Efficient and unconditionally secure verifiable threshold changeable scheme. In: Varadharajan, V., Mu, Y. (eds.) ACISP 2001. LNCS, vol. 2119, pp. 403\u2013416. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-47719-5_32"},{"key":"18_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/3-540-48970-3_15","volume-title":"Information Security and Privacy","author":"KM Martin","year":"1999","unstructured":"Martin, K.M., Pieprzyk, J., Safavi-Naini, R., Wang, H.: Changing thresholds in the absence of secure channels. In: Pieprzyk, J., Safavi-Naini, R., Seberry, J. (eds.) ACISP 1999. LNCS, vol. 1587, pp. 177\u2013191. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48970-3_15"},{"issue":"6","key":"18_CR16","doi-asserted-by":"publisher","first-page":"4191","DOI":"10.1109\/TIT.2018.2823326","volume":"64","author":"U Mart\u00ednez-Pe\u00f1as","year":"2018","unstructured":"Mart\u00ednez-Pe\u00f1as, U.: Communication efficient and strongly secure secret sharing schemes based on algebraic geometry codes. IEEE Trans. Inf. Theory 64(6), 4191\u20134206 (2018)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"18_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"556","DOI":"10.1007\/978-3-030-45721-1_20","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2020","author":"JB Nielsen","year":"2020","unstructured":"Nielsen, J.B., Simkin, M.: Lower bounds for leakage-resilient secret sharing. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020. LNCS, vol. 12105, pp. 556\u2013577. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45721-1_20"},{"issue":"11","key":"18_CR18","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":"4","key":"18_CR19","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1016\/j.ffa.2005.04.007","volume":"12","author":"R Steinfeld","year":"2006","unstructured":"Steinfeld, R., Pieprzyk, J., Wang, H.: Lattice-based threshold-changeability for standard CRT secret-sharing schemes. Finite Fields Appl. 12(4), 653\u2013680 (2006)","journal-title":"Finite Fields Appl."},{"issue":"7","key":"18_CR20","doi-asserted-by":"publisher","first-page":"2542","DOI":"10.1109\/TIT.2007.899541","volume":"53","author":"R Steinfeld","year":"2007","unstructured":"Steinfeld, R., Pieprzyk, J., Wang, H.: Lattice-based threshold changeability for standard shamir secret-sharing schemes. IEEE Trans. Inf. Theory 53(7), 2542\u20132559 (2007)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"18_CR21","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1109\/TIT.2007.911179","volume":"54","author":"H Wang","year":"2008","unstructured":"Wang, H., Wong, D.S.: On secret reconstruction in secret sharing schemes. IEEE Trans. Inf. Theory 54(1), 473\u2013480 (2008)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"18_CR22","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/j.tcs.2011.09.027","volume":"418","author":"Z Zhang","year":"2012","unstructured":"Zhang, Z., Chee, Y.M., Ling, S., Liu, M., Wang, H.: Threshold changeable secret sharing schemes revisited. Theory Comput. Sci. 418, 106\u2013115 (2012)","journal-title":"Theory Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Provable and Practical Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-62576-4_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,24]],"date-time":"2021-04-24T00:29:49Z","timestamp":1619224189000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-62576-4_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030625757","9783030625764"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-62576-4_18","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":"20 November 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ProvSec","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Provable Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Singapore","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Singapore","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":"29 November 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 December 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":"provsec2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/scripts.ntu.edu.sg\/NewsnEvents\/Pages\/Events-PROVSEC2020.aspx","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":"59","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":"20","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":"34% - 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","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":"4","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)"}}]}}