{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,22]],"date-time":"2025-11-22T11:15:01Z","timestamp":1763810101811,"version":"3.37.3"},"reference-count":23,"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":[{"name":"hardware used in the experiment","award":["2017YFB0802300"],"award-info":[{"award-number":["2017YFB0802300"]}]},{"name":"cost of paper revision and expert review","award":["20183001","2017BDKFJJ015","2015B010131007"],"award-info":[{"award-number":["20183001","2017BDKFJJ015","2015B010131007"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2019]]},"DOI":"10.1109\/access.2019.2947248","type":"journal-article","created":{"date-parts":[[2019,10,14]],"date-time":"2019-10-14T19:23:13Z","timestamp":1571080993000},"page":"151120-151130","source":"Crossref","is-referenced-by-count":4,"title":["Optimal Weakly Secure Minimum Storage Regenerating Codes Scheme"],"prefix":"10.1109","volume":"7","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5252-4602","authenticated-orcid":false,"given":"Jianchao","family":"Bian","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shoushan","family":"Luo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhengwen","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yixian","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1002\/ecja.4410690906"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2162191"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2011.6133754"},{"key":"ref13","first-page":"770","article-title":"Secure regenerating code","author":"li","year":"2015","journal-title":"Proc Global Commun Conf"},{"key":"ref14","first-page":"1","article-title":"On the secure conditions for distributed storage systems","author":"rui","year":"2013","journal-title":"Int Symp on Network Coding (NetCod)"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2288784"},{"key":"ref16","first-page":"281","article-title":"Weakly Secure Network Coding","author":"bhattad","year":"2005","journal-title":"Proc Winmee Rawnet Netcod Workshops Riva Del Garda"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2012.2217331"},{"key":"ref18","first-page":"1221","article-title":"Weakly secure regenerating codes for cloud storage against eavesdropper","volume":"36","author":"liu","year":"2014","journal-title":"J Electron Inf Technol"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2009.5394538"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2553670"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2690662"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1504\/IJICOT.2016.079495"},{"key":"ref5","first-page":"81","article-title":"Having your cake and eating it too: Jointly optimal erasure codes for I\/O, storage, and network-bandwidth","author":"rashmi","year":"2015","journal-title":"Proc USENIX Conf File Storage Technol"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2017.2774299"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541298"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2159049"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/359168.359176"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2054295"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6875177"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2090212"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2014.7028489"},{"key":"ref23","first-page":"377","author":"shafarevich","year":"2012","journal-title":"Linear Algebra and Geometry"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8600701\/08868159.pdf?arnumber=8868159","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,10]],"date-time":"2021-08-10T19:40:18Z","timestamp":1628624418000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8868159\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"references-count":23,"URL":"https:\/\/doi.org\/10.1109\/access.2019.2947248","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2019]]}}}