{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T19:26:44Z","timestamp":1743103604062,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030337155"},{"type":"electronic","value":"9783030337162"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[[2019]]},"DOI":"10.1007\/978-3-030-33716-2_10","type":"book-chapter","created":{"date-parts":[[2019,10,25]],"date-time":"2019-10-25T20:40:37Z","timestamp":1572036037000},"page":"122-132","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Fair (t,\u00a0n)-Threshold Secret Sharing Scheme with Efficient Cheater Identifying"],"prefix":"10.1007","author":[{"given":"Hua","family":"Shen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daijie","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lan","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mingwu","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,10,25]]},"reference":[{"issue":"2","key":"10_CR1","doi-asserted-by":"publisher","first-page":"1478","DOI":"10.1109\/JSYST.2019.2900723","volume":"13","author":"M Zhang","year":"2019","unstructured":"Zhang, M., Zhang, Y., Jiang, Y., Shen, J.: Obfuscating EVES algorithm and its application in fair electronic transactions in public cloud systems. IEEE Syst. J. 13(2), 1478\u20131486 (2019)","journal-title":"IEEE Syst. J."},{"issue":"4","key":"10_CR2","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1049\/ip-cdt:19971223","volume":"144","author":"CS Laih","year":"1997","unstructured":"Laih, C.S., Lee, Y.C.: V-fairness $$(t, n)$$ secret sharing scheme. IEEE Proc.-Comput. Digital Tech. 144(4), 245\u2013248 (1997)","journal-title":"IEEE Proc.-Comput. Digital Tech."},{"key":"10_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1007\/978-3-642-23971-7_48","volume-title":"Web Information Systems and Mining","author":"Y-C Lee","year":"2011","unstructured":"Lee, Y.-C.: A Simple (v, t, n)-fairness secret sharing scheme with one shadow for each participant. In: Gong, Z., Luo, X., Chen, J., Lei, J., Wang, F.L. (eds.) WISM 2011. LNCS, vol. 6987, pp. 384\u2013389. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-23971-7_48"},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"Yang J.H., Chang C.C., Wang C.H.: An efficient $$v$$-fairness $$(t, n)$$ threshold secret sharing scheme. In: 2011 Fifth International Conference on Genetic and Evolutionary Computing, pp. 180\u2013183. IEEE (2011)","DOI":"10.1109\/ICGEC.2011.97"},{"issue":"2","key":"10_CR5","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1049\/iet-ifs.2012.0064","volume":"7","author":"Y Tian","year":"2013","unstructured":"Tian, Y., Ma, J., Peng, C., Jiang, Q.: Fair $$(t, n)$$ threshold secret sharing scheme. IET Inf. Secur. 7(2), 106\u2013112 (2013)","journal-title":"IET Inf. Secur."},{"issue":"3","key":"10_CR6","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/BF02252871","volume":"1","author":"M Tompa","year":"1989","unstructured":"Tompa, M., Woll, H.: How to share a secret with cheaters. J. Cryptol. 1(3), 133\u2013138 (1989)","journal-title":"J. Cryptol."},{"issue":"1","key":"10_CR7","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/s10623-008-9265-8","volume":"52","author":"L Harn","year":"2009","unstructured":"Harn, L., Lin, C.: Detection and identification of cheaters in $$(t, n)$$ secret sharing scheme. Des. Codes Crypt. 52(1), 15\u201324 (2009)","journal-title":"Des. Codes Crypt."},{"issue":"6","key":"10_CR8","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1049\/iet-ifs.2013.0302","volume":"8","author":"L Harn","year":"2014","unstructured":"Harn, L.: Comments on\u2019fair $$(t, n)$$ threshold secret sharing scheme. IET Inf. Secur. 8(6), 303\u2013304 (2014)","journal-title":"IET Inf. Secur."},{"key":"10_CR9","first-page":"1","volume":"23","author":"L Harn","year":"2015","unstructured":"Harn, L., Lin, C., Li, Y.: Fair secret reconstruction in $$(t, n)$$ secret sharing. J. Inf. Secur. Appl. 23, 1\u20137 (2015)","journal-title":"J. Inf. Secur. Appl."},{"issue":"13","key":"10_CR10","doi-asserted-by":"crossref","first-page":"2115","DOI":"10.1002\/sec.1467","volume":"9","author":"Y Liu","year":"2016","unstructured":"Liu, Y.: Linear $$(k, n)$$ secret sharing scheme with cheating detection. Secur. Commun. Netw. 9(13), 2115\u20132121 (2016)","journal-title":"Secur. Commun. Netw."},{"issue":"1","key":"10_CR11","doi-asserted-by":"crossref","first-page":"384","DOI":"10.1109\/TII.2015.2514097","volume":"12","author":"P Lin","year":"2016","unstructured":"Lin, P.: Distributed secret sharing approach with cheater prevention based on qr code. IEEE Trans. Ind. Inform. 12(1), 384\u2013392 (2016)","journal-title":"IEEE Trans. Ind. Inform."},{"key":"10_CR12","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1186\/s13638-018-1084-7","volume":"1","author":"Y Liu","year":"2018","unstructured":"Liu, Y., Sun, Q., Yang, C.: $$(k, n)$$ secret image sharing scheme capable of cheating detection. EURASIP J. Wireless Commun. Netw. 1, 72 (2018)","journal-title":"EURASIP J. Wireless Commun. Netw."},{"issue":"6","key":"10_CR13","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1049\/iet-ifs.2017.0111","volume":"11","author":"S Mashhadi","year":"2017","unstructured":"Mashhadi, S., Dehkordi, M.H., Kiamari, N.: Provably secure verifiable multi-stage secret sharing scheme based on monotone span program. IET Inf. Secur. 11(6), 326\u2013331 (2017)","journal-title":"IET Inf. Secur."},{"issue":"2","key":"10_CR14","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1109\/TCC.2015.2396072","volume":"6","author":"M Cafaro","year":"2018","unstructured":"Cafaro, M., Pelle, P.: Space-efficient verifiable secret sharing using polynomial interpolation. IEEE Trans. Cloud Comput. 6(2), 453\u2013463 (2018)","journal-title":"IEEE Trans. Cloud Comput."},{"issue":"11","key":"10_CR15","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":"10_CR16","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/j.ins.2018.04.043","volume":"453","author":"Y Liu","year":"2018","unstructured":"Liu, Y., Yang, C., Wang, Y., Zhu, L., Ji, W.: Cheating identifiable secret sharing scheme using symmetric bivariate polynomial. Inf. Sci. 453, 21\u201329 (2018)","journal-title":"Inf. Sci."},{"key":"10_CR17","unstructured":"Tian Y., Peng C., Zhang R., Chen Y.: A practical publicly verifiable secret sharing scheme based on bilinear pairing. In: International Conference on Anti-counterfeiting, pp. 71\u201375. IEEE (2008)"}],"container-title":["IFIP Advances in Information and Communication Technology","Trust Management XIII"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-33716-2_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,24]],"date-time":"2023-10-24T00:03:08Z","timestamp":1698105788000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-33716-2_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030337155","9783030337162"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-33716-2_10","relation":{},"ISSN":["1868-4238","1868-422X"],"issn-type":[{"type":"print","value":"1868-4238"},{"type":"electronic","value":"1868-422X"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"25 October 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IFIPTM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"IFIP International Conference on Trust Management","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Copenhagen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Denmark","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":"17 July 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 July 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ifiptm2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/ifiptm2019.compute.dtu.dk\/IFIPTM19\/IFIPTM.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-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":"32","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":"7","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":"3","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":"22% - 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":"2","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":"6 work-in-progress papers are also included.","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)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}