{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,11]],"date-time":"2026-06-11T17:52:29Z","timestamp":1781200349974,"version":"3.54.1"},"reference-count":10,"publisher":"Pleiades Publishing Ltd","issue":"1","license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015,1]]},"DOI":"10.1134\/s0032946015010081","type":"journal-article","created":{"date-parts":[[2015,4,15]],"date-time":"2015-04-15T08:15:00Z","timestamp":1429085700000},"page":"75-81","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["A new method for ensuring anonymity and security in network coding"],"prefix":"10.1134","volume":"51","author":[{"given":"O. V.","family":"Trushina","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"E. M.","family":"Gabidulin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"137","published-online":{"date-parts":[[2015,4,16]]},"reference":[{"key":"4224_CR1","unstructured":"Gabidulin, E.M. and Trushina, O.V., Anonymous and Security Network Coding, in Proc. 7th Int. Workshop on Optimal Codes and Related Topics (OC\u20192013), Albena, Bulgaria, Sept. 6\u201312, 2013, pp. 85\u201390."},{"issue":"4","key":"4224_CR2","doi-asserted-by":"publisher","first-page":"1204","DOI":"10.1109\/18.850663","volume":"46","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. 46, no. 4, pp. 1204\u20131216.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"10","key":"4224_CR3","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":"4224_CR4","unstructured":"Lehman, A.R. and Lehman, E., Complexity Classification of Network Information Flow Problems, in Proc. 15th Annual ACM-SIAM Sympos. on Discrete Algorithms, New Orleans, LA, Jan. 11\u201313, 2004, pp. 142\u2013150."},{"key":"4224_CR5","doi-asserted-by":"crossref","unstructured":"Meng, C., Seferoglu, H., Markopoulou, A., Shum, K.W., and Chang, C., Multicast Packing for Coding across Multiple Unicasts, in Proc. 2013 Int. Sympos. on Network Coding (NetCod\u20192013), Calgary, Alberta, Canada, June 7\u20139, 2013, pp. 37\u201342.","DOI":"10.1109\/NetCod.2013.6570820"},{"key":"4224_CR6","doi-asserted-by":"crossref","unstructured":"Traskov, D., Ratnakar, N., Lun, D.S., Koetter, R., and M\u00e9dard, M., Network Coding for Multiple Unicasts: An Approach Based on Linear Optimization, in Proc. 2006 IEEE Int. Sympos. on Information Theory (ISIT\u20192006), Seattle, WA, July 9\u201314, 2006, pp. 1758\u20131762.","DOI":"10.1109\/ISIT.2006.261656"},{"issue":"1","key":"4224_CR7","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."},{"issue":"2","key":"4224_CR8","doi-asserted-by":"publisher","first-page":"1124","DOI":"10.1109\/TIT.2010.2090212","volume":"57","author":"D Silva","year":"2011","unstructured":"Silva, D. and Kschischang, R., Universal Secure Network Coding via Rank-Metric Codes, IEEE Trans. Inform. Theory, 2011, vol. 57, no. 2, pp. 1124\u20131135.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"10","key":"4224_CR9","doi-asserted-by":"publisher","first-page":"2135","DOI":"10.1002\/j.1538-7305.1984.tb00072.x","volume":"63","author":"LH Ozarow","year":"1984","unstructured":"Ozarow, L.H. and Wyner, A.D., Wire-Tap Channel II, AT &T Bell Labs. Tech. J., 1984, vol. 63, no. 10, pp. 2135\u20132157.","journal-title":"AT &T Bell Labs. Tech. J."},{"issue":"9","key":"4224_CR10","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"}],"container-title":["Problems of Information Transmission"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0032946015010081.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1134\/S0032946015010081","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1134\/S0032946015010081","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0032946015010081.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T02:20:56Z","timestamp":1775010056000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1134\/S0032946015010081"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,1]]},"references-count":10,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,1]]}},"alternative-id":["4224"],"URL":"https:\/\/doi.org\/10.1134\/s0032946015010081","relation":{},"ISSN":["0032-9460","1608-3253"],"issn-type":[{"value":"0032-9460","type":"print"},{"value":"1608-3253","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,1]]},"assertion":[{"value":"18 April 2014","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 November 2014","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 April 2015","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}