{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T11:01:33Z","timestamp":1725793293163},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319063195"},{"type":"electronic","value":"9783319063201"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-06320-1_25","type":"book-chapter","created":{"date-parts":[[2014,4,28]],"date-time":"2014-04-28T00:59:27Z","timestamp":1398646767000},"page":"330-345","source":"Crossref","is-referenced-by-count":3,"title":["Proofs of Retrievability Based on MRD Codes"],"prefix":"10.1007","author":[{"given":"Shuai","family":"Han","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shengli","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kefei","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dawu","family":"Gu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"25_CR1","unstructured":"Maximilien, G., Zhiyuan, Y.: Properties of codes with the rank metric. Arxiv preprint cs\/0610099 (2006)"},{"issue":"2","key":"25_CR2","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1109\/18.75248","volume":"32","author":"R. Roth","year":"1991","unstructured":"Roth, R.: Maximum-rank array codes and their application to crisscross error correction. IEEE Transactions on Information Theory\u00a032(2), 328\u2013336 (1991)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"1","key":"25_CR3","first-page":"1","volume":"21","author":"E. Gabidulin","year":"1985","unstructured":"Gabidulin, E.: Theory of code with maximum rank distance. Problems of Information Transmission\u00a021(1), 1\u201312 (1985)","journal-title":"Problems of Information Transmission"},{"issue":"3","key":"25_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. Journal of Combinatorial Theory, Series A\u00a025(3), 226\u2013241 (1978)","journal-title":"Journal of Combinatorial Theory, Series A"},{"key":"25_CR5","doi-asserted-by":"publisher","first-page":"598","DOI":"10.1145\/1315245.1315318","volume-title":"Proceedings of the 14th ACM Conference on Computer and Communications Security (CCS 2007)","author":"G. Ateniese","year":"2007","unstructured":"Ateniese, G., Burns, R., Curtmola, R., Herring, J., Kissner, L., Peterson, Z., Song, D.: Provable data possession at untrusted stores. In: De Capitani di Vimercati, S., Syverson, P. (eds.) Proceedings of the 14th ACM Conference on Computer and Communications Security (CCS 2007), pp. 598\u2013609. ACM, New York (2007)"},{"key":"25_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/978-3-642-00457-5_8","volume-title":"Theory of Cryptography","author":"Y. Dodis","year":"2009","unstructured":"Dodis, Y., Vadhan, S., Wichs, D.: Proofs of retrievability via hardness amplification. In: Reingold, O. (ed.) TCC 2009. LNCS, vol.\u00a05444, pp. 109\u2013127. Springer, Heidelberg (2009)"},{"issue":"1-3","key":"25_CR7","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/s10623-008-9185-7","volume":"49","author":"E. Gabidulin","year":"2008","unstructured":"Gabidulin, E., Pilipchuk, N.: Error and erasure correcting algorithms for rank codes. Designs, Codes and Cryptography\u00a049(1-3), 105\u2013122 (2008)","journal-title":"Designs, Codes and Cryptography"},{"key":"25_CR8","doi-asserted-by":"publisher","first-page":"584","DOI":"10.1145\/1315245.1315317","volume-title":"Proceedings of the 14th ACM Conference on Computer and Communications Security (CCS 2007)","author":"A. Juels","year":"2007","unstructured":"Juels, A., Kaliski, B.: PORs: proofs of retrievability for large files. In: De Capitani di Vimercati, S., Syverson, P. (eds.) Proceedings of the 14th ACM Conference on Computer and Communications Security (CCS 2007), pp. 584\u2013597. ACM, New York (2007)"},{"key":"25_CR9","unstructured":"Shoup, V.: Sequences of games: a tool for taming complexity in security proofs. IACR Cryptology ePrint Archive, Report 2004\/332 (2004)"},{"key":"25_CR10","first-page":"12","volume-title":"Proceedings of ICDCS 2006","author":"T. Schwarz","year":"2006","unstructured":"Schwarz, T., Miller, E.: Store, forget, and check: using algebraic signatures to check remotely administered storage. In: Ahamad, M., Rodrigues, L. (eds.) Proceedings of ICDCS 2006, p. 12. IEEE Computer Society, Los Alamitos (2006)"},{"key":"25_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/978-3-540-89255-7_7","volume-title":"Advances in Cryptology - ASIACRYPT 2008","author":"H. Shacham","year":"2008","unstructured":"Shacham, H., Waters, B.: Compact proofs of retrievability. In: Pieprzyk, J. (ed.) ASIACRYPT 2008. LNCS, vol.\u00a05350, pp. 90\u2013107. Springer, Heidelberg (2008)"},{"key":"25_CR12","unstructured":"Wachter, A., Sidorenko, A., Bossert, M.: A fast linearized Euclidean algorithm for decoding Gabidulin codes. In: Twelfth International Workshop on Algebraic and Combinatorial Coding Theory (ACCT 2010), pp. 298\u2013303 (2010)"},{"key":"25_CR13","unstructured":"Han, S., Liu, S., Chen, K., Gu, D.: Proofs of data possession and retrievability based on MRD codes. IACR Cryptology ePrint Archive, Report 2013\/789 (2013)"},{"issue":"6","key":"25_CR14","doi-asserted-by":"publisher","first-page":"1587","DOI":"10.1109\/TNET.2011.2126592","volume":"19","author":"F. Oggier","year":"2011","unstructured":"Oggier, F., Fathi, H.: An authentication code against pollution attacks in network coding. IEEE\/ACM Transactions on Networking (TON)\u00a019(6), 1587\u20131596 (2011)","journal-title":"IEEE\/ACM Transactions on Networking (TON)"}],"container-title":["Lecture Notes in Computer Science","Information Security Practice and Experience"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-06320-1_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T18:04:20Z","timestamp":1558893860000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-06320-1_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319063195","9783319063201"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-06320-1_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}