{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T13:49:47Z","timestamp":1762004987354,"version":"3.37.3"},"reference-count":31,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"8","license":[{"start":{"date-parts":[[2018,8,1]],"date-time":"2018-08-01T00:00:00Z","timestamp":1533081600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"name":"University Grants Committee of the Hong Kong Special Administrative Region, China","award":["AoE\/E-02\/08"],"award-info":[{"award-number":["AoE\/E-02\/08"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans.Inform.Forensic Secur."],"published-print":{"date-parts":[[2018,8]]},"DOI":"10.1109\/tifs.2018.2806922","type":"journal-article","created":{"date-parts":[[2018,2,16]],"date-time":"2018-02-16T19:21:39Z","timestamp":1518808899000},"page":"1906-1916","source":"Crossref","is-referenced-by-count":12,"title":["A Zigzag-Decodable Ramp Secret Sharing Scheme"],"prefix":"10.1109","volume":"13","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7932-7801","authenticated-orcid":false,"given":"Xueqing","family":"Gong","sequence":"first","affiliation":[]},{"given":"Ping","family":"Hu","sequence":"additional","affiliation":[]},{"given":"Kenneth W.","family":"Shum","sequence":"additional","affiliation":[]},{"given":"Chi Wan","family":"Sung","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511817106"},{"journal-title":"The Symmetric Group Representations Combinatorial Algorithms and Symmetric Functions","year":"1991","author":"sagan","key":"ref30"},{"key":"ref10","first-page":"125","article-title":"A study on long-term storage of electronic data","volume":"1","author":"ishizu","year":"2004","journal-title":"Proc IEICE Gen Conf"},{"key":"ref11","first-page":"631","article-title":"A fast $(2,n)$ -threshold scheme and its application","author":"fujii","year":"2005","journal-title":"Proceedings of CSSE"},{"key":"ref12","article-title":"$(2,n)$ -threshold secret sharing systems based on binary matrices","author":"hosaka","year":"2007","journal-title":"Proc SCIS"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1093\/ietfec\/e91-a.1.127"},{"key":"ref14","first-page":"1435","article-title":"How to convert 1-out-of-n proof into k-out-of-n proof","author":"shiina","year":"2004","journal-title":"Proc SCIS"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1093\/ietfec\/e91-a.9.2365"},{"key":"ref16","doi-asserted-by":"crossref","first-page":"1808","DOI":"10.1587\/transfun.E92.A.1808","article-title":"A fast $(k,l,n)$ -threshold ramp secret sharing scheme","volume":"e92 a","author":"kurihara","year":"2009","journal-title":"IEICE Trans Fundam Electron Commun Comput Sci"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/NSS.2010.82"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2014.6970885"},{"key":"ref19","volume":"10052","author":"chen","year":"2016","journal-title":"Efficient XOR-Based Ideal $(t n)$ —Threshold Schemes"},{"journal-title":"Matrix Analysis","year":"2013","author":"horn","key":"ref28"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46885-4_45"},{"key":"ref27","first-page":"51","article-title":"A combinatorial interpretation of ramp schemes","volume":"14","author":"jackson","year":"1996","journal-title":"Austral J Combin"},{"key":"ref3","first-page":"27","article-title":"Generalized secret sharing and monotone functions","volume":"403","author":"benaloh","year":"1990","journal-title":"Adv Cryptology"},{"key":"ref6","first-page":"230","article-title":"The geometry of shared secret schemes","volume":"1","author":"simmons","year":"1991","journal-title":"Bull ICA"},{"key":"ref29","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198534891.001.0001","author":"macdonald","year":"1995","journal-title":"Symmetric Functions and Hall Polynomials"},{"key":"ref5","first-page":"99","article-title":"Secret sharing schemes realizing general access structure","author":"ito","year":"1987","journal-title":"Proc IEEE Globecom"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-39568-7_20"},{"key":"ref7","first-page":"136","article-title":"Secret sharing made short","volume":"773","author":"krawczyk","year":"1993","journal-title":"Proc 13th Annu Int Cryptol Conf Adv Cryptol (CRYPTO)"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/MARK.1979.8817296"},{"key":"ref9","first-page":"945","article-title":"On secret sharing systems using $(k,L,n)$ -threshold scheme","volume":"j68 a","author":"yamamoto","year":"1985","journal-title":"IEICE Trans Fundam Electron Commun Comput Sci"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/359168.359176"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620244"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/1402958.1402977"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2017.05.005"},{"key":"ref24","first-page":"699","article-title":"Combination network coding: Alphabet size and zigzag decoding","author":"sung","year":"2014","journal-title":"Proc IEEE ISITA"},{"journal-title":"Zigzag decodable fountain codes","year":"2016","author":"nozaki","key":"ref23"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TrustCom.2014.70"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2016.2591537"}],"container-title":["IEEE Transactions on Information Forensics and Security"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10206\/8330769\/08293841.pdf?arnumber=8293841","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,1]],"date-time":"2024-07-01T08:18:50Z","timestamp":1719821930000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8293841\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,8]]},"references-count":31,"journal-issue":{"issue":"8"},"URL":"https:\/\/doi.org\/10.1109\/tifs.2018.2806922","relation":{},"ISSN":["1556-6013","1556-6021"],"issn-type":[{"type":"print","value":"1556-6013"},{"type":"electronic","value":"1556-6021"}],"subject":[],"published":{"date-parts":[[2018,8]]}}}