{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:21:54Z","timestamp":1740122514526,"version":"3.37.3"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2023,3,23]],"date-time":"2023-03-23T00:00:00Z","timestamp":1679529600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,3,23]],"date-time":"2023-03-23T00:00:00Z","timestamp":1679529600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["U1705264","61572132"],"award-info":[{"award-number":["U1705264","61572132"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003392","name":"Natural Science Foundation of Fujian Province","doi-asserted-by":"publisher","award":["2019J01275"],"award-info":[{"award-number":["2019J01275"]}],"id":[{"id":"10.13039\/501100003392","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100009558","name":"University Natural Science Research Project of Anhui Province","doi-asserted-by":"publisher","award":["KJ2020A0779"],"award-info":[{"award-number":["KJ2020A0779"]}],"id":[{"id":"10.13039\/501100009558","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000266","name":"EPSRC","doi-asserted-by":"crossref","award":["EP\/S021043\/1"],"award-info":[{"award-number":["EP\/S021043\/1"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001459","name":"Singapore Ministry of Education","doi-asserted-by":"crossref","award":["RG12\/19","RG21\/18 (S)"],"award-info":[{"award-number":["RG12\/19","RG21\/18 (S)"]}],"id":[{"id":"10.13039\/501100001459","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2023,7]]},"DOI":"10.1007\/s10623-023-01205-9","type":"journal-article","created":{"date-parts":[[2023,3,23]],"date-time":"2023-03-23T15:03:16Z","timestamp":1679583796000},"page":"2421-2447","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Full threshold change range of threshold changeable secret sharing"],"prefix":"10.1007","volume":"91","author":[{"given":"Jian","family":"Ding","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2868-3398","authenticated-orcid":false,"given":"Changlu","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fuchun","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huaxiong","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,3,23]]},"reference":[{"issue":"2","key":"1205_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., 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"},{"key":"1205_CR2","doi-asserted-by":"crossref","unstructured":"Bitar R., El Rouayheb S.: Staircase codes for secret sharing with optimal communication and read overheads. In: ISIT 2016, pp. 1396\u20131400. IEEE, Barcelona, Spain (2016).","DOI":"10.1109\/ISIT.2016.7541528"},{"issue":"6","key":"1205_CR3","doi-asserted-by":"crossref","first-page":"4191","DOI":"10.1109\/TIT.2018.2823326","volume":"64","author":"R Bitar","year":"2018","unstructured":"Bitar R., El Rouayheb S.: Staircase codes for secret sharing with optimal communication and read overheads. IEEE Trans. Inf. Theory 64(6), 4191\u20134206 (2018).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1205_CR4","doi-asserted-by":"crossref","unstructured":"Blakley G.R.: Safeguarding cryptographic keys. In: Proceedings of the National Computer Conference\u20191979, AFIPS Proceedings, vol. 48, pp. 313\u2013317 (1979).","DOI":"10.1109\/MARK.1979.8817296"},{"key":"1205_CR5","doi-asserted-by":"crossref","unstructured":"Blakley G.R., Meadows C.: Security of ramp schemes. In: Advances in Cryptology-CRYPTO\u20191984, vol. 196, pp. 242\u2013268. Lecture Notes in Computer Science. Springer, Berlin (1985).","DOI":"10.1007\/3-540-39568-7_20"},{"key":"1205_CR6","doi-asserted-by":"crossref","unstructured":"Blundo C., Cresti A., De Santis A., Vaccaro U.: Fully dynamic secret sharing schemes. In: Advances in Cryptology-CRYPTO\u20191993, vol. 773, pp. 110\u2013125. Lecture Notes in Computer Science. Springer, Berlin (1993).","DOI":"10.1007\/3-540-48329-2_10"},{"key":"1205_CR7","doi-asserted-by":"crossref","unstructured":"Bogdanov A., Guo S., Komargodski I.: Threshold secret sharing requires a linear size alphabet. In: TCC 2016, vol. 9986, pp. 471\u2013484. LNCS. Springer, Heidelberg (2016).","DOI":"10.1007\/978-3-662-53644-5_18"},{"key":"1205_CR8","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":"1205_CR9","doi-asserted-by":"crossref","unstructured":"Desmedt Y.: Threshold cryptography. In: Encyclopedia of Cryptography and Security, pp. 1288\u20131293. Springer, Boston (2011).","DOI":"10.1007\/978-1-4419-5906-5_330"},{"key":"1205_CR10","unstructured":"Desmedty Y., Jajodiay S.: Redistributing secret shares to new access structures and its applications. Technical Report ISSE TR-97-01, George Mason University, Fairfax (1997)."},{"key":"1205_CR11","doi-asserted-by":"crossref","unstructured":"Ding J., Lin C., Lin F.: Optimal threshold secret sharing with new threshold change range. In: K. Nguyen et al. (eds.) ProvSec 2020, Lecture Notes in Computer Science 12505, pp. 361\u2013378 (2020).","DOI":"10.1007\/978-3-030-62576-4_18"},{"issue":"1","key":"1205_CR12","doi-asserted-by":"publisher","first-page":"659","DOI":"10.1109\/TIT.2021.3123692","volume":"68","author":"J Ding","year":"2022","unstructured":"Ding J., Lin C., Wang H., Xing C.: Communication efficient secret sharing with small share size. IEEE Trans. Inf. Theory 68(1), 659\u2013669 (2022).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1205_CR13","doi-asserted-by":"crossref","unstructured":"Huang W., Bruck J.: Secret sharing with optimal decoding and repair bandwidth. In: IEEE International Symposium on Information Theory (ISIT), pp. 1813\u20131817 (2017).","DOI":"10.1109\/ISIT.2017.8006842"},{"issue":"12","key":"1205_CR14","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":"1205_CR15","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":"1205_CR16","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."},{"key":"1205_CR17","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, pp. 53:1\u201353:20 (2018)."},{"key":"1205_CR18","doi-asserted-by":"crossref","unstructured":"Lin F., Ling S., Wang H., Zeng N.: Threshold changeable ramp secret sharing. In: Cryptology and Network Security. CANS 2019. Lecture Notes in Computer Science, vol. 11829, pp. 308\u2013327. Springer, Cham (2019).","DOI":"10.1007\/978-3-030-31578-8_17"},{"key":"1205_CR19","doi-asserted-by":"crossref","unstructured":"Martin K.M., Pieprzyk J., Safavi-Naini R., Wang H.: Changing thresholds in the absence of secure channels. In: Information Security and Privacy. ACISP 1999. Lecture Notes in Computer Science, vol. 1587, pp. 177\u2013191. Springer, Berlin (1999).","DOI":"10.1007\/3-540-48970-3_15"},{"key":"1205_CR20","doi-asserted-by":"crossref","unstructured":"Maeda A., Miyaji A., Tada M.: Efficient and unconditionally secure verifiable threshold changeable scheme. In: Information Security and Privacy. ACISP 2001. Lecture Notes in Computer Science, vol. 2119, pp. 403\u2013416. Springer, Berlin (2001).","DOI":"10.1007\/3-540-47719-5_32"},{"issue":"6","key":"1205_CR21","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":"1205_CR22","doi-asserted-by":"crossref","unstructured":"Nielsen J.B., Simkin M.: Lower bounds for leakage-resilient secret sharing. In: Advances in Cryptology-EUROCRYPT\u20192020. Lecture Notes in Computer Science, vol. 12105, pp. 556\u2013577. Springer, New York (2020).","DOI":"10.1007\/978-3-030-45721-1_20"},{"issue":"11","key":"1205_CR23","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":"1205_CR24","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":"1205_CR25","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":"1205_CR26","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":"1205_CR27","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. Theoret. Comput. Sci. 418, 106\u2013115 (2012).","journal-title":"Theoret. Comput. Sci."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-023-01205-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-023-01205-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-023-01205-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,12]],"date-time":"2023-06-12T17:12:39Z","timestamp":1686589959000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-023-01205-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3,23]]},"references-count":27,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2023,7]]}},"alternative-id":["1205"],"URL":"https:\/\/doi.org\/10.1007\/s10623-023-01205-9","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[2023,3,23]]},"assertion":[{"value":"24 November 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 February 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 February 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 March 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}