{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T14:42:04Z","timestamp":1740148924907,"version":"3.37.3"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2018,1,13]],"date-time":"2018-01-13T00:00:00Z","timestamp":1515801600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100008394","name":"Natur og Univers, Det Frie Forskningsr\u00e5d","doi-asserted-by":"publisher","award":["DFF-4002-00367"],"award-info":[{"award-number":["DFF-4002-00367"]}],"id":[{"id":"10.13039\/100008394","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100008394","name":"Natur og Univers, Det Frie Forskningsr\u00e5d","doi-asserted-by":"publisher","award":["DFF-5137-00076B"],"award-info":[{"award-number":["DFF-5137-00076B"]}],"id":[{"id":"10.13039\/100008394","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cryptogr. Commun."],"published-print":{"date-parts":[[2019,3]]},"DOI":"10.1007\/s12095-018-0279-4","type":"journal-article","created":{"date-parts":[[2018,1,12]],"date-time":"2018-01-12T20:22:27Z","timestamp":1515788547000},"page":"147-166","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Universal secure rank-metric coding schemes with optimal communication overheads"],"prefix":"10.1007","volume":"11","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2626-8139","authenticated-orcid":false,"given":"Umberto","family":"Mart\u00ednez-Pe\u00f1as","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,1,13]]},"reference":[{"issue":"4","key":"279_CR1","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.Y.R., Yeung, R.W.: Network information flow. IEEE Trans. Inform. Theory 46(4), 1204\u20131216 (2000)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"99","key":"279_CR2","first-page":"1","volume":"PP","author":"R Bitar","year":"2017","unstructured":"Bitar, R., Rouayheb, S.E.: Staircase codes for secret sharing with optimal communication and read overheads. IEEE Trans. Inform. Theory PP(99), 1\u201315 (2017)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"279_CR3","volume-title":"Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing)","author":"TM Cover","year":"2006","unstructured":"Cover, T.M., Thomas, J.A.: Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing), 2nd edn. Wiley-Interscience, New York (2006)","edition":"2nd edn."},{"issue":"3","key":"279_CR4","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1016\/0097-3165(78)90015-8","volume":"25","author":"P Delsarte","year":"1978","unstructured":"Delsarte, P.: Bilinear forms over a finite field, with applications to coding theory. J. Combinatorial Theory Series A 25(3), 226\u2013241 (1978)","journal-title":"J. Combinatorial Theory Series A"},{"issue":"9","key":"279_CR5","doi-asserted-by":"publisher","first-page":"4539","DOI":"10.1109\/TIT.2010.2054295","volume":"56","author":"AG Dimakis","year":"2010","unstructured":"Dimakis, A.G., Godfrey, P.B., Wu, Y., Wainwright, M.J., Ramchandran, K.: Network coding for distributed storage systems. IEEE Trans. Inform. Theory 56(9), 4539\u20134551 (2010)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"3","key":"279_CR6","doi-asserted-by":"publisher","first-page":"476","DOI":"10.1109\/JPROC.2010.2096170","volume":"99","author":"AG Dimakis","year":"2011","unstructured":"Dimakis, A.G., Ramchandran, K., Wu, Y., Suh, C.: A survey on network codes for distributed storage. Proc. IEEE 99(3), 476\u2013489 (2011)","journal-title":"Proc. IEEE"},{"issue":"12","key":"279_CR7","doi-asserted-by":"publisher","first-page":"3289","DOI":"10.1109\/TIT.2003.820038","volume":"49","author":"EM Gabidulin","year":"2003","unstructured":"Gabidulin, E.M., Ourivski, A.V., Honary, B., Ammar, B.: Reducible rank codes and their applications to cryptography. IEEE Trans. Inform. Theory 49(12), 3289\u20133293 (2003)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"1","key":"279_CR8","first-page":"1","volume":"21","author":"EM Gabidulin","year":"1985","unstructured":"Gabidulin, E.M.: Theory of codes with maximum rank distance. Probl. Inf. Transm. 21(1), 1\u201312 (1985)","journal-title":"Probl. Inf. Transm."},{"issue":"11","key":"279_CR9","doi-asserted-by":"publisher","first-page":"6925","DOI":"10.1109\/TIT.2012.2208937","volume":"58","author":"P Gopalan","year":"2012","unstructured":"Gopalan, P., Huang, C., Simitci, H., Yekhanin, S.: On the locality of codeword symbols. IEEE Trans. Inform. Theory 58(11), 6925\u20136934 (2012)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"279_CR10","doi-asserted-by":"crossref","unstructured":"Guruswami, V., Wootters, M.: Repairing Reed-Solomon codes. In: Proc. 48th Annual ACM Symposium on Theory of Computing. ACM, pp. 216\u2013226 (2016)","DOI":"10.1145\/2897518.2897525"},{"issue":"10","key":"279_CR11","doi-asserted-by":"publisher","first-page":"4413","DOI":"10.1109\/TIT.2006.881746","volume":"52","author":"T Ho","year":"2006","unstructured":"Ho, T., Medard, M., Koetter, R., Karger, D., Effros, M., Shi, J., Leong, B.: A random linear network coding approach to multicast. IEEE Trans. Inform. Theory 52(10), 4413\u20134430 (2006)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"279_CR12","doi-asserted-by":"crossref","unstructured":"Huang, C., Chen, M., Li, J.: Pyramid codes: Flexible schemes to trade space for access efficiency in reliable data storage systems. In: Sixth IEEE International Symposium on Network Computing and Applications (NCA 2007), pp. 79\u201386 (2007)","DOI":"10.1109\/NCA.2007.37"},{"issue":"12","key":"279_CR13","doi-asserted-by":"publisher","first-page":"7195","DOI":"10.1109\/TIT.2016.2616144","volume":"62","author":"W Huang","year":"2016","unstructured":"Huang, W., Langberg, M., Kliewer, J., Bruck, J.: Communication efficient secret sharing. IEEE Trans. Inform. Theory 62(12), 7195\u20137206 (2016)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"279_CR14","doi-asserted-by":"crossref","unstructured":"Kadhe, S., Rouayheb, S.E., Duursma, I., Sprintson, A.: Rank-metric codes with local recoverability. In: Proc. 54th Annual Allerton Conference on Communication, Control and Computing (2016)","DOI":"10.1109\/ALLERTON.2016.7852348"},{"issue":"5","key":"279_CR15","doi-asserted-by":"publisher","first-page":"782","DOI":"10.1109\/TNET.2003.818197","volume":"11","author":"R K\u00f6tter","year":"2003","unstructured":"K\u00f6tter, R., Medard, M.: An algebraic approach to network coding. IEEE\/ACM Trans. Networking 11(5), 782\u2013795 (2003)","journal-title":"IEEE\/ACM Trans. Networking"},{"issue":"7","key":"279_CR16","doi-asserted-by":"publisher","first-page":"3912","DOI":"10.1109\/TIT.2015.2429713","volume":"61","author":"J Kurihara","year":"2015","unstructured":"Kurihara, J., Matsumoto, R., Uyematsu, T.: Relative generalized rank weight of linear codes and its applications to network coding. IEEE Trans. Inform. Theory 61(7), 3912\u20133936 (2015)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"2","key":"279_CR17","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1109\/TIT.2002.807285","volume":"49","author":"SY Li","year":"2003","unstructured":"Li, S.Y., Yeung, R., Cai, N.: Linear network coding. IEEE Trans. Inform. Theory 49(2), 371\u2013381 (2003)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"7","key":"279_CR18","doi-asserted-by":"publisher","first-page":"4081","DOI":"10.1109\/TIT.2016.2570238","volume":"62","author":"U Mart\u00ednez-Pe\u00f1as","year":"2016","unstructured":"Mart\u00ednez-Pe\u00f1as, U.: On the similarities between generalized rank and Hamming weights and their applications to network coding. IEEE Trans. Inform. Theory 62(7), 4081\u20134095 (2016)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"279_CR19","doi-asserted-by":"crossref","unstructured":"Mart\u00ednez-Pe\u00f1as, U.: Universal secure rank-metric coding schemes with optimal communication overheads. In: Proc 2017 IEEE International Symposium on Information Theory (ISIT), pp. 2761\u20132765 (2017)","DOI":"10.1109\/ISIT.2017.8007032"},{"issue":"8","key":"279_CR20","doi-asserted-by":"publisher","first-page":"5227","DOI":"10.1109\/TIT.2011.2159049","volume":"57","author":"KV Rashmi","year":"2011","unstructured":"Rashmi, K.V., Shah, N.B., Kumar, P.V.: Optimal exact-regenerating codes for distributed storage at the MSR and MBR points via a product-matrix construction. IEEE Trans. Inform. Theory 57(8), 5227\u20135239 (2011)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"2","key":"279_CR21","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1109\/18.75248","volume":"37","author":"RM Roth","year":"1991","unstructured":"Roth, R.M.: Maximum-rank array codes and their application to crisscross error correction. IEEE Trans. Inform. Theory 37(2), 328\u2013336 (1991)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"2","key":"279_CR22","doi-asserted-by":"publisher","first-page":"1124","DOI":"10.1109\/TIT.2010.2090212","volume":"57","author":"D Silva","year":"2011","unstructured":"Silva, D., Kschischang, F.R.: Universal secure network coding via rank-metric codes. IEEE Trans. Inform. Theory 57(2), 1124\u20131135 (2011)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"8","key":"279_CR23","doi-asserted-by":"publisher","first-page":"4661","DOI":"10.1109\/TIT.2014.2321280","volume":"60","author":"I Tamo","year":"2014","unstructured":"Tamo, I., Barg, A.: A family of optimal locally recoverable codes. IEEE Trans. Inform. Theory 60(8), 4661\u20134676 (2014)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"1","key":"279_CR24","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1109\/TIT.2007.911179","volume":"54","author":"H Wang","year":"2008","unstructured":"Wang, H., Wong, D.S.: On secret reconstruction in secret sharing schemes. IEEE Trans. Inform. Theory 54(1), 473\u2013480 (2008)","journal-title":"IEEE Trans. Inform. Theory"}],"container-title":["Cryptography and Communications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12095-018-0279-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-018-0279-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-018-0279-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,9]],"date-time":"2019-10-09T05:39:41Z","timestamp":1570599581000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12095-018-0279-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,1,13]]},"references-count":24,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2019,3]]}},"alternative-id":["279"],"URL":"https:\/\/doi.org\/10.1007\/s12095-018-0279-4","relation":{},"ISSN":["1936-2447","1936-2455"],"issn-type":[{"type":"print","value":"1936-2447"},{"type":"electronic","value":"1936-2455"}],"subject":[],"published":{"date-parts":[[2018,1,13]]},"assertion":[{"value":"25 August 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 January 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 January 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}