Proofs of retrievability based on MRD codes

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 8434 LNCS, Issue , 2014, Pages 330-345

  Han, Shuai ^a   Liu, Shengli ^a   Chen, Kefei ^b   Gu, Dawu ^a  

^a SHANGHAI JIAO TONG UNIVERSITY   (China)

^b HANGZHOU NORMAL UNIVERSITY   (China)

Author keywords

cloud storage; data integrity; MRD codes; Proofs of retrievability

Indexed keywords

CODES (SYMBOLS); MANAGEMENT; SECURITY OF DATA; SECURITY SYSTEMS;

ALGEBRAIC STRUCTURES; CLOUD STORAGES; DATA INTEGRITY; DATA OUTSOURCING; HOMOMORPHIC PROPERTY; MAXIMUM RANK DISTANCE CODES; MRD CODES; PROOFS OF RETRIEVABILITY;

DIGITAL STORAGE;

EID: 84901660429     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-319-06320-1_25     Document Type: Conference Paper

References (14)

1. Maximilien, G., Zhiyuan, Y.: Properties of codes with the rank metric. Arxiv preprint cs/0610099 (2006)
2. Roth, R.: Maximum-rank array codes and their application to crisscross error correction. IEEE Transactions on Information Theory 32(2), 328-336 (1991)
3. Gabidulin, E.: Theory of code with maximum rank distance. Problems of Information Transmission 21(1), 1-12 (1985)
4. Delsarte, P.: Bilinear forms over a finite field, with applications to coding theory. Journal of Combinatorial Theory, Series A 25(3), 226-241 (1978)
5. 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)
6. 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)
7. Gabidulin, E., Pilipchuk, N.: Error and erasure correcting algorithms for rank codes. Designs, Codes and Cryptography 49(1-3), 105-122 (2008)
8. 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)
9. Shoup, V.: Sequences of games: a tool for taming complexity in security proofs. IACR Cryptology ePrint Archive, Report 2004/332 (2004)
10. 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)
11. Shacham, H., Waters, B.: Compact proofs of retrievability. In: Pieprzyk, J. (ed.) ASIACRYPT 2008. LNCS, vol. 5350, pp. 90-107. Springer, Heidelberg (2008)
12. 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)
13. 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)
14. Oggier, F., Fathi, H.: An authentication code against pollution attacks in network coding. IEEE/ACM Transactions on Networking (TON) 19(6), 1587-1596 (2011)