{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T22:12:15Z","timestamp":1740175935848,"version":"3.37.3"},"reference-count":45,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Big Data"],"published-print":{"date-parts":[[2017]]},"DOI":"10.1109\/tbdata.2017.2708085","type":"journal-article","created":{"date-parts":[[2017,5,25]],"date-time":"2017-05-25T18:12:25Z","timestamp":1495735945000},"page":"1-1","source":"Crossref","is-referenced-by-count":12,"title":["Optimizing Share Size in Efficient and Robust Secret Sharing Scheme for Big Data"],"prefix":"10.1109","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1801-8810","authenticated-orcid":false,"given":"Thao","family":"Tran","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohammad","family":"Rahman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Md Zakirul Alam","family":"Bhuiyan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ayumu","family":"Kubota","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shinsaku","family":"Kiyomoto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kazumasa","family":"Omote","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"doi-asserted-by":"publisher","key":"ref39","DOI":"10.1145\/1866835.1866842"},{"doi-asserted-by":"publisher","key":"ref38","DOI":"10.1007\/978-3-642-30057-8_41"},{"doi-asserted-by":"publisher","key":"ref33","DOI":"10.1109\/TIT.2015.2410253"},{"doi-asserted-by":"publisher","key":"ref32","DOI":"10.1109\/TIT.2009.2032815"},{"doi-asserted-by":"publisher","key":"ref31","DOI":"10.1109\/TIT.2016.2597853"},{"doi-asserted-by":"publisher","key":"ref30","DOI":"10.1109\/TIT.2016.2530088"},{"doi-asserted-by":"publisher","key":"ref37","DOI":"10.1145\/2746539.2746576"},{"doi-asserted-by":"publisher","key":"ref36","DOI":"10.1109\/TIFS.2016.2515517"},{"doi-asserted-by":"publisher","key":"ref35","DOI":"10.1109\/TC.2012.135"},{"doi-asserted-by":"publisher","key":"ref34","DOI":"10.1109\/TCOMM.2014.2382126"},{"doi-asserted-by":"publisher","key":"ref10","DOI":"10.1093\/ietfec\/e91-a.1.127"},{"year":"0","key":"ref40"},{"doi-asserted-by":"publisher","key":"ref11","DOI":"10.1007\/978-3-540-85886-7_31"},{"key":"ref12","first-page":"136","article-title":"Efficient ideal threshold secret sharing schemes based on EXCLUSIVE-OR operations","author":"chunli","year":"2010","journal-title":"Proc 4th Conf Netw Syst Secur"},{"doi-asserted-by":"publisher","key":"ref13","DOI":"10.1109\/ITW.2014.6970885"},{"doi-asserted-by":"publisher","key":"ref14","DOI":"10.1587\/transfun.E92.A.1808"},{"key":"ref15","first-page":"255","article-title":"Secret sharing schemes based on minimum bandwidth regenerating codes","author":"kurihara","year":"2012","journal-title":"Proc Int Symp Inf Theory Appl"},{"doi-asserted-by":"publisher","key":"ref16","DOI":"10.1007\/978-3-319-02726-5_6"},{"key":"ref17","first-page":"323","article-title":"Secure network coding","author":"cai","year":"2002","journal-title":"Proc IEEE Int Symp Inf Theory"},{"doi-asserted-by":"publisher","key":"ref18","DOI":"10.1109\/TNET.2008.923722"},{"doi-asserted-by":"publisher","key":"ref19","DOI":"10.1109\/INFCOM.2009.5061945"},{"doi-asserted-by":"publisher","key":"ref28","DOI":"10.1007\/978-3-642-01957-9_18"},{"key":"ref4","first-page":"945","article-title":"On secret sharing systems using $(k,L,n)$(k,L,n) threshold scheme","volume":"j68 a","author":"yamamoto","year":"1985","journal-title":"IEICE Trans Fundam"},{"doi-asserted-by":"publisher","key":"ref27","DOI":"10.1109\/TNET.2003.818197"},{"key":"ref3","first-page":"242","article-title":"Security of ramp schemes","author":"blakley","year":"1984","journal-title":"CRYPTO '99 Proceedings of Advances in Cryptology"},{"doi-asserted-by":"publisher","key":"ref6","DOI":"10.1587\/transfun.E98.A.1576"},{"doi-asserted-by":"publisher","key":"ref29","DOI":"10.1109\/TIT.2005.855604"},{"key":"ref5","first-page":"126","article-title":"Non perfect secret sharing schemes and matroids","volume":"765","author":"kurosawa","year":"1993","journal-title":"Proc Workshop Theory Appl Cryptology Tech"},{"doi-asserted-by":"publisher","key":"ref8","DOI":"10.1109\/TPDS.2013.284"},{"doi-asserted-by":"publisher","key":"ref7","DOI":"10.1007\/978-3-662-44381-1_13"},{"doi-asserted-by":"publisher","key":"ref2","DOI":"10.1109\/MARK.1979.8817296"},{"doi-asserted-by":"publisher","key":"ref9","DOI":"10.1109\/TCC.2014.2344662"},{"doi-asserted-by":"publisher","key":"ref1","DOI":"10.1145\/359168.359176"},{"doi-asserted-by":"publisher","key":"ref20","DOI":"10.1109\/TWC.2012.041912.112105"},{"doi-asserted-by":"publisher","key":"ref45","DOI":"10.1145\/2991079.2991082"},{"doi-asserted-by":"publisher","key":"ref22","DOI":"10.1109\/TIT.1973.1055037"},{"doi-asserted-by":"publisher","key":"ref21","DOI":"10.1109\/TIFS.2015.2432732"},{"doi-asserted-by":"publisher","key":"ref42","DOI":"10.1016\/j.future.2015.01.017"},{"doi-asserted-by":"publisher","key":"ref24","DOI":"10.1109\/18.850663"},{"doi-asserted-by":"publisher","key":"ref41","DOI":"10.1016\/j.knosys.2014.05.003"},{"year":"2010","author":"cheng","journal-title":"Slepian- Wolf Code Designs","key":"ref23"},{"doi-asserted-by":"publisher","key":"ref44","DOI":"10.1016\/j.ins.2016.10.034"},{"doi-asserted-by":"publisher","key":"ref26","DOI":"10.1109\/TIT.2002.807285"},{"key":"ref43","article-title":"A new outsourcing conditional proxy re-encryption suitable for mobile cloud environment","author":"son","year":"2016","journal-title":"Concurrency Comput Practice Experience"},{"doi-asserted-by":"publisher","key":"ref25","DOI":"10.1109\/TIT.2010.2090197"}],"container-title":["IEEE Transactions on Big Data"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6687317\/7153538\/07934122.pdf?arnumber=7934122","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T14:54:05Z","timestamp":1652194445000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7934122\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"references-count":45,"URL":"https:\/\/doi.org\/10.1109\/tbdata.2017.2708085","relation":{},"ISSN":["2332-7790"],"issn-type":[{"type":"electronic","value":"2332-7790"}],"subject":[],"published":{"date-parts":[[2017]]}}}