{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:43:31Z","timestamp":1750308211547,"version":"3.41.0"},"reference-count":29,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2005,2,1]],"date-time":"2005-02-01T00:00:00Z","timestamp":1107216000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Storage"],"published-print":{"date-parts":[[2005,2]]},"abstract":"<jats:p>\n            DISP is a practical client-server protocol for the distributed storage of immutable data objects. Unlike most other contemporary protocols, DISP permits applications to make explicit tradeoffs between total storage space, computational overhead, and guarantees of availability, integrity, and privacy on a per-object basis. Applications specify the degree of redundancy with which each item is encoded, what level of integrity checks are computed and stored with each item, and whether items are stored in an encrypted format. At one extreme, clients willing to pay the overhead are guaranteed privacy, integrity, and availability of data stored in the system as long as fewer than half the servers are Byzantine. At the other extreme, objects that do not require privacy or integrity in the face of Byzantine servers can be stored with very low computational and storage overhead.DISP is efficient in terms of message count, message size, and storage requirements: even in the worst case, the read and write protocols require a number of messages that are linear with respect to the number of servers. In terms of message size, DISP requires transferring only marginally more than\n            <jats:italic>L<\/jats:italic>\n            bytes to correctly read an object of size\n            <jats:italic>L<\/jats:italic>\n            , even in the face of Byzantine server failures. In this article we provide a description of DISP and an analysis of its fault-tolerant properties. We also analyze the complexity of the protocol and discuss several potential applications. We conclude with a description of our prototype implementation and measurements of its performance on commodity hardware.\n          <\/jats:p>","DOI":"10.1145\/1044956.1044960","type":"journal-article","created":{"date-parts":[[2005,8,1]],"date-time":"2005-08-01T15:52:42Z","timestamp":1122911562000},"page":"71-94","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["DISP"],"prefix":"10.1145","volume":"1","author":[{"given":"Daniel","family":"Ellard","sequence":"first","affiliation":[{"name":"Sun Microsystems, Burlington, MA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"James","family":"Megquier","sequence":"additional","affiliation":[{"name":"\/etc consulting"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2005,2]]},"reference":[{"volume-title":"Proceedings of the 27th International Colloquium on Automata, Languages and Programming. Springer-Verlag","author":"Alon N.","key":"e_1_2_1_1_1","unstructured":"Alon , N. , Kaplan , H. , Krivelevich , M. , Malkhi , D. , and Stern , J. P . 2000. Scalable secure storage when half the system is faulty . In Proceedings of the 27th International Colloquium on Automata, Languages and Programming. Springer-Verlag , Berlin, Germany, 576--587.]] Alon, N., Kaplan, H., Krivelevich, M., Malkhi, D., and Stern, J. P. 2000. Scalable secure storage when half the system is faulty. In Proceedings of the 27th International Colloquium on Automata, Languages and Programming. Springer-Verlag, Berlin, Germany, 576--587.]]"},{"key":"e_1_2_1_2_1","volume-title":"Proceedings of the 1st International Conference on the Theory and Applications of Cryptography (PRAGOCRYPT'96)","author":"Anderson R.","year":"1996","unstructured":"Anderson , R. 1996 . The eternity service . In Proceedings of the 1st International Conference on the Theory and Applications of Cryptography (PRAGOCRYPT'96) . 242--252.]] Anderson, R. 1996. The eternity service. In Proceedings of the 1st International Conference on the Theory and Applications of Cryptography (PRAGOCRYPT'96). 242--252.]]"},{"volume-title":"Proceedings of the Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM'99)","author":"Apostolopoulos G.","key":"e_1_2_1_3_1","unstructured":"Apostolopoulos , G. , Peris , V. G. J. , and Saha , D . 1999. Transport layer security: How much does it really cost? In Proceedings of the Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM'99) . IEEE Computer Society Press, Washington, DC, 717--725.]] Apostolopoulos, G., Peris, V. G. J., and Saha, D. 1999. Transport layer security: How much does it really cost? In Proceedings of the Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM'99). IEEE Computer Society Press, Washington, DC, 717--725.]]"},{"volume-title":"Proceedings of the Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM'99)","author":"Byers J. W.","key":"e_1_2_1_4_1","unstructured":"Byers , J. W. , Luby , M. , and Mitzenmacher , M . 1999. Accessing multiple mirror sites in parallel: Using tornado codes to speed up downloads . In Proceedings of the Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM'99) . IEEE Computer Society Press, Washington, DC, 275--283.]] Byers, J. W., Luby, M., and Mitzenmacher, M. 1999. Accessing multiple mirror sites in parallel: Using tornado codes to speed up downloads. In Proceedings of the Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM'99). IEEE Computer Society Press, Washington, DC, 275--283.]]"},{"volume-title":"Proceedings of the ACM SIGCOMM '98 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication. ACM Press","author":"Byers J. W.","key":"e_1_2_1_5_1","unstructured":"Byers , J. W. , Luby , M. , Mitzenmacher , M. , and Rege , A . 1998. A digital fountain approach to reliable distribution of bulk data . In Proceedings of the ACM SIGCOMM '98 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication. ACM Press , New York, NY, 56--67.]] 10.1145\/285237.285258 Byers, J. W., Luby, M., Mitzenmacher, M., and Rege, A. 1998. A digital fountain approach to reliable distribution of bulk data. In Proceedings of the ACM SIGCOMM '98 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication. ACM Press, New York, NY, 56--67.]] 10.1145\/285237.285258"},{"volume-title":"Proceedings of the 3rd USENIX Symposium on Operating Systems Design and Implementation (OSDI'99)","author":"Castro M.","key":"e_1_2_1_6_1","unstructured":"Castro , M. and Liskov , B . 1999. Practical Byzantine fault tolerance . In Proceedings of the 3rd USENIX Symposium on Operating Systems Design and Implementation (OSDI'99) . The USENIX Association, Berkeley, CA, 173--186.]] Castro, M. and Liskov, B. 1999. Practical Byzantine fault tolerance. In Proceedings of the 3rd USENIX Symposium on Operating Systems Design and Implementation (OSDI'99). The USENIX Association, Berkeley, CA, 173--186.]]"},{"volume-title":"Proceedings of the USENIX Conference on File and Storage Technologies (FAST'04)","author":"Corbett P.","key":"e_1_2_1_7_1","unstructured":"Corbett , P. , English , B. , Goel , A. , Grcanac , T. , Kleiman , S. , Leong , J. , and Sankar , S . 2004. Row-diagonal parity for double disk failure correction . In Proceedings of the USENIX Conference on File and Storage Technologies (FAST'04) . The USENIX Association, Berkeley, CA, 1--14.]] Corbett, P., English, B., Goel, A., Grcanac, T., Kleiman, S., Leong, J., and Sankar, S. 2004. Row-diagonal parity for double disk failure correction. In Proceedings of the USENIX Conference on File and Storage Technologies (FAST'04). The USENIX Association, Berkeley, CA, 1--14.]]"},{"key":"e_1_2_1_8_1","volume-title":"Proceedings of the 18th ACM Symposium on Operating Systems Principles (SOSP 2001","author":"Dabek F.","year":"2034","unstructured":"Dabek , F. , Kaashoek , M. F. , Karger , D. , Morris , R. , and Stoica , I . 2001. Wide-area cooperative storage with CFS . In Proceedings of the 18th ACM Symposium on Operating Systems Principles (SOSP 2001 ). ACM Press, New York, NY, 202--215.]] 10.1145\/50 2034 .502054 Dabek, F., Kaashoek, M. F., Karger, D., Morris, R., and Stoica, I. 2001. Wide-area cooperative storage with CFS. In Proceedings of the 18th ACM Symposium on Operating Systems Principles (SOSP 2001). ACM Press, New York, NY, 202--215.]] 10.1145\/502034.502054"},{"key":"e_1_2_1_9_1","volume-title":"Tech. Rep. TR-25-97","author":"Ellard D.","year":"1997","unstructured":"Ellard , D. , Megquier , J. , Park , L. , and Yuan , N . 1997 . The INDIA protocol---project report. Tech. Rep. TR-25-97 , Harvard University, Division of Engineering and Applied Sciences .]] Ellard, D., Megquier, J., Park, L., and Yuan, N. 1997. The INDIA protocol---project report. Tech. Rep. TR-25-97, Harvard University, Division of Engineering and Applied Sciences.]]"},{"key":"e_1_2_1_10_1","unstructured":"EMC. 2003. EMC content addressed storage system. http:\/\/www.emc.com\/products\/systems\/centera.jsp.]]  EMC. 2003. EMC content addressed storage system. http:\/\/www.emc.com\/products\/systems\/centera.jsp.]]"},{"volume-title":"Proceedings of the 7th Workshop on Hot Topics in Operating Systems. IEEE Computer Society Press","author":"Fox A.","key":"e_1_2_1_11_1","unstructured":"Fox , A. and Brewer , E. A . 1999. Harvest, yield and scalable tolerant systems . In Proceedings of the 7th Workshop on Hot Topics in Operating Systems. IEEE Computer Society Press , Washington, DC, 174--178.]] Fox, A. and Brewer, E. A. 1999. Harvest, yield and scalable tolerant systems. In Proceedings of the 7th Workshop on Hot Topics in Operating Systems. IEEE Computer Society Press, Washington, DC, 174--178.]]"},{"volume-title":"Proceedings of the 16th ACM Symposium on Operating Systems Principles (SOSP'97)","author":"Fox A.","key":"e_1_2_1_12_1","unstructured":"Fox , A. , Gribble , S. D. , Chawathe , Y. , Brewer , E. A. , and Gauthier , P . 1997. Extensible cluster-based scalable network services . In Proceedings of the 16th ACM Symposium on Operating Systems Principles (SOSP'97) . ACM Press, New York, NY, 78--91.]] 10.1145\/268998.266662 Fox, A., Gribble, S. D., Chawathe, Y., Brewer, E. A., and Gauthier, P. 1997. Extensible cluster-based scalable network services. In Proceedings of the 16th ACM Symposium on Operating Systems Principles (SOSP'97). ACM Press, New York, NY, 78--91.]] 10.1145\/268998.266662"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(98)00263-1"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/MSECP.2003.1176992"},{"volume-title":"Proceedings of the International Conference on Dependable Systems and Networks (DSN'04)","author":"Goodson G. R.","key":"e_1_2_1_15_1","unstructured":"Goodson , G. R. , Wylie , J. J. , Ganger , G. R. , and Reiter , M. K . 2004a. Efficient byzantine-tolerant erasure-coded storage . In Proceedings of the International Conference on Dependable Systems and Networks (DSN'04) .]] Goodson, G. R., Wylie, J. J., Ganger, G. R., and Reiter, M. K. 2004a. Efficient byzantine-tolerant erasure-coded storage. In Proceedings of the International Conference on Dependable Systems and Networks (DSN'04).]]"},{"key":"e_1_2_1_16_1","volume-title":"Tech. Rep. CMU-PDL-03-105","author":"Goodson G. R.","year":"2004","unstructured":"Goodson , G. R. , Wylie , J. J. , Ganger , G. R. , and Reiter , M. K . 2004 b. The safety and liveness properties of a protocol family for versatile survivable storage infrastructures. Tech. Rep. CMU-PDL-03-105 (March) Carnegie Mellon University, Parallel Data Laboratory .]] Goodson, G. R., Wylie, J. J., Ganger, G. R., and Reiter, M. K. 2004b. The safety and liveness properties of a protocol family for versatile survivable storage infrastructures. Tech. Rep. CMU-PDL-03-105 (March) Carnegie Mellon University, Parallel Data Laboratory.]]"},{"key":"e_1_2_1_17_1","volume-title":"Proceedings of the 12th ACM Symposium on Principles of Distributed Computing. ACM Press","author":"Krawczyk H.","year":"1993","unstructured":"Krawczyk , H. 1993 . Distributed fingerprints and secure information dispersal . In Proceedings of the 12th ACM Symposium on Principles of Distributed Computing. ACM Press , New York, NY, 207--218.]] 10.1145\/164051.164075 Krawczyk, H. 1993. Distributed fingerprints and secure information dispersal. In Proceedings of the 12th ACM Symposium on Principles of Distributed Computing. ACM Press, New York, NY, 207--218.]] 10.1145\/164051.164075"},{"volume-title":"Proceedings of the 9th International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS-IX). ACM Press","author":"Kubiatowicz J.","key":"e_1_2_1_18_1","unstructured":"Kubiatowicz , J. , Bindel , D. , Chen , Y. , Czerwinski , S. E. , Eaton , P. R. , Geels , D. , Gummadi , R. , Rhea , S. C. , Weatherspoon , H. , Weimer , W. , Wells , C. , and Zhao , B. Y . 2000. 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-IX). ACM Press , New York, NY, 190--201.]] 10.1145\/378993.379239 Kubiatowicz, J., Bindel, D., Chen, Y., Czerwinski, S. E., Eaton, P. R., Geels, D., Gummadi, R., Rhea, S. C., Weatherspoon, H., Weimer, W., Wells, C., and Zhao, B. Y. 2000. 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-IX). ACM Press, New York, NY, 190--201.]] 10.1145\/378993.379239"},{"volume-title":"Proceedings of the USENIX Annual Technical Conference, General Track. The USENIX Association","author":"Magoutis K.","key":"e_1_2_1_19_1","unstructured":"Magoutis , K. , Addetia , S. , Fedorova , A. , Seltzer , M. I. , Chase , J. S. , Gallatin , A. J. , Kisley , R. , Wickremesinghe , R. G. , and Gabber , E . 2002. Structure and performance of the direct access file system . In Proceedings of the USENIX Annual Technical Conference, General Track. The USENIX Association , Berkeley, CA, 1--14.]] Magoutis, K., Addetia, S., Fedorova, A., Seltzer, M. I., Chase, J. S., Gallatin, A. J., Kisley, R., Wickremesinghe, R. G., and Gabber, E. 2002. Structure and performance of the direct access file system. In Proceedings of the USENIX Annual Technical Conference, General Track. The USENIX Association, Berkeley, CA, 1--14.]]"},{"key":"e_1_2_1_20_1","unstructured":"NIST. 1995. Federal information processing standard publication 180-1 (SHA).]]  NIST. 1995. Federal information processing standard publication 180-1 (SHA).]]"},{"volume-title":"Proceedings of the 1st USENIX Conference on File and Storage Technologies (FAST'02)","author":"Quinlan S.","key":"e_1_2_1_21_1","unstructured":"Quinlan , S. and Dorward , S . 2002. Venti: a new approach to archival storage . In Proceedings of the 1st USENIX Conference on File and Storage Technologies (FAST'02) . The USENIX Association, Berkeley, CA, 89--101.]] Quinlan, S. and Dorward, S. 2002. Venti: a new approach to archival storage. In Proceedings of the 1st USENIX Conference on File and Storage Technologies (FAST'02). The USENIX Association, Berkeley, CA, 89--101.]]"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/62044.62050"},{"volume-title":"Proceedings of the USENIX Annual Technical Conference (USENIX'04)","author":"Rhea S.","key":"e_1_2_1_23_1","unstructured":"Rhea , S. , Geels , D. , Roscoe , T. , and Kubiatowicz , J . 2004. Handling churn in a DHT . In Proceedings of the USENIX Annual Technical Conference (USENIX'04) . The USENIX Association, Berkeley, CA, 127--140.]] Rhea, S., Geels, D., Roscoe, T., and Kubiatowicz, J. 2004. Handling churn in a DHT. In Proceedings of the USENIX Annual Technical Conference (USENIX'04). The USENIX Association, Berkeley, CA, 127--140.]]"},{"volume-title":"Proceedings of the USENIX Annual Technical Conference, FREENIX Track (FREENIX'00)","author":"Rosenthal D. S. H.","key":"e_1_2_1_24_1","unstructured":"Rosenthal , D. S. H. and Reich , V . 2000. Permanent web publishing . In Proceedings of the USENIX Annual Technical Conference, FREENIX Track (FREENIX'00) . The USENIX Association, Berkeley, CA, 129--140.]] Rosenthal, D. S. H. and Reich, V. 2000. Permanent web publishing. In Proceedings of the USENIX Annual Technical Conference, FREENIX Track (FREENIX'00). The USENIX Association, Berkeley, CA, 129--140.]]"},{"key":"e_1_2_1_25_1","volume-title":"Proceedings of the Fast Software Encryption, Cambridge Security Workshop. Springer-Verlag","author":"Schneier B.","year":"1994","unstructured":"Schneier , B. 1994 . Description of a new variable-length key, 64-bit block cipher (Blowfish) . In Proceedings of the Fast Software Encryption, Cambridge Security Workshop. Springer-Verlag , Berlin, Germany, 191--204.]] Schneier, B. 1994. Description of a new variable-length key, 64-bit block cipher (Blowfish). In Proceedings of the Fast Software Encryption, Cambridge Security Workshop. Springer-Verlag, Berlin, Germany, 191--204.]]"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/359168.359176"},{"volume-title":"Proceedings of the USENIX Conference on File and Storage Technologies (FAST'04)","author":"Sivanthanu M.","key":"e_1_2_1_27_1","unstructured":"Sivanthanu , M. , Prabhakaran , V. , Arpaci-Dusseau , A. C. , and Arpaci-Dusseau , R. H . 2004. Improving storage system availability with D-GRAID . In Proceedings of the USENIX Conference on File and Storage Technologies (FAST'04) . The USENIX Association, Berkeley, CA, 15--30.]] Sivanthanu, M., Prabhakaran, V., Arpaci-Dusseau, A. C., and Arpaci-Dusseau, R. H. 2004. Improving storage system availability with D-GRAID. In Proceedings of the USENIX Conference on File and Storage Technologies (FAST'04). The USENIX Association, Berkeley, CA, 15--30.]]"},{"key":"e_1_2_1_28_1","unstructured":"The OpenSSL Project. 1999. OpenSSL. http:\/\/www.openssl.org\/.]]  The OpenSSL Project. 1999. OpenSSL. http:\/\/www.openssl.org\/.]]"},{"key":"e_1_2_1_29_1","doi-asserted-by":"crossref","unstructured":"Weatherspoon H. and Kubiatowicz J. 2002. Erasure coding vs. replication: A quantitative comparison. In Revised Papers from the First International Workshop on Peer-to-Peer Systems (IPTPS 2002). Springer-Verlag Berlin Germany 328--338.]]   Weatherspoon H. and Kubiatowicz J. 2002. Erasure coding vs. replication: A quantitative comparison. In Revised Papers from the First International Workshop on Peer-to-Peer Systems (IPTPS 2002). Springer-Verlag Berlin Germany 328--338.]]","DOI":"10.1007\/3-540-45748-8_31"}],"container-title":["ACM Transactions on Storage"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1044956.1044960","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1044956.1044960","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:31:05Z","timestamp":1750264265000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1044956.1044960"}},"subtitle":["Practical, efficient, secure and fault-tolerant distributed data storage"],"short-title":[],"issued":{"date-parts":[[2005,2]]},"references-count":29,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2005,2]]}},"alternative-id":["10.1145\/1044956.1044960"],"URL":"https:\/\/doi.org\/10.1145\/1044956.1044960","relation":{},"ISSN":["1553-3077","1553-3093"],"issn-type":[{"type":"print","value":"1553-3077"},{"type":"electronic","value":"1553-3093"}],"subject":[],"published":{"date-parts":[[2005,2]]},"assertion":[{"value":"2005-02-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}