{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T13:45:09Z","timestamp":1780321509098,"version":"3.54.1"},"reference-count":29,"publisher":"Wiley","license":[{"start":{"date-parts":[[2021,7,20]],"date-time":"2021-07-20T00:00:00Z","timestamp":1626739200000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61897069"],"award-info":[{"award-number":["61897069"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Security and Communication Networks"],"published-print":{"date-parts":[[2021,7,20]]},"abstract":"<jats:p>Multipartite secret sharing schemes are those that have multipartite access structures. The set of the participants in those schemes is divided into several parts, and all the participants in the same part play the equivalent role. One type of such access structure is the compartmented access structure, and the other is the hierarchical access structure. We propose an efficient compartmented multisecret sharing scheme based on the linear homogeneous recurrence (LHR) relations. In the construction phase, the shared secrets are hidden in some terms of the linear homogeneous recurrence sequence. In the recovery phase, the shared secrets are obtained by solving those terms in which the shared secrets are hidden. When the global threshold is <jats:inline-formula>\n                     <a:math xmlns:a=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" id=\"M1\">\n                        <a:mi>t<\/a:mi>\n                     <\/a:math>\n                  <\/jats:inline-formula>, our scheme can reduce the computational complexity of the compartmented secret sharing schemes from the exponential time to polynomial time. The security of the proposed scheme is based on Shamir\u2019s threshold scheme, i.e., our scheme is perfect and ideal. Moreover, it is efficient to share the multisecret and to change the shared secrets in the proposed scheme.<\/jats:p>","DOI":"10.1155\/2021\/5566179","type":"journal-article","created":{"date-parts":[[2021,7,21]],"date-time":"2021-07-21T00:05:08Z","timestamp":1626825908000},"page":"1-8","source":"Crossref","is-referenced-by-count":6,"title":["An Efficient Compartmented Secret Sharing Scheme Based on Linear Homogeneous Recurrence Relations"],"prefix":"10.1155","volume":"2021","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9582-0698","authenticated-orcid":true,"given":"Guoai","family":"Xu","sequence":"first","affiliation":[{"name":"College of Cyberspace Security, Beijing University of Posts and Telecommunications, Beijing 100876, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9196-0485","authenticated-orcid":true,"given":"Jiangtao","family":"Yuan","sequence":"additional","affiliation":[{"name":"College of Cyberspace Security, Beijing University of Posts and Telecommunications, Beijing 100876, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3310-926X","authenticated-orcid":true,"given":"Guosheng","family":"Xu","sequence":"additional","affiliation":[{"name":"College of Cyberspace Security, Beijing University of Posts and Telecommunications, Beijing 100876, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1736-6020","authenticated-orcid":true,"given":"Zhongkai","family":"Dang","sequence":"additional","affiliation":[{"name":"College of Cyberspace Security, Beijing University of Posts and Telecommunications, Beijing 100876, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"311","reference":[{"key":"1","doi-asserted-by":"publisher","DOI":"10.1145\/359168.359176"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1016\/b978-0-08-022272-1.50018-8"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0168674"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/infocom.2017.8057032"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1002\/ecjc.4430720906"},{"key":"6","first-page":"390","article-title":"How to (really) share a secret","author":"G. J. Simmons"},{"key":"7","first-page":"468","article-title":"Some ideal secret sharing schemes","volume":"434","author":"E. F. Brickell","year":"1989","journal-title":"Journal of Combinatorial Mathematics and Combinatorial Computing"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1007\/bf00204801"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30576-7_32"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/18.887867"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1023\/a:1024741108241"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1023\/a:1011225330458"},{"key":"13","unstructured":"CollinsJ. M.A note on ideal tripartite access structures20022002Lyon, FranceIACR Cryptology ePrint Archive193Report 2002\/193, vol.2002"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1049\/ip-ifs:20060081"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24638-1_26"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-011-9101-6"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1007\/s41870-018-0179-z"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25243-3_11"},{"key":"19","doi-asserted-by":"publisher","DOI":"10.1109\/tit.2014.2300113"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-008-9027-9"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-019-00657-2"},{"key":"22","first-page":"505","article-title":"Efficient explicit constructions of multipartite secret sharing schemes","author":"Q. Chen"},{"key":"23","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2007.11.031"},{"key":"24","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2014.08.046"},{"key":"25","unstructured":"YuanJ.YangJ.XuG.JiaX.FuF.WangC.A new efficient hierarchical multi-secret sharing scheme based on linear homogeneous recurrence relations2020Lyon, FranceCryptology ePrint ArchiveReport 2020\/1612"},{"key":"26","first-page":"216","volume-title":"Introductory Combinatorics","author":"B. A. Richard","year":"2009","edition":"5th"},{"key":"27","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2019.04.061"},{"key":"28","doi-asserted-by":"publisher","DOI":"10.5755\/j01.itc.50.2.27789"},{"key":"29","first-page":"99","article-title":"Secret sharing scheme realizing general access structure","author":"M. Ito"}],"container-title":["Security and Communication Networks"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/scn\/2021\/5566179.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/scn\/2021\/5566179.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/scn\/2021\/5566179.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,21]],"date-time":"2021-07-21T00:05:14Z","timestamp":1626825914000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.hindawi.com\/journals\/scn\/2021\/5566179\/"}},"subtitle":[],"editor":[{"given":"Stelvio","family":"Cimato","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"editor"}]}],"short-title":[],"issued":{"date-parts":[[2021,7,20]]},"references-count":29,"alternative-id":["5566179","5566179"],"URL":"https:\/\/doi.org\/10.1155\/2021\/5566179","relation":{},"ISSN":["1939-0122","1939-0114"],"issn-type":[{"value":"1939-0122","type":"electronic"},{"value":"1939-0114","type":"print"}],"subject":[],"published":{"date-parts":[[2021,7,20]]}}}