Towards Practical Communication in Byzantine-Resistant DHTs

@article{Young2013TowardsPC,
  title={Towards Practical Communication in Byzantine-Resistant DHTs},
  author={Maxwell Young and Aniket Kate and Ian Goldberg and Martin Karsten},
  journal={IEEE/ACM Transactions on Networking},
  year={2013},
  volume={21},
  pages={190-203}
}
There are several analytical results on distributed hash tables (DHTs) that can tolerate Byzantine faults. Unfortunately, in such systems, operations such as data retrieval and message sending incur significant communication costs. For example, a simple scheme used in many Byzantine fault-tolerant DHT constructions of n nodes requires O(log3 n) messages; this is likely impractical for real-world applications. The previous best known message complexity is O(log2 n) in expectation. However, the… CONTINUE READING

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…