{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T03:37:41Z","timestamp":1775014661883,"version":"3.50.1"},"reference-count":24,"publisher":"Pleiades Publishing Ltd","issue":"2","license":[{"start":{"date-parts":[[2013,4,1]],"date-time":"2013-04-01T00:00:00Z","timestamp":1364774400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2013,4,1]],"date-time":"2013-04-01T00:00:00Z","timestamp":1364774400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Probl Inf Transm"],"published-print":{"date-parts":[[2013,4]]},"DOI":"10.1134\/s0032946013020075","type":"journal-article","created":{"date-parts":[[2013,7,12]],"date-time":"2013-07-12T11:07:34Z","timestamp":1373627254000},"page":"179-191","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Information security in a random network coding network"],"prefix":"10.1134","volume":"49","author":[{"given":"E. M.","family":"Gabidulin","sequence":"first","affiliation":[]},{"given":"N. I.","family":"Pilipchuk","sequence":"additional","affiliation":[]},{"given":"B.","family":"Honary","sequence":"additional","affiliation":[]},{"given":"H.","family":"Rashwan","sequence":"additional","affiliation":[]}],"member":"137","published-online":{"date-parts":[[2013,7,13]]},"reference":[{"issue":"7","key":"4170_CR1","doi-asserted-by":"publisher","first-page":"1204","DOI":"10.1109\/18.850663","volume":"47","author":"R Ahlswede","year":"2000","unstructured":"Ahlswede, R., Cai, N., Li, S.R., and Yeung, R.W., Network Information Flow, IEEE Trans. Inform. Theory, 2000, vol. 47, no. 7, pp. 1204\u20131216.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"4170_CR2","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1109\/ISIT.2003.1228459","volume-title":"Proc. 2003 Int. Sympos. on Information Theory (ISIT\u20192003), Yokohama, Japan","author":"T Ho","year":"2003","unstructured":"Ho, T., Koetter, R., M\u00e9dard, M., Karger, D.R., and Effros, M., The Benefits of Coding over Routing in a Randomized Setting, in Proc. 2003 Int. Sympos. on Information Theory (ISIT\u20192003), Yokohama, Japan, 2003, p. 442."},{"key":"4170_CR3","unstructured":"Chou, P.A., Wu, Y., and Jain, K., Practical Network Coding, in Proc. 41st Allerton Conf. on Communications, Control, and Computing, Monticello, IL, USA, 2003, pp. 40\u201349."},{"issue":"10","key":"4170_CR4","doi-asserted-by":"publisher","first-page":"4413","DOI":"10.1109\/TIT.2006.881746","volume":"52","author":"T Ho","year":"2006","unstructured":"Ho, T., M\u00e9dard, M., Koetter, R., Karger, D.R., Effros, M., Shi, J., and Leong, B., A Random Linear Network Coding Approach to Multicast, IEEE Trans. Inform. Theory, 2006, vol. 52, no. 10, pp. 4413\u20134430.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"4170_CR5","doi-asserted-by":"crossref","unstructured":"Koetter, R. and Kschischang, F.R., Coding for Errors and Erasures in Random Network Coding, in Proc. 2007 IEEE Int. Sympos. on Information Theory (ISIT\u20192007), Nice, France, 2007, pp. 791\u2013795.","DOI":"10.1109\/ISIT.2007.4557321"},{"issue":"9","key":"4170_CR6","doi-asserted-by":"publisher","first-page":"3951","DOI":"10.1109\/TIT.2008.928291","volume":"54","author":"D Silva","year":"2008","unstructured":"Silva, D., Kschischang, F.R., and Koetter, R., A Rank-Metric Approach to Error Control in Random Network Coding, IEEE Trans. Inform. Theory, 2008, vol. 54, no. 9, pp. 3951\u20133967.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"4170_CR7","series-title":"Lect. Notes Comp. Sci","doi-asserted-by":"crossref","first-page":"482","DOI":"10.1007\/3-540-46416-6_41","volume-title":"Advances in Cryptology (Proc. EUROCRYPT\u201991: Workshop on the Theory and Application of Cryptographic Techniques, Brighton, UK, 1991)","author":"EM Gabidulin","year":"1991","unstructured":"Gabidulin, E.M., Paramonov, A.V., and Tretjakov, O.V., Ideals over a Non-commutative Ring and Their Application in Cryptology, Advances in Cryptology (Proc. EUROCRYPT\u201991: Workshop on the Theory and Application of Cryptographic Techniques, Brighton, UK, 1991), Davies, D.W., Ed., Lect. Notes Comp. Sci, vol. 547. Berlin: Springer, 1991, pp. 482\u2013489."},{"key":"4170_CR8","doi-asserted-by":"crossref","unstructured":"Kshevetskiy, A., Security of GPT-like Public-Key Cryptosystem Based on Linear Rank Codes, in Proc. 3rd Int. Workshop on Signal Design and Its Applications in Communications (IWSDA\u201907), Chengdu, China, 2007, pp. 143\u2013147.","DOI":"10.1109\/IWSDA.2007.4408344"},{"key":"4170_CR9","doi-asserted-by":"crossref","unstructured":"Gabidulin, E.M., Rashwan, H., and Honary, B., On Improving Security of GPT Cryptosystems, in Proc. 2009 IEEE Int. Sympos. on Information Theory (ISIT\u20192009), Seoul, Korea, 2009, pp. 1110\u20131114.","DOI":"10.1109\/ISIT.2009.5206029"},{"key":"4170_CR10","doi-asserted-by":"crossref","unstructured":"Rashwan, H., Gabidulin, E.M., and Honary, B., A Smart Approach for GPT Cryptosystem Based on Rank Codes, in Proc. 2010 IEEE Int. Sympos. on Information Theory (ISIT\u20192010), Austin, Texas, USA, 2010, pp. 2463\u20132467.","DOI":"10.1109\/ISIT.2010.5513549"},{"issue":"8","key":"4170_CR11","doi-asserted-by":"publisher","first-page":"937","DOI":"10.1002\/sec.228","volume":"4","author":"H Rashwan","year":"2011","unstructured":"Rashwan, H., Gabidulin, E.M., and Honary, B., Security of the GPT Cryptosystems and Its Applications to Cryptography, Secur. Commun. Netw., 2011, vol. 4, no. 8, pp. 937\u2013946.","journal-title":"Secur. Commun. Netw."},{"key":"4170_CR12","unstructured":"Cai, N. and Yeung, R.W., Secure Network Coding, in Proc. 2002 IEEE Int. Sympos. on Information Theory (ISIT\u20192002), Lausanne, Switzerland, 2002, p. 323."},{"issue":"6","key":"4170_CR13","doi-asserted-by":"publisher","first-page":"2798","DOI":"10.1109\/TIT.2008.921894","volume":"54","author":"T Ho","year":"2008","unstructured":"Ho, T., Leong, B., Koetter, R., M\u00e9dard, M., Effros, M., and Karger, D., Byzantine Modification Detection in Multicast Networks with Random Network Coding, IEEE Trans. Inform. Theory, 2008, vol. 54, no. 6, pp. 2798\u20132803.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"6","key":"4170_CR14","doi-asserted-by":"publisher","first-page":"2596","DOI":"10.1109\/TIT.2008.921711","volume":"54","author":"S Jaggi","year":"2008","unstructured":"Jaggi, S., Langberg, M., Katti, S., Ho, T., Katabi, D., M\u00e9dard, M., and Effros, M., Resilient Network Coding in the Presence of Byzantine Adversaries, IEEE Trans. Inform. Theory, 2008, vol. 54, no. 6, pp. 2596\u20132603.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"1","key":"4170_CR15","first-page":"3","volume":"21","author":"EM Gabidulin","year":"1985","unstructured":"Gabidulin, E.M., Theory of Codes with Maximum Rank Distance, Probl. Peredachi Inf., 1985, vol. 21, no. 1, pp. 3\u201316 [Probl. Inf. Trans. (Engl. Transl.), 1985, vol. 21, no. 1, pp. 1\u201312].","journal-title":"Probl. Peredachi Inf."},{"key":"4170_CR16","series-title":"Lect. Notes Comp. Sci.","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1007\/BFb0034349","volume-title":"Proc. 1st French-Soviet Workshop on Algebraic Coding, Paris, France, 1991","author":"EM Gabidulin","year":"1992","unstructured":"Gabidulin, E.M., A FastMatrix Decoding Algorithm for Rank-Error-CorrectingCodes, Proc. 1st French-Soviet Workshop on Algebraic Coding, Paris, France, 1991, Cohen, G., Litsyn, S., Lobstein, A., and Z\u00e9mor, G., Eds., Lect. Notes Comp. Sci., vol. 573, Berlin: Springer, 1992, pp. 126\u2013133."},{"issue":"1\u20133","key":"4170_CR17","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/s10623-008-9185-7","volume":"49","author":"EM Gabidulin","year":"2008","unstructured":"Gabidulin, E.M. and Pilipchuk, N.I., Error and Erasure Correcting Algorithms for Rank Codes, Des. Codes Cryptogr., 2008, vol. 49, no. 1\u20133, pp. 105\u2013122.","journal-title":"Des. Codes Cryptogr."},{"key":"4170_CR18","doi-asserted-by":"crossref","unstructured":"Silva, D. and Kschischang, F.R., Fast Encoding and Decoding of Gabidulin Codes, in Proc. 2009 Int. Sympos. on Information Theory (ISIT\u20192009), Seoul, Korea, 2009, pp. 2858\u20132862.","DOI":"10.1109\/ISIT.2009.5205272"},{"issue":"4","key":"4170_CR19","first-page":"33","volume":"46","author":"EM Gabidulin","year":"2010","unstructured":"Gabidulin, E.M., Pilipchuk, N.I., and Bossert, M., Decoding of Random Network Codes, Probl. Peredachi Inf., 2010, vol. 46, no. 4, pp. 33\u201355 [Probl. Inf. Trans. (Engl. Transl.), 2010, vol. 46, no. 4, pp. 300\u2013320].","journal-title":"Probl. Peredachi Inf."},{"key":"4170_CR20","doi-asserted-by":"crossref","unstructured":"Silva, D. and Kschischang, F., Universal Secure Error-Correcting Schemes for Network Coding, in Proc. 2010 IEEE Int. Sympos. on Information Theory (ISIT\u20192010), Austin, Texas, USA, 2010, pp. 2428\u20132432.","DOI":"10.1109\/ISIT.2010.5513776"},{"key":"4170_CR21","doi-asserted-by":"crossref","unstructured":"Tao, F., Bingtao, Z., and Jiangfeng, M., Security Random Network Coding Model Against Byzantine Attack Based on CBC, in Proc. 4th Int. Conf. on Intelligent Computation Technology and Automation (ICICTA\u20192011), Shenzhen, Guangdong, China, 2011, vol. 2, pp. 1178\u20131181.","DOI":"10.1109\/ICICTA.2011.580"},{"key":"4170_CR22","first-page":"11","volume-title":"Proc. 4th Int. Colloq. on Coding Theory, Dilijan, Armenia, 1991","author":"EM Gabidulin","year":"1992","unstructured":"Gabidulin, E.M., Paramonov, A.V., and Tretjakov, O.V., Rank Errors and Rank Erasures Correction, in Proc. 4th Int. Colloq. on Coding Theory, Dilijan, Armenia, 1991, Yerevan, 1992, pp. 11\u201319."},{"issue":"3","key":"4170_CR23","first-page":"83","volume":"38","author":"AV Ourivski","year":"2002","unstructured":"Ourivski, A.V. and Johansson, T., New Technique for Decoding Codes in the Rank Metric and Its Cryptography Applications, Probl. Peredachi Inf., 2002, vol. 38, no. 3, pp. 83\u201393 [Probl. Inf. Trans. (Engl. Transl.), 2002, vol. 38, no. 3, pp. 237\u2013246].","journal-title":"Probl. Peredachi Inf."},{"key":"4170_CR24","volume-title":"On the Complexity of the Rank Syndrome Decoding Problem","author":"P Gaborit","year":"2013","unstructured":"Gaborit, P., Ruatta, O., and Schrek, J., On the Complexity of the Rank Syndrome Decoding Problem, arXiv:1301.1026v1 [cs.CR], 2013."}],"container-title":["Problems of Information Transmission"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0032946013020075.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1134\/S0032946013020075","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1134\/S0032946013020075","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0032946013020075.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T02:20:31Z","timestamp":1775010031000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1134\/S0032946013020075"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,4]]},"references-count":24,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2013,4]]}},"alternative-id":["4170"],"URL":"https:\/\/doi.org\/10.1134\/s0032946013020075","relation":{},"ISSN":["0032-9460","1608-3253"],"issn-type":[{"value":"0032-9460","type":"print"},{"value":"1608-3253","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,4]]},"assertion":[{"value":"24 April 2012","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 December 2012","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 July 2013","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}