Store, forget, and check: Using algebraic signatures to check remotely administered storage

Proceedings - International Conference on Distributed Computing Systems

Volumn 2006, Issue , 2006, Pages 12-

  Thomas Schwarz, S J ^a   Miller, Ethan L ^b  

^a Santa Clara University   (United States)

^b University of California Santa Cruz   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; BANDWIDTH; DATA STORAGE EQUIPMENT; DISTRIBUTED COMPUTER SYSTEMS; INTERNET; PROBLEM SOLVING;

ALGEBRAIC SIGNATURES; BLIND DATA; DISTRIBUTED STORAGE SYSTEMS; HASH FUNCTIONS;

ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS;

EID: 33947694320     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDCS.2006.80     Document Type: Conference Paper

References (35)

1. A. Adya, W. J. Bolosky, M. Castro, R. Chaiken, G. Cermak, J. R. Douceur, J. Howell, J. R. Lorch, M. Theimer, and R. Wattenhofer. FARSITE: Federated, available, and reliable storage for an incompletely trusted environment. In Proceedings of the 5th Symposium on Operating Systems Design and Implementation (OSDI), Boston, MA, Dec. 2002. USENIX.
2. M. Blaum, J. Brady, J. Bruck, and J. Menon. EVEN-ODD: An efficient scheme for tolerating double disk failures in RAID architectures. IEEE Transactions on Computers, 44(2): 192-202, 1995.
3. M. Blaum, P. G. Farrell, and H. C. A. van Tilborg. Array codes. In V. S. Pless and W. C. Huffman, editors, Handbook of Coding Theory, volume 2. North-Holland, Elsevier Science, 1998.
4. A. Z. Broder. Some applications of Rabin's fingerprinting method. In R. Capocelli, A. D. Santis, and U. Vaccaro, editors, Sequences II: Methods in Communications, Security, and Computer Science, pages 143-152. Springer-Verlag, 1993.
5. A. Z. Broder. On the resemblance and containment of documents. In Proceedings of Compression and Complexity of Sequences (SEQUENCES '97), pages 21-29. IEEE Computer Society, 1998.
6. A. Z. Broder, S. C. Glassman, M. S. Manasse, and G. Zweig. Syntactic clustering of the web. In Proceedings of the 6th International World Wide Web Conference, pages 391-404, Santa Clara, California, United States, Apr. 1997.
7. G. Caronni and M. Waldvogel. Establishing trust in distributed storage providers. In Proceedings of the Third International Conferences on Peer-to-Peer Computing, pages 128-133. IEEE, Sept. 2003.
8. I. Clarke, O. Sandberg, B. Wiley, and T. W. Hong. Freenet: A distributed anonymous information storage and retrieval system. Lecture Notes in Computer Science, 2009:46+, 2001.
9. P. Corbett, B. English, A. Goel, T. Grcanac, S. Kleiman, J. Leong, and S. Sankar. Row-diagonal parity for double disk failure correction. In Proceedings of the Third USENIX Conference on File and Storage Technologies (FAST), pages 1-14, 2004.
10. F. Dabek, M. F. Kaashoek, D. Karger, R. Morris, and I. Stoica. Wide-area cooperative storage with CFS. In Proceedings of the 18th ACM Symposium on Operating Systems Principles (SOSP '01), pages 202-215, Banff, Canada, Oct. 2001. ACM.
11. F. Dabek, B. Zhao, P. Druschel, J. Kubiatowicz, and I. Stoica. Towards a common API for structured peer-to-peer overlays. In Peer-to-Peer Systems II: Second International Workshop, IPTPS 2003, Springer Lecture Notes in Computer Science 2753, pages 33-44, Berkeley, CA, USA, Feb. 2003.
12. E. Gabber, J. Fellin, M. Flaster, F. Gu, B. Hillyer, W. T. Ng, B. Özden, and E. Shriver. StarFish: Highly-available block storage. In Proceedings of the Freenix Track: 2003 USENIX Annual Technical Conference, pages 151-163, San Antonio, TX, June 2003.
13. A. V. Goldberg and P. N. Yianilos. Towards and archival intermemory. In Advances in Digital Libraries ADL'98, pages 1-9, April 1998.
14. G. R. Goodson, J. J. Wylie, G. R. Ganger, and M. K. Reiter. Efficient Byzantine-tolerant erasure-coded storage. In Proceedings of the 2004 International Conference on Dependable Systems and Networking (DSN 2004), June 2004.
15. M. C. Harrison. Implementation of the substring test by hashing. Communications of the ACM, 14(12):777 - 779, December 1971.
16. L. Hellerstein, G. A. Gibson, R. M. Karp, R. H. Katz, and D. A. Patterson. Coding techniques for handling failures in large disk arrays. Algorithmica, 12:182-208, 1994.
17. R. M. Karp and M. O. Rabin. Efficient randomized pattern-matching algorithms. IBM Journal of Research and Development, 31(2):249-260, Mar. 1987.
18. J. Kubiatowicz, D. Bindel, Y. Chen, P. Eaton, D. Geels, R. Gummadi, S. Rhea, H. Weatherspoon, W. Weimer, C. Wells, and B. Zhao. OceanStore: An architecture for global-scale persistent storage. In Proceedings of the 9th International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS), Cambridge, MA, Nov. 2000. ACM.
19. M. Lillibridge, S. Elnikety, A. Birrell, M. Burrows, and M. Isard. A cooperative Internet backup scheme. In Proceedings of the 2003 USENIX Annual Technical Conference, pages 29-42, San Antonio, TX, 2003.
20. W. Litwin, R. Moussa, and T. Schwarz. LH*RS - a highly-available scalable distributed data structure. ACM Transactions on Database Systems, 30(3):769-811, 2005.
21. RS: A high-availability scalable distributed data structure using Reed Solomon codes. In Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data, pages 237-248, Dallas, TX, May 2000. ACM.
22. W. Litwin and T. Schwarz. Algebraic signatures for scalable, distributed data structures. In Proceedings of the 20th International Conference on Data Engineering (ICDE '04), pages 412-423, Boston, MA, 2004.
23. M. G. Luby, M. Mitzenmacher, M. A. Shokrollahi, and D. A. Spielman. Efficient erasure correcting codes. IEEE Transactions on Information Theory, 47(2):569-584, February 2001.
24. F. J. MacWilliams and N. J. Sloane. The Theory of Error Correcting Codes. Elsevier Science B.V., 1983.
25. P. Maniatis, M. Roussopoulos, T. J. Giuli, D. S. H. Rosenthal, and M. Baker. The LOCKSS peer-to-peer digital preservation system. ACM Transactions on Computer Systems, 23(1):2-50, 2005.
26. E. L. Miller, D. D. E. Long, W. E. Freeman, and B. C. Reed. Strong security for network-attached storage. In Proceedings of the 2002 Conference on File and Storage Technologies (FAST), pages 1-13, Monterey, CA, Jan. 2002.
27. A. Muthitacharoen, R. Morris, T. M. Gil, and B. Chen. Ivy: A read/write peer-to-peer file system. In Proceedings of the 5th Symposium on Operating Systems Design and Implementation (OSDI), Boston, MA, Dec. 2002.
28. M. O. Rabin. Fingerprinting by random polynomials. Technical Report TR-15-81, Center for Research in Computing Technology, Harvard University, 1981.
29. M. O. Rabin. Efficient dispersal of information for security, load balancing, and fault tolerance. Journal of the ACM, 36:335-348, 1989.
30. E. Riedel, M. Kallahalla, and R. Swaminathan. A framework for evaluating storage system security. In Proceedings of the 2002 Conference on File and Storage Technologies (FAST), Monterey, CA, Jan. 2002.
31. M. Ripeanu, A. lamnitchi, and I. Foster. Mapping the Gnutella network. IEEE Internet Computing, 6(1):50-57, Aug. 2002.
32. A. Rowstron and P. Druschel. Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility. In Proceedings of the 18th ACM Symposium on Operating Systems Principles (SOSP '01), pages 188-201, Banff, Canada, Oct. 2001. ACM.
33. T. Schwarz. Verification of parity data in large scale storage systems. In Proceedings of the 2004 International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA '00), Las Vegas, NV, 2004.
34. T. J. Schwarz, R. W. Bowdidge, and W. A. Burkhard. Low cost comparison of files. In Proceedings of the 10th International Conference on Distributed Computing Systems (ICDCS '90), pages 196-201, 1990.
35. L. Xu and J. Bruck. X-code: MDS array codes with optimal encoding. IEEE Transactions on Information Theory, 45(1):272-276, 1999.