{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T19:54:39Z","timestamp":1743105279982,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030315771"},{"type":"electronic","value":"9783030315788"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","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":[[2019]]},"DOI":"10.1007\/978-3-030-31578-8_17","type":"book-chapter","created":{"date-parts":[[2019,10,10]],"date-time":"2019-10-10T23:04:24Z","timestamp":1570748664000},"page":"308-327","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Threshold Changeable Ramp Secret Sharing"],"prefix":"10.1007","author":[{"given":"Fuchun","family":"Lin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"San","family":"Ling","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huaxiong","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Neng","family":"Zeng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,10,11]]},"reference":[{"key":"17_CR1","doi-asserted-by":"crossref","unstructured":"Blakley, G.R., et al.: Safeguarding cryptographic keys. In: Proceedings of the National Computer Conference, vol. 48 (1979)","DOI":"10.1109\/MARK.1979.8817296"},{"issue":"11","key":"17_CR2","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"},{"key":"17_CR3","unstructured":"Desmedty, Y., Jajodiay, S.: Redistributing secret shares to new access structures and its applications (1997)"},{"key":"17_CR4","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"},{"key":"17_CR5","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\u2014CRYPTO 1993","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"},{"issue":"2","key":"17_CR6","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":"8","key":"17_CR7","doi-asserted-by":"publisher","first-page":"638","DOI":"10.1093\/comjnl\/42.8.638","volume":"42","author":"KM Martin","year":"1999","unstructured":"Martin, K.M., Safavi-Naini, R., Wang, H.: Bounds and techniques for efficient redistribution of secret shares to new access structures. Comput. J. 42(8), 638\u2013649 (1999)","journal-title":"Comput. J."},{"key":"17_CR8","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"},{"issue":"1","key":"17_CR9","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":"17_CR10","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."},{"key":"17_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."},{"issue":"7","key":"17_CR12","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":"4","key":"17_CR13","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."},{"key":"17_CR14","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)"},{"issue":"12","key":"17_CR15","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"},{"issue":"2","key":"17_CR16","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"},{"issue":"6","key":"17_CR17","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":"17_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"692","DOI":"10.1007\/3-540-56503-5_68","volume-title":"STACS 1993","author":"C Blundo","year":"1993","unstructured":"Blundo, C., De Santis, A., Vaccaro, U.: Efficient sharing of many secrets. In: Enjalbert, P., Finkel, A., Wagner, K.W. (eds.) STACS 1993. LNCS, vol. 665, pp. 692\u2013703. Springer, Heidelberg (1993). https:\/\/doi.org\/10.1007\/3-540-56503-5_68"}],"container-title":["Lecture Notes in Computer Science","Cryptology and Network Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-31578-8_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T11:19:16Z","timestamp":1710242356000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-31578-8_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030315771","9783030315788"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-31578-8_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"11 October 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CANS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Cryptology and Network Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Fuzhou","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 October 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 October 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cans2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cans2019.cn\/","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":"55","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":"21","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":"8","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":"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)"}}]}}