Abstract
Proofs of Data Possession (PoDP) scheme is essential to data outsourcing. It provides an efficient audit to convince a client that his/her file is available at the storage server, ready for retrieval when needed. An updated version of PoDP is Proofs of Retrievability (PoR), which proves the client’s file can be recovered by interactions with the storage server. We propose a PoR scheme based on Maximum Rank Distance (MRD) codes. The client file is encoded block-wise to generate homomorphic tags with help of an MRD code. In an audit, the storage provider is able to aggregate the blocks and tags into one block and one tag, due to the homomorphic property of tags. The algebraic structure of MRD codewords enables the aggregation to be operated over a binary field, which simplifies the computation of storage provider to be the most efficient XOR operation. With properties of MRD codes, we also prove an important security notion, namely soundness of PoR.
Corresponding Author: Shengli Liu. Funded by NSFC Nos.61170229, 61133014, 61373153, Innovation Project (No.12ZZ021) of Shanghai Municipal Education Commission, and Specialized Research Fund (No.20110073110016) for the Doctoral Program of Higher Education, Major State Basic Research Development Program (973 Plan)(No.2013CB338004).
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Maximilien, G., Zhiyuan, Y.: Properties of codes with the rank metric. Arxiv preprint cs/0610099 (2006)
Roth, R.: Maximum-rank array codes and their application to crisscross error correction. IEEE Transactions on Information Theory 32(2), 328–336 (1991)
Gabidulin, E.: Theory of code with maximum rank distance. Problems of Information Transmission 21(1), 1–12 (1985)
Delsarte, P.: Bilinear forms over a finite field, with applications to coding theory. Journal of Combinatorial Theory, Series A 25(3), 226–241 (1978)
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–609. ACM, New York (2007)
Dodis, Y., Vadhan, S., Wichs, D.: Proofs of retrievability via hardness amplification. In: Reingold, O. (ed.) TCC 2009. LNCS, vol. 5444, pp. 109–127. Springer, Heidelberg (2009)
Gabidulin, E., Pilipchuk, N.: Error and erasure correcting algorithms for rank codes. Designs, Codes and Cryptography 49(1-3), 105–122 (2008)
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–597. ACM, New York (2007)
Shoup, V.: Sequences of games: a tool for taming complexity in security proofs. IACR Cryptology ePrint Archive, Report 2004/332 (2004)
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)
Shacham, H., Waters, B.: Compact proofs of retrievability. In: Pieprzyk, J. (ed.) ASIACRYPT 2008. LNCS, vol. 5350, pp. 90–107. Springer, Heidelberg (2008)
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–303 (2010)
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)
Oggier, F., Fathi, H.: An authentication code against pollution attacks in network coding. IEEE/ACM Transactions on Networking (TON) 19(6), 1587–1596 (2011)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Han, S., Liu, S., Chen, K., Gu, D. (2014). Proofs of Retrievability Based on MRD Codes. In: Huang, X., Zhou, J. (eds) Information Security Practice and Experience. ISPEC 2014. Lecture Notes in Computer Science, vol 8434. Springer, Cham. https://doi.org/10.1007/978-3-319-06320-1_25
Download citation
DOI: https://doi.org/10.1007/978-3-319-06320-1_25
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-06319-5
Online ISBN: 978-3-319-06320-1
eBook Packages: Computer ScienceComputer Science (R0)