{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T02:07:59Z","timestamp":1740103679399,"version":"3.37.3"},"reference-count":21,"publisher":"Wiley","license":[{"start":{"date-parts":[[2020,3,13]],"date-time":"2020-03-13T00:00:00Z","timestamp":1584057600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61702125","61702126"],"award-info":[{"award-number":["61702125","61702126"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61702125","61702126"],"award-info":[{"award-number":["61702125","61702126"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Complexity"],"published-print":{"date-parts":[[2020,3,13]]},"abstract":"<jats:p>Secret sharing has been study for many years and has had a number of real-word applications. There are several methods to construct the secret-sharing schemes. One of them is based on coding theory. In this work, we construct a secret-sharing scheme that realizes an access structure by using linear codes, in which any element of the access structure can reconstruct the secret key. We prove that our scheme is a multiprover zero-knowledge proof system in the random oracle model, which shows that a passive adversary gains no information about the secret key. Our scheme is also a leakage-resilient secret-sharing scheme (LRSS) in the bounded-leakage model, which remain provably secure even if the adversary learns a bounded amount of leakage information about their secret key. As an application, we propose a new group identification protocol (GID-scheme) from our LRSS. We prove that our GID-scheme is a leakage-resilient scheme. In our leakage-resilient GID-scheme, the verifier believes the validity of qualified group members and tolerates <jats:italic>l<\/jats:italic> bits of adversarial leakage in the distribution protocol, whereas for unqualified group members, the verifier cannot believe their valid identifications in the proof protocol.<\/jats:p>","DOI":"10.1155\/2020\/1784276","type":"journal-article","created":{"date-parts":[[2020,3,13]],"date-time":"2020-03-13T23:30:32Z","timestamp":1584142232000},"page":"1-13","source":"Crossref","is-referenced-by-count":1,"title":["A Group Identification Protocol with Leakage Resilience of Secret Sharing Scheme"],"prefix":"10.1155","volume":"2020","author":[{"given":"Ping","family":"Li","sequence":"first","affiliation":[{"name":"School of Computer Science, South China Normal University, Guangzhou 510631, China"},{"name":"School of Computer Science and Cyber Engineering, Guangzhou University, Guangzhou 510006, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4460-1559","authenticated-orcid":true,"given":"Shengjun","family":"Li","sequence":"additional","affiliation":[{"name":"School of Information Science and Engineering, Qufu Normal University, Rizhao, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hongyang","family":"Yan","sequence":"additional","affiliation":[{"name":"School of Computer Science and Cyber Engineering, Guangzhou University, Guangzhou 510006, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5279-5795","authenticated-orcid":true,"given":"Lishan","family":"Ke","sequence":"additional","affiliation":[{"name":"School of Mathematics and Information Science, Guangzhou University, Guangzhou 510006, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7261-6398","authenticated-orcid":true,"given":"Teng","family":"Huang","sequence":"additional","affiliation":[{"name":"School of Computer Science and Cyber Engineering, Guangzhou University, Guangzhou 510006, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alzubair","family":"Hassan","sequence":"additional","affiliation":[{"name":"School of Computer Science and Cyber Engineering, Guangzhou University, Guangzhou 510006, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","reference":[{"key":"1","doi-asserted-by":"publisher","DOI":"10.1145\/359168.359176"},{"key":"4","first-page":"313","volume-title":"General secure multi-party computation from any linear secret-sharing scheme","volume":"1807","year":"2000"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2019.2894411"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2018.02.050"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/jsac.2017.2760458"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-010-9378-8"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/71.722223"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1145\/358746.358762"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-018-0556-4"},{"year":"1995","key":"18"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-015-9200-x"},{"key":"28","doi-asserted-by":"publisher","DOI":"10.1145\/1506409.1506429"},{"key":"31","doi-asserted-by":"publisher","DOI":"10.1016\/j.ffa.2006.05.003"},{"key":"32","doi-asserted-by":"publisher","DOI":"10.1109\/18.841188"},{"key":"33","first-page":"200","volume-title":"Leakage-resilient secret sharing","volume":"25","year":"2018"},{"volume":"1","year":"2007","key":"34"},{"volume-title":"On \u03c3-protocols","year":"2002","key":"36"},{"key":"38","doi-asserted-by":"publisher","DOI":"10.1007\/s11432-011-4480-8"},{"key":"39","doi-asserted-by":"publisher","DOI":"10.1137\/0218012"},{"key":"40","doi-asserted-by":"publisher","DOI":"10.1007\/bf02351717"},{"volume-title":"Zero-knowledge proofs and applications","year":"2015","key":"41"}],"container-title":["Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2020\/1784276.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2020\/1784276.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2020\/1784276.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,13]],"date-time":"2020-03-13T23:30:39Z","timestamp":1584142239000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.hindawi.com\/journals\/complexity\/2020\/1784276\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,3,13]]},"references-count":21,"alternative-id":["1784276","1784276"],"URL":"https:\/\/doi.org\/10.1155\/2020\/1784276","relation":{},"ISSN":["1076-2787","1099-0526"],"issn-type":[{"type":"print","value":"1076-2787"},{"type":"electronic","value":"1099-0526"}],"subject":[],"published":{"date-parts":[[2020,3,13]]}}}