Verifying distributed erasure-coded data

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn , Issue , 2007, Pages 139-146

  Hendricks, James ^a   Ganger, Gregory R ^a   Reiter, Michael K ^b  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b UNIVERSITY OF NORTH CAROLINA   (United States)

Author keywords

Erasure codes; Fault tolerant storage; Homomorphic fingerprinting

Indexed keywords

DELIVERY SYSTEMS; ERASURE CODING; FAULT-TOLERANT STORAGE; HOMOMORPHIC FINGERPRINTING;

DATA STORAGE EQUIPMENT; DISTRIBUTED COMPUTER SYSTEMS; FAULT TOLERANT COMPUTER SYSTEMS;

COMPUTER SCIENCE;

EID: 36849036863     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1281100.1281122     Document Type: Conference Paper

References (32)

1. M. K. Aguilera, R. Janakiraman, and L. Xu. Using erasure codes efficiently for storage in a distributed system. In Proceedings of the International Conference on Dependable Systems and Networks, pages 336-345. IEEE Computer Society, 2005.
2. M. Bellare, O. Goldreich, and S. Goldwasser. Incremental cryptography: The case of hashing and signing. In Advances in Cryptology - CRYPTO '94, pages 216-233. Springer-Verlag, 1994.
3. st ACM Conference on Computer and Communications Security, pages 62-73. ACM Press, 1993.
4. A. Z. Broder. Some applications of Rabin's fingerprinting method. Sequences II: Methods in Communications, Security, and Computer Science, pages 143-152, 1993.
5. th IEEE Symposium on Reliable Distributed Systems, pages 191-202. IEEE Press, 2005.
6. C. Cachin and S. Tessaro. Optimal resilience for erasure-coded Byzantine distributed storage. In Proceedings of the International Conference on Dependable Systems and Networks, pages 115-124. IEEE Computer Society, 2006.
7. th ACM Symposium on Theory of Computing, pages 106-112. ACM Press, 1977.
8. th ACM Symposium on Operating Systems Principles, pages 298-313. ACM Press, 2003.
9. th Annual Symposium on the Foundations of Computer Science, pages 383-395. IEEE Press, 1985.
10. th Annual Symposium on the Foundations of Computer Science, pages 427-437. IEEE Press, 1987.
11. B. Gladman. SHA1, SHA2, HMAC and key derivation in C. http://fp.gladman.plus.com/cryptography.technology/sha.
12. th International Conference on Distributed Computing Systems, pages 85-91. IEEE Computer Society, 1989.
13. G. R. Goodson, J. J. Wylie, G. R. Ganger, and M. K. Reiter. Efficient Byzantine-tolerant erasure-coded storage. In Proceedings of the International Conference on Dependable Systems and Networks, pages 135-144. IEEE Computer Society, 2004.
14. G. R. Goodson, J. J. Wylie, G. R. Ganger, and M. K. Reiter. The safety and liveness properties of a protocol family for versatile survivable storage infrastructures. Technical Report CMU-PDL-03-105, Parallel Data Laboratory, Carnegie Mellon University, 2004.
15. th ACM Symposium on Principles of Distributed Computing, pages 207-2.18. ACM Press, 1993.
16. H. Krawczyk. LFSR-based hashing and authentication. In Advances in Cryptology - CRYPTO '94, pages 129-139. Springer-Verlag, 1994.
17. M. N. Krohn, M. J. Freedman, and D. Mazieres. On-the-fly verification of rateless erasure codes for efficient content distribution. In Proceedings of the IEEE Symposium on Security and Privacy. IEEE Press, 2004.
18. th International Conference on Architectural Support for Programming Languages and Operating Systems, pages 190-201. ACM Press, 2000.
19. P. Maymounkov. Online codes. Technical Report TR2002-833, Secure Computer Systems Group, New York University, 2002.
20. K. Mehlhorn and U. Vishkin. Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories. Acta Informatica, 21(4):339-374, 1984.
21. M. Naor, B. Pinkas, and O. Reingold. Distributed pseudo-random functions and KDCs. In Advances in Cryptology - EUROCRYPT '99, pages 327-346. Springer-Verlag, 1999.
22. W. Nevelsteen and B. Preneel. Software performance of universal hash functions. In Advances in Cryptology -EUROCRYPT '99, pages 24-41. Springer-Verlag, 1999.
23. T. Pedersen. Distributed provers with applications to undeniable signatures. In Advances in Cryptology -EUROCRYPT '91, pages 221-242. Springer-Verlag, 1991.
24. M. O. Rabin. Fingerprinting by random polynomials. Technical Report TR-15-81, Center for Research in Computing Technology, Harvard University, 1981.
25. M. O. Rabin. Efficient dispersal of information for security, load balancing, and fault tolerance. Journal of the ACM, 36(2):335-348, 1989.
26. I. S. Reed and G. Solomon. Polynomial codes over certain finite fields. SIAM Journal of Applied Mathematics, 8:300-304, 1960.
27. th International Workshop on Fast Software Encryption. Springer-Verlag, 2004.
28. th International Conference on Architectural Support for Programming Languages and Operating Systems, pages 48-58. ACM Press, 2004.
29. T. Schwarz. Verification of parity data in large scale storage systems. In Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications. CSREA Press, 2004.
30. V. Shoup. On fast and provably secure message authentication based on universal hashing. In Advances in Cryptology - CRYPTO '96, pages 313-328. Springer-Verlag, 1996.
31. M. A. Stadler. Publicly verifiable secret sharing. In Advances in Cryptology - EUROCRYPT '96, pages 190-199. Springer-Verlag, 1996.
32. D. Travis. On irreducible polynomials in Galois fields. The American Mathematical Monthly, 70(10): 1089-1090, 1963.