<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="6.x">Drupal-Biblio</source-app><ref-type>27</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Daniel Ellard</style></author><author><style face="normal" font="default" size="100%">James Megquier</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">DISP: Practical, Efficient, Secure and Fault Tolerant Data Storage for Distributed Systems</style></title><secondary-title><style face="normal" font="default" size="100%">Harvard University Computer Science Technical Report</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">distrib</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2003</style></year><pub-dates><date><style  face="normal" font="default" size="100%">December 2003</style></date></pub-dates></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://www.eecs.harvard.edu/syrah/papers/tr-17-03/</style></url></web-urls></urls><number><style face="normal" font="default" size="100%">17-03</style></number><pub-location><style face="normal" font="default" size="100%">Cambridge, Massachusetts</style></pub-location><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">We present DISP, a practical, efficient and secure client/server protocol for data storage and retrieval in a distributed environment and show how this protocol can tolerate Byzantine failure.  We discuss variations on DISP that can be used as building blocks for different applications, and measure the performance of DISP on commodity hardware. </style></abstract></record></records></xml>