{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T10:34:10Z","timestamp":1775644450879,"version":"3.50.1"},"reference-count":24,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61876017"],"award-info":[{"award-number":["61876017"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002858","name":"China Postdoctoral Science Foundation","doi-asserted-by":"publisher","award":["2019M650020"],"award-info":[{"award-number":["2019M650020"]}],"id":[{"id":"10.13039\/501100002858","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2019]]},"DOI":"10.1109\/access.2019.2929090","type":"journal-article","created":{"date-parts":[[2019,7,23]],"date-time":"2019-07-23T20:32:06Z","timestamp":1563913926000},"page":"107104-107110","source":"Crossref","is-referenced-by-count":27,"title":["An Efficient Verifiable Threshold Multi-Secret Sharing Scheme With Different Stages"],"prefix":"10.1109","volume":"7","author":[{"given":"Dong","family":"Chen","sequence":"first","affiliation":[{"name":"School of Software Engineering, Beijing Jiaotong University, Beijing, China"}]},{"given":"Wei","family":"Lu","sequence":"additional","affiliation":[{"name":"School of Software Engineering, Beijing Jiaotong University, Beijing, China"}]},{"given":"Weiwei","family":"Xing","sequence":"additional","affiliation":[{"name":"School of Software Engineering, Beijing Jiaotong University, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8687-8820","authenticated-orcid":false,"given":"Na","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Computer Science, Beijing University of Posts and Telecommunications, Beijing, China"}]}],"member":"263","reference":[{"key":"ref10","first-page":"421","article-title":"A new (t, n)-threshold multi-secret sharing scheme","author":"huixian","year":"2005","journal-title":"Proc Int Conf Comput Inf Sci"},{"key":"ref11","article-title":"Threshold secret sharing scheme based on difference and Shamir scheme of special access right","author":"zhang","year":"2006","journal-title":"Computer Engineering and Applications"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1049\/el:19950073"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1049\/el:19950201"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/1044552.1044557"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/11563952_24"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2007.11.031"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2015.09.040"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1002\/sec.1288"},{"key":"ref19","first-page":"173","article-title":"Secret sharing scheme security and performance analysis","author":"abdallah","year":"2016","journal-title":"Proc Int Conf Comput Control Netw Electron"},{"key":"ref4","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1049\/cje.2017.01.026","article-title":"A cellular automata based verifiable multi-secret sharing scheme without a trusted dealer","volume":"26","author":"meng","year":"2017","journal-title":"Chin J Electron"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1049\/el.2017.1840"},{"key":"ref6","doi-asserted-by":"crossref","first-page":"4416","DOI":"10.1002\/sec.1617","article-title":"A CRT-based verifiable secret sharing scheme secure against unbounded adversaries","volume":"9","author":"pedersen","year":"2016","journal-title":"Secur Commun Netw"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/s11277-017-4245-9"},{"key":"ref8","first-page":"160","article-title":"Threshold verifiable multi-secret sharing scheme","volume":"34","author":"xingxing","year":"2013","journal-title":"Comput Eng Appl"},{"key":"ref7","first-page":"840","article-title":"A new (t,n) multi-secret sharing scheme based on Shamir’s secret sharing","volume":"167","author":"pang","year":"2005","journal-title":"Appl Math Comput"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/359168.359176"},{"key":"ref1","first-page":"313","article-title":"Safeguarding cryptographic keys","volume":"48","author":"blakley","year":"1979","journal-title":"Proc AFIPS Conf"},{"key":"ref9","first-page":"1","article-title":"A scheme for threshold multi-secret sharing","volume":"166","author":"chan","year":"2009","journal-title":"Appl Math Comput"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-70503-3_12"},{"key":"ref22","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1049\/cje.2017.01.026","article-title":"A cellular automata based verifiable multi-secret sharing scheme without a trusted dealer","volume":"26","author":"meng","year":"2017","journal-title":"Chin J Electron"},{"key":"ref21","first-page":"200","article-title":"A secret sharing scheme based on multilinear Diffie-Hellman problem","volume":"45","author":"peng","year":"2017","journal-title":"Acta Electronica Sinica"},{"key":"ref24","doi-asserted-by":"crossref","first-page":"1676","DOI":"10.1109\/TIT.2006.871050","article-title":"Disenrollment with perfect forward secrecy in threshold schemes","volume":"52","author":"li","year":"2006","journal-title":"IEEE Trans Inf Theory"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-49175-2_1"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8600701\/08770250.pdf?arnumber=8770250","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,8]],"date-time":"2022-09-08T19:48:26Z","timestamp":1662666506000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8770250\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"references-count":24,"URL":"https:\/\/doi.org\/10.1109\/access.2019.2929090","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]}}}