{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T17:11:44Z","timestamp":1771521104776,"version":"3.50.1"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T00:00:00Z","timestamp":1771459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T00:00:00Z","timestamp":1771459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"National Natural Science Foundation of China for Young Scientists","award":["62302129"],"award-info":[{"award-number":["62302129"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cybersecurity"],"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>Can a dealer share a secret without knowing the shareholders? We provide a positive answer to this question by introducing the concept of an attribute-based secret sharing (AB-SS) scheme.With AB-SS, a dealer can distribute a secret based on attributes rather than specific individuals or shareholders. Only authorized users whose attributes satisfy a given access structure can recover the secret. Furthermore, we introduce the concept of attribute-based publicly verifiable secret sharing (AB-PVSS). An AB-PVSS scheme allows external users to verify the correctness of all broadcast messages from the dealer and shareholders, similar to a traditional PVSS scheme. Additionally, AB-SS (or AB-PVSS) distinguishes itself from traditional SS (or PVSS) by enabling a dealer to generate shares according to an arbitrary monotone access structure.To build an AB-PVSS scheme, we first implement a decentralized ciphertext-policy attribute-based encryption (CP-ABE) scheme, though not a fully-fledged one.We then incorporate non-interactive zero-knowledge (NIZK) proofs to enable public verification of the CP-ABE ciphertext. Based on the CP-ABE and NIZK proofs, we construct an AB-PVSS primitive.Finally, we conduct security analysis and comprehensive experiments on the proposed CP-ABE and AB-PVSS schemes. The results demonstrate that both schemes exhibit plausible performance compared to related works.<\/jats:p>","DOI":"10.1186\/s42400-026-00559-6","type":"journal-article","created":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T16:30:12Z","timestamp":1771518612000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Attribute-based publicly verifiable secret sharing"],"prefix":"10.1186","volume":"9","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6393-5872","authenticated-orcid":false,"given":"Liang","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xingyu","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qiuling","family":"Yue","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haibin","family":"Kan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiheng","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,2,19]]},"reference":[{"issue":"11","key":"559_CR1","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A Shamir","year":"1979","unstructured":"Shamir A (1979) How to share a secret. Comm of the ACM 22(11):612\u2013613","journal-title":"Comm of the ACM"},{"key":"559_CR2","doi-asserted-by":"crossref","unstructured":"Cascudo I, David B (2024) Publicly verifiable secret sharing over class groups and applications to DKG and YOSO. In Eurocrypt\u201924. 216\u2013248","DOI":"10.1007\/978-3-031-58740-5_8"},{"key":"559_CR3","doi-asserted-by":"crossref","unstructured":"Feldman PA (1987) practical scheme for non-interactive verifiable secret sharing. In FOCS\u201987, 427\u2013438","DOI":"10.1109\/SFCS.1987.4"},{"key":"559_CR4","doi-asserted-by":"crossref","unstructured":"Stadler M (1996) Publicly verifiable secret sharing. In Eurocrypt\u201996, 190\u2013199","DOI":"10.1007\/3-540-68339-9_17"},{"key":"559_CR5","doi-asserted-by":"crossref","unstructured":"Cascudo I, David B (2017) SCRAPE: scalable randomness attested by public entities. In ACNS\u201917, 537\u2013556","DOI":"10.1007\/978-3-319-61204-1_27"},{"key":"559_CR6","doi-asserted-by":"crossref","unstructured":"Beimel A, Tassa T, Weinreb E (2005) Characterizing ideal weighted threshold secret sharing. In TCC\u201905, 600\u2013619","DOI":"10.1007\/978-3-540-30576-7_32"},{"key":"559_CR7","unstructured":"Belenkiy M (2008) Disjunctive multi-level secret sharing. Cryptology ePrint Archive"},{"issue":"2","key":"559_CR8","first-page":"237","volume":"20","author":"T Tassa","year":"2007","unstructured":"Tassa T (2007) Hierarchical Threshold Secret Sharing J Cryptol 20(2):237\u2013264","journal-title":"Hierarchical Threshold Secret Sharing J Cryptol"},{"issue":"2","key":"559_CR9","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/s00145-008-9027-9","volume":"22","author":"T Tassa","year":"2009","unstructured":"Tassa T, Dyn N (2009) Multipartite secret sharing by bivariate interpolation. J Cryptol 22(2):227\u2013258","journal-title":"J Cryptol"},{"issue":"1","key":"559_CR10","first-page":"601","volume":"68","author":"Q Chen","year":"2021","unstructured":"Chen Q, Tang C, Lin Z (2021) Efficient explicit constructions of multipartite secret sharing schemes. IEEE TIT 68(1):601\u2013631","journal-title":"IEEE TIT"},{"key":"559_CR11","doi-asserted-by":"crossref","unstructured":"Gentry C, Halevi S, Lyubashevsky V (2022) Practical non-interactive publicly verifiable secret sharing with thousands of parties. In Eurocrypt\u201922, 458\u2013487","DOI":"10.1007\/978-3-031-06944-4_16"},{"key":"559_CR12","doi-asserted-by":"crossref","unstructured":"Syta E, Jovanovic P, Kogias EK, Gailly N, Gasser L, Khoffi I, Fischer MJ, Ford B (2017) Scalable bias-resistant distributed randomness. In SP\u201917, 444\u2013460","DOI":"10.1109\/SP.2017.45"},{"key":"559_CR13","doi-asserted-by":"crossref","unstructured":"Bessani AN, Alchieri EP, Correia M, Fraga JS (2008) DepSpace: a Byzantine fault-tolerant coordination service. In Eurosys\u201908, 163\u2013176","DOI":"10.1145\/1352592.1352610"},{"key":"559_CR14","doi-asserted-by":"crossref","unstructured":"Kiayias A, Russell A, David B, Oliynykov R (2017) Ouroboros: a provably secure proof-of-stake blockchain protocol. In Crypto\u201917, 357\u2013388","DOI":"10.1007\/978-3-319-63688-7_12"},{"key":"559_CR15","doi-asserted-by":"crossref","unstructured":"Fujisaki E, Okamoto T (1998) A practical and provably secure scheme for publicly verifiable secret sharing and its applications. In Eurocrypt\u201998, 32\u201346","DOI":"10.1007\/BFb0054115"},{"key":"559_CR16","doi-asserted-by":"crossref","unstructured":"Fiat A, Shamir A (1986) How to prove yourself: practical solutions to identification and signature problems. In Eurocrypt\u201986, 186\u2013194","DOI":"10.1007\/3-540-47721-7_12"},{"key":"559_CR17","volume-title":"On $$\\Sigma $$-protocols","author":"I Damg\u00e5rd","year":"2002","unstructured":"Damg\u00e5rd I (2002) On $$\\Sigma$$-protocols. University of Aarhus, Department for Computer Science, Lecture Notes"},{"key":"559_CR18","doi-asserted-by":"crossref","unstructured":"Schoenmakers B (1999) A Simple Publicly Verifiable Secret Sharing Scheme and Its Application to Electronic. In Crypto\u201999, 148\u2013164","DOI":"10.1007\/3-540-48405-1_10"},{"key":"559_CR19","unstructured":"Ruiz A, Villar JL (2005) Publicly verifiable secret sharing from Paillier\u2019s cryptosystem. In SAC\u201905"},{"key":"559_CR20","doi-asserted-by":"crossref","unstructured":"Heidarvand S, Villar JL (2009) Public verifiability from pairings in secret sharing schemes. In SAC\u201909, 294\u2013308","DOI":"10.1007\/978-3-642-04159-4_19"},{"key":"559_CR21","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1007\/s10623-014-9952-6","volume":"73","author":"MP Jhanwar","year":"2014","unstructured":"Jhanwar MP, Venkateswarlu A, Safavi-Naini R (2014) Paillier-based publicly verifiable (non-interactive) secret sharing. Des Codes Crypt 73:529\u2013546","journal-title":"Des Codes Crypt"},{"key":"559_CR22","doi-asserted-by":"crossref","unstructured":"Bethencourt J, Sahai A, Waters B (2007) Ciphertext-Policy Attribute-Based Encryption. In SP\u201907, 321\u2013334","DOI":"10.1109\/SP.2007.11"},{"issue":"3","key":"559_CR23","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1137\/S0036144502417715","volume":"46","author":"J-P Berrut","year":"2004","unstructured":"Berrut J-P, Trefethen LN (2004) Barycentric lagrange interpolation. SIAM Rev 46(3):501\u2013517","journal-title":"SIAM Rev"},{"key":"559_CR24","doi-asserted-by":"crossref","unstructured":"Cascudo I, David B, Garms L, Konring A (2022) YOLO YOSO: fast and simple encryption and secret sharing in the YOSO model. In Asiacrypt\u201921, 651\u2013680","DOI":"10.1007\/978-3-031-22963-3_22"},{"key":"559_CR25","doi-asserted-by":"crossref","unstructured":"Cascudo I, David B (2020) ALBATROSS: publicly attestable batched randomness based on secret sharing. In Asiacrypt\u201920, 311\u2013341","DOI":"10.1007\/978-3-030-64840-4_11"},{"key":"559_CR26","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/s13389-013-0057-3","volume":"3","author":"JA Akinyele","year":"2013","unstructured":"Akinyele JA, Garman C, Miers I, Pagano MW, Rushanan M, Green M, Rubin AD (2013) Charm: a framework for rapidly prototyping cryptosystems. J Cryptogr Eng 3:111\u2013128","journal-title":"J Cryptogr Eng"},{"key":"559_CR27","doi-asserted-by":"crossref","unstructured":"Lewko A, Waters B (2011) Decentralizing attribute-based encryption. In Eurocrypt\u201911, 568\u2013588","DOI":"10.1007\/978-3-642-20465-4_31"},{"key":"559_CR28","doi-asserted-by":"crossref","unstructured":"Rouselakis Y, Waters B (2015) Efficient statically-secure large-universe multi-authority attribute-based encryption. In FC\u201915, 315\u2013332","DOI":"10.1007\/978-3-662-47854-7_19"},{"issue":"3","key":"559_CR29","doi-asserted-by":"publisher","first-page":"1017","DOI":"10.1093\/comjnl\/bxad039","volume":"67","author":"L Zhang","year":"2024","unstructured":"Zhang L, Kan H, Qiu F, Hao F (2024) A Publicly Verifiable Optimistic Fair Exchange Protocol Using Decentralized CP-ABE. Comput J 67(3):1017\u20131029","journal-title":"Comput J"},{"key":"559_CR30","doi-asserted-by":"crossref","unstructured":"Avoine G, Vaudenay S (2004) Optimistic fair exchange based on publicly verifiable secret sharing. In ACISP\u201904","DOI":"10.1007\/978-3-540-27800-9_7"},{"key":"559_CR31","doi-asserted-by":"publisher","DOI":"10.1109\/TBDATA.2025.3533924","volume-title":"Data exchange for the metaverse with accountable decentralized TTPs and incentive mechanisms","author":"L Zhang","year":"2025","unstructured":"Zhang L, Wu X, Ma Y, Kan H (2025) Data exchange for the metaverse with accountable decentralized TTPs and incentive mechanisms. IEEE Trans Big Data, Accepted"},{"issue":"2","key":"559_CR32","doi-asserted-by":"publisher","first-page":"1525","DOI":"10.1007\/s10586-020-03202-2","volume":"24","author":"K Sethi","year":"2021","unstructured":"Sethi K, Pradhan A, Bera P (2021) PMTER-ABE: a practical multi-authority CP-ABE with traceability, revocation and outsourcing decryption for secure access control in cloud systems. Clust Comput 24(2):1525\u20131550","journal-title":"Clust Comput"},{"key":"559_CR33","doi-asserted-by":"crossref","unstructured":"Li J, Yan H, Koe ASV, Deng W, Zhong Z (2025) Secure and Revocable Multi-authority CP-ABE for Mobile Cloud Computing. In International conference on algorithms and architectures for parallel processing, pp. 75\u201384","DOI":"10.1007\/978-981-96-1528-5_5"}],"container-title":["Cybersecurity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s42400-026-00559-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1186\/s42400-026-00559-6","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s42400-026-00559-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T16:30:16Z","timestamp":1771518616000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1186\/s42400-026-00559-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,2,19]]},"references-count":33,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2026,12]]}},"alternative-id":["559"],"URL":"https:\/\/doi.org\/10.1186\/s42400-026-00559-6","relation":{},"ISSN":["2523-3246"],"issn-type":[{"value":"2523-3246","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,2,19]]},"assertion":[{"value":"23 September 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 February 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 February 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"123"}}