{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T14:18:33Z","timestamp":1772893113944,"version":"3.50.1"},"reference-count":19,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"9","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Fundamentals"],"published-print":{"date-parts":[[2021,9,1]]},"DOI":"10.1587\/transfun.2020dmp0018","type":"journal-article","created":{"date-parts":[[2021,3,22]],"date-time":"2021-03-22T22:06:34Z","timestamp":1616450794000},"page":"1271-1283","source":"Crossref","is-referenced-by-count":2,"title":["Private Information Retrieval from Coded Storage in the Presence of Omniscient and Limited-Knowledge Byzantine Adversaries"],"prefix":"10.1587","volume":"E104.A","author":[{"given":"Jun","family":"KURIHARA","sequence":"first","affiliation":[{"name":"Graduate School of Applied Informatics, University of Hyogo"},{"name":"Zettant Inc."},{"name":"Advanced Telecommunication Research Institute International (ATR)"}]},{"given":"Toru","family":"NAKAMURA","sequence":"additional","affiliation":[{"name":"Advanced Telecommunication Research Institute International (ATR)"},{"name":"KDDI Research, Inc."}]},{"given":"Ryu","family":"WATANABE","sequence":"additional","affiliation":[{"name":"KDDI Research, Inc."}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"crossref","unstructured":"[1] T.H. Chan, S.-W. Ho, and H. Yamamoto, \u201cPrivate information retrieval for coded storage,\u201d Proc. IEEE ISIT 2015, Hong Kong, China, pp.2842-2846, June 2015. 10.1109\/isit.2015.7282975","DOI":"10.1109\/ISIT.2015.7282975"},{"key":"2","unstructured":"[2] B. Chor, O. Goldreich, E. Kushilevitz, and M. Sudan, \u201cPrivate information retrieval,\u201d Proc. FOCS 1995, Milwaukee, WI, USA, pp.41-50, Oct. 1995. 10.1109\/sfcs.1995.492461"},{"key":"3","doi-asserted-by":"publisher","unstructured":"[3] I.M. Duursma and S. Park, \u201cCoset bounds for algebraic geometric codes,\u201d Finite Fields Th. App., vol.16, no.1, pp.36-55, Jan. 2010. 10.1016\/j.ffa.2009.11.006","DOI":"10.1016\/j.ffa.2009.11.006"},{"key":"4","doi-asserted-by":"publisher","unstructured":"[4] R. Freij-Hollanti, O.W. Gnilke, C. Hollanti, and D.A. Karpuk, \u201cPrivate information retrieval from coded databases with colluding servers,\u201d SIAM J. Appl. Algebra Geometry, vol.1, no.1, pp.647-664, Jan. 2017. 10.1137\/16m1102562","DOI":"10.1137\/16M1102562"},{"key":"5","doi-asserted-by":"crossref","unstructured":"[5] L. Holzbaur, R. Freij-Hollanti, and C. Hollanti, \u201cTowards the capacity of private information retrieval from coded and colluding servers,\u201d https:\/\/arxiv.org\/abs\/1903.12552, March 2020.","DOI":"10.1109\/ITW44776.2019.8989216"},{"key":"6","doi-asserted-by":"publisher","unstructured":"[6] S. Jaggi, M. Langberg, S. Katti, T. Ho, D. Katabi, M. M\u00e9dard, and M. Effros, \u201cResilient network coding in the presence of Byzantine adversaries,\u201d IEEE Trans. Inf. Theory, vol.54, no.6, pp.2596-2603, June 2008. 10.1109\/tit.2008.921711","DOI":"10.1109\/TIT.2008.921711"},{"key":"7","doi-asserted-by":"publisher","unstructured":"[7] R. Koetter and F.R. Kschischang, \u201cCoding for errors and erasures in random network coding,\u201d IEEE Trans. Inf. Theory, vol.54, no.8, pp.3579-3591, Aug. 2008. 10.1109\/tit.2008.926449","DOI":"10.1109\/TIT.2008.926449"},{"key":"8","doi-asserted-by":"publisher","unstructured":"[8] J. Kurihara and T. Nakamura, \u201cOn the resistance to Byzantine and unresponsive servers in code-based PIR schemes,\u201d IEICE ComEx, vol.9, no.7, pp.342-347, July 2020. 10.1587\/comex.2020xbl0055","DOI":"10.1587\/comex.2020XBL0055"},{"key":"9","doi-asserted-by":"publisher","unstructured":"[9] L. Li, M. Militzer, and A. Datta, \u201crPIR: Ramp secret sharing-based communication-efficient private information retrieval,\u201d Int. J. Inf. Secur., vol.16, no.6, pp.603-625, Nov. 2017. 10.1007\/s10207-016-0347-8","DOI":"10.1007\/s10207-016-0347-8"},{"key":"10","doi-asserted-by":"publisher","unstructured":"[10] Y. Luo, C. Mitrpant, A.J. Han Vinck, and K. Chen, \u201cSome new characters on the wire-tap channel of type II,\u201d IEEE Trans. Inf. Theory, vol.51, no.3, pp.1222-1229, March 2005. 10.1109\/tit.2004.842763","DOI":"10.1109\/TIT.2004.842763"},{"key":"11","unstructured":"[11] F.J. MacWilliams and N.J.A. Sloane, The Theory of Error-Correcting Codes, North-Holland Mathematical Library, 1977. 10.1016\/s0924-6509(08)x7030-8"},{"key":"12","doi-asserted-by":"publisher","unstructured":"[12] S. Pawar, S.Y. El Rouayheb, and K. Ramchandran, \u201cSecuring dynamic distributed storage systems against eavesdropping and adversarial attacks,\u201d IEEE Trans. Inf. Theory, vol.57, no.10, pp.6734-6753, Sept. 2010. 10.1109\/tit.2011.2162191","DOI":"10.1109\/TIT.2011.2162191"},{"key":"13","doi-asserted-by":"publisher","unstructured":"[13] D. Silva, F.R. Kschischang, and R. Koetter, \u201cA rank-metric approach to error control in random network coding,\u201d IEEE Trans. Inf. Theory, vol.54, no.9, pp.3951-3967, Sept. 2008. 10.1109\/tit.2008.928291","DOI":"10.1109\/TIT.2008.928291"},{"key":"14","doi-asserted-by":"publisher","unstructured":"[14] H. Stichtenoth, \u201cOn the dimension of subfield subcodes,\u201d IEEE Trans. Inf. Theory, vol.36, no.1, pp.90-93, Jan. 1990. 10.1109\/18.50376","DOI":"10.1109\/18.50376"},{"key":"15","doi-asserted-by":"publisher","unstructured":"[15] R. Tajeddine, O.W. Gnilke, and S. El Rouayheb, \u201cPrivate information retrieval from MDS coded data in distributed storage systems,\u201d IEEE Trans. Inf. Theory, vol.64, no.11, pp.7081-7093, Nov. 2018. 10.1109\/tit.2018.2815607","DOI":"10.1109\/TIT.2018.2815607"},{"key":"16","doi-asserted-by":"publisher","unstructured":"[16] R. Tajeddine, O.W. Gnilke, D. Karpuk, R. Freij-Hollanti, and C. Hollanti, \u201cPrivate information retrieval from coded storage systems with colluding, Byzantine, and unresponsive servers,\u201d IEEE Trans. Inf. Theory, vol.65, no.6, pp.3898-3906, June 2019. 10.1109\/TIT.2018.2890285","DOI":"10.1109\/TIT.2018.2890285"},{"key":"17","doi-asserted-by":"publisher","unstructured":"[17] Q. Wang and M. Skoglund, \u201cSymmetric private information retrieval from MDS coded distributed storage with non-colluding and colluding servers,\u201d IEEE Trans. Inf. Theory, vol.65, no.8, pp.5160-5175, Aug. 2019. 10.1109\/tit.2019.2903206","DOI":"10.1109\/TIT.2019.2903206"},{"key":"18","doi-asserted-by":"crossref","unstructured":"[18] Q. Wang, H. Sun, and M. Skoglund, \u201cThe \u03b5-error capacity of symmetric PIR with Byzantine adversaries,\u201d Proc. IEEE ITW 2018, Guangzhou, China, Nov. 2019. 10.1109\/itw.2018.8613332","DOI":"10.1109\/ITW.2018.8613332"},{"key":"19","doi-asserted-by":"crossref","unstructured":"[19] H. Yao, D. Silva, S. Jaggi, and M. Langberg, \u201cNetwork codes resilient to jamming and eavesdropping,\u201d IEEE\/ACM Trans. Netw., vol.22, no.6, pp.1978-1987, Dec. 2014. 10.1109\/netcod.2010.5487669","DOI":"10.1109\/TNET.2013.2294254"}],"container-title":["IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transfun\/E104.A\/9\/E104.A_2020DMP0018\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,8]],"date-time":"2024-05-08T04:39:51Z","timestamp":1715143191000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transfun\/E104.A\/9\/E104.A_2020DMP0018\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,9,1]]},"references-count":19,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2021]]}},"URL":"https:\/\/doi.org\/10.1587\/transfun.2020dmp0018","relation":{},"ISSN":["0916-8508","1745-1337"],"issn-type":[{"value":"0916-8508","type":"print"},{"value":"1745-1337","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,9,1]]},"article-number":"2020DMP0018"}}