{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,15]],"date-time":"2025-06-15T22:10:08Z","timestamp":1750025408378,"version":"3.41.0"},"reference-count":18,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Inf. & Syst."],"published-print":{"date-parts":[[2017]]},"DOI":"10.1587\/transinf.2016edp7220","type":"journal-article","created":{"date-parts":[[2017,3,1]],"date-time":"2017-03-01T00:22:56Z","timestamp":1488327776000},"page":"483-495","source":"Crossref","is-referenced-by-count":0,"title":["Secure Regenerating Codes Using Linear Regenerating Codes and the All-or-Nothing Transform"],"prefix":"10.1587","volume":"E100.D","author":[{"given":"Hidenori","family":"KUWAKADO","sequence":"first","affiliation":[{"name":"Faculty of Informatics, Kansai University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Masazumi","family":"KURIHARA","sequence":"additional","affiliation":[{"name":"Graduate School of Informatics and Engineering, The University of Electro-Communications"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"crossref","unstructured":"[1] A.G. Dimakis, P.B. Godfrey, Y. Wu, M.J. Wainwright, and K. Ramchandran, \u201cNetwork coding for distributed storage systems,\u201d IEEE Trans. Inf. Theory, vol.56, no.9, pp.4539-4551, Sept. 2010.","DOI":"10.1109\/TIT.2010.2054295"},{"key":"2","doi-asserted-by":"crossref","unstructured":"[2] K.V. Rashmi, N.B. Shah, and P.V. Kumar, \u201cOptimal exact-regenerating codes for distributed storage at the MSR and MBR points via a product-matrix construction,\u201d IEEE Trans. Inf. Theory, vol.57, no.8, pp.5227-5239, 2011.","DOI":"10.1109\/TIT.2011.2159049"},{"key":"3","doi-asserted-by":"crossref","unstructured":"[3] S. Pawar, S.E. Rouayheb, and K. Ramchandran, \u201cOn secure distributed data storage under repair dynamics.\u201d CoRR, http:\/\/arxiv.org\/abs\/1003.0488, 2010.","DOI":"10.1109\/ISIT.2010.5513795"},{"key":"4","doi-asserted-by":"crossref","unstructured":"[4] N.B. Shah, K.V. Rashmi, and P.V. Kumar, \u201cInformation-theoretically secure regenerating codes for distributed storage,\u201d Global Telecommunications Conference (GLOBECOM 2011), pp.1-5, 2011.","DOI":"10.1109\/GLOCOM.2011.6133754"},{"key":"5","doi-asserted-by":"crossref","unstructured":"[5] M. Kurihara and H. Kuwakado, \u201cSecure regenerating codes based on Rashmi-Shah-Kumar MBR codes,\u201d IEICE Trans. Fundamentals, vol.E96-A, no.2, pp.635-648, Feb. 2013.","DOI":"10.1587\/transfun.E96.A.635"},{"key":"6","unstructured":"[6] M. Kurihara and H. Kuwakado, \u201cGeneralization of Rashmi-Shah-Kumar minimum-storage-regenerating codes,\u201d CoRR, abs\/1309. 6701, 2013. http:\/\/arxiv.org\/abs\/1309.6701."},{"key":"7","doi-asserted-by":"crossref","unstructured":"[7] M. Kurihara and H. Kuwakado, \u201cSecure regenerating codes based on MSR codes for distributed storage systems,\u201d IEICE Trans. Fundamentals (Japanese Edition), vol.J96-A, no.4, pp.166-174, April 2013.","DOI":"10.1587\/transfun.E96.A.635"},{"key":"8","doi-asserted-by":"crossref","unstructured":"[8] J. Kurihara and Y. Miyake, \u201cSecuring distributed storage systems based on arbitrary regenerating codes,\u201d IEICE Commun. Express, vol.2, no.10, pp.442-446, 2013.","DOI":"10.1587\/comex.2.442"},{"key":"9","doi-asserted-by":"crossref","unstructured":"[9] R.L. Rivest, \u201cAll-or-nothing encryption and the package transform,\u201d Fast Software Encryption FSE '97, Lecture Notes in Computer Science, vol.1267, pp.210-218, 1997.","DOI":"10.1007\/BFb0052348"},{"key":"10","doi-asserted-by":"crossref","unstructured":"[10] S.-J. Lin and W.-H. Chung, \u201cAn unified form of exact-MSR codes via product-matrix framework,\u201d 2013 IEEE 24th International Symposium on Personal Indoor and Mobile Radio Communications (PIMRC), pp.830-834, Sept. 2013.","DOI":"10.1109\/PIMRC.2013.6666251"},{"key":"11","doi-asserted-by":"crossref","unstructured":"[11] N.B. Shah, K.V. Rashmi, P.V. Kumar, and K. Ramchandran, \u201cDistributed storage codes with repair-by-transfer and nonachievability of interior points on the storage-bandwidth tradeoff,\u201d IEEE Trans. Inf. Theory, vol.58, no.3, pp.1837-1852, March 2012.","DOI":"10.1109\/TIT.2011.2173792"},{"key":"12","doi-asserted-by":"crossref","unstructured":"[12] A. Desai, \u201cThe security of all-or-nothing encryption: Protecting against exhaustive key search,\u201d Advances in Cryptology-CRYPTO 2000, Lecture Notes in Computer Science, vol.1880, pp.359-375, 2000.","DOI":"10.1007\/3-540-44598-6_23"},{"key":"13","doi-asserted-by":"crossref","unstructured":"[13] B. Sasidharan, P.V. Kumar, N. Shah, K. Rashmi, and K. Ramachandran, \u201cOptimality of the product-matrix construction for secure MSR regenerating codes,\u201d 2014 6th International Symposium on Communications, Control and Signal Processing (ISCCSP), pp.10-14, May 2014.","DOI":"10.1109\/ISCCSP.2014.6877804"},{"key":"14","unstructured":"[14] K. Huang, U. Parampalli, and M. Xian, \u201cCharacterization of secrecy capacity for general MSR codes under passive eavesdropping model,\u201d CoRR, vol.abs\/1505.01986, 2015. http:\/\/arxiv.org\/abs\/1505.01986."},{"key":"15","unstructured":"[15] N. Cai and R.W. Yeung, \u201cSecure network coding,\u201d 2002 IEEE International Symposium on Information Theory, p.323, 2002."},{"key":"16","unstructured":"[16] J. Feldman, T. Malkin, R.A. Servedio, and C. Stein, \u201cOn the capacity of secure network coding,\u201d 42nd Annual Allerton Conference on Communication, Control, and Computing, 2004."},{"key":"17","unstructured":"[17] K. Bhattad and K.R. Narayanan, \u201cWeakly secure network coding,\u201d First Workshop on Network Coding, Theory, and Applications, NETCOD 2005, April 2005. http:\/\/www.tamu.edu\/commtheory\/."},{"key":"18","doi-asserted-by":"crossref","unstructured":"[18] D. Silva and F.R. Kschischang, \u201cUniversal secure network coding via rank-metric codes,\u201d IEEE Trans. Inf. Theory, vol.57, no.2, pp.1124-1135, Feb. 2011.","DOI":"10.1109\/TIT.2010.2090212"}],"container-title":["IEICE Transactions on Information and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E100.D\/3\/E100.D_2016EDP7220\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,15]],"date-time":"2025-06-15T21:39:49Z","timestamp":1750023589000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E100.D\/3\/E100.D_2016EDP7220\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"references-count":18,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2017]]}},"URL":"https:\/\/doi.org\/10.1587\/transinf.2016edp7220","relation":{},"ISSN":["0916-8532","1745-1361"],"issn-type":[{"type":"print","value":"0916-8532"},{"type":"electronic","value":"1745-1361"}],"subject":[],"published":{"date-parts":[[2017]]}}}