International Conference on Collaborative Computing: Networking, Applications and Worksharing

Collaborative Computing: Networking, Applications, and Worksharing pp 257-266 | Cite as

Towards Secure Distributed Hash Table

Conference paper
Part of the Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering book series (LNICST, volume 163)

Abstract

A distributed hash table (DHT) provides decentralized lookup service for distributed applications. All current implementations of DHT are achieved by the individual components being run by the participants of the application in question. Namely, the correctness of the DHT relies on that all the participants follow the same protocol. Unfortunately, this aspect of the current approach makes DHT seriously vulnerable to attacks. Such security and fault tolerance concerns about DHT prompted several attempts to improve the vulnerability of DHT. However, all the proposed solutions also rely on the code to be executed correctly. We present in this paper a novel way for implementing DHT, giving rise to an architecture we call GDHT, for Governed Distributed Hash Table. GDHT implements the required protocol with a powerful means for establishing policies governing the behaviors of the participants of DHT. By carrying out the protocol by an equally distributed middleware, the correctness of the execution of routing algorithm is guaranteed. Moreover, the execution of the security module and improvements on routing algorithm can also be ensured.

Keywords

Distributed hash table Fault tolerance Collaboration Security Governed Chord Sybil attack Routing attack 

References

  1. 1.
    Bazzi, R.A., Konjevod, G.: On the establishment of distinct identities in overlay networks. In: Distributed Computing, vol. 19 (2007)Google Scholar
  2. 2.
    Borisov, N.: Computational puzzles as sybil defenses. In: 2006 Sixth IEEE International Conference on Peer-to-Peer Computing, P2P 2006. IEEE (2006)Google Scholar
  3. 3.
    Castro, M., Druschel, P., Ganesh, A., Rowstron, A., Wallach, D.S.: Secure routing for structured peer-to-peer overlay networks. ACM SIGOPS Operating Syst. Rev. 36, 299–314 (2002)CrossRefGoogle Scholar
  4. 4.
    Cohen, B.: Incentives build robustness in bittorrent. In: Workshop on Economics of Peer-to-Peer systems, vol. 6 (2003)Google Scholar
  5. 5.
    Dabek, F., Kaashoek, F., Karger, D., Morris, R., Stoica, I.: Wide-area cooperative storage with CFS. ACM SIGOPS Operating Syst. Rev. 35, 202–215 (2001)CrossRefGoogle Scholar
  6. 6.
    Danezis, G., Lesniewski-Laas, C., Kaashoek, M.F., Anderson, R.: Sybil-resistant DHT routing. In: di Vimercati, S.C., Syverson, P.F., Gollmann, D. (eds.) ESORICS 2005. LNCS, vol. 3679, pp. 305–318. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  7. 7.
    Hildrum, K., Kubiatowicz, J.D.: Asymptotically efficient approaches to fault-tolerance in peer-to-peer networks. In: Fich, F.E. (ed.) DISC 2003. LNCS, vol. 2848, pp. 321–336. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  8. 8.
    Maymounkov, P., Mazières, D.: Kademlia: A Peer-to-Peer information system based on the XOR metric. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol. 2429, pp. 53–65. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  9. 9.
    Minsky, N.H.: Law Governed Interaction (LGI): A Distributed Coordination and Control Mechanism (An Introduction, and a Reference Manual), Rutgers, February 2006. http://www.moses.rutgers.edu/
  10. 10.
    Pappas, V., Massey, D., Terzis, A., Zhang, L.: A comparative study of the DNS design with DHT-based alternatives. In: INFOCOM (2006)Google Scholar
  11. 11.
    Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A scalable content-addressable network, vol. 31. ACM (2001)Google Scholar
  12. 12.
    Rhea, S., Godfrey, B., Karp, B., Kubiatowicz, J., Ratnasamy, S., Shenker, S., Stoica, I., Harlan, Y.: OpenDHT: a public DHT service and its uses. In: ACM SIGCOMM Computer Communication Review, vol. 35 (2005)Google Scholar
  13. 13.
    Rowstron, A., Druschel, P.: Pastry: scalable, decentralized object location, and routing for large-scale peer-to-peer systems. In: Guerraoui, R. (ed.) Middleware 2001. LNCS, vol. 2218, p. 329. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  14. 14.
    Stoica, I., Morris, R., Liben-Nowell, D., Karger, D., Kaashoek, F., Dabek, F., Balakrishnan, H.: Chord: a scalable peer-to-peer lookup protocol for internet applications. IEEE/ACM Trans. Netw. 11, 17–32 (2003)CrossRefGoogle Scholar
  15. 15.
    Urdaneta, G., Pierre, G., Van Steen, M.: A survey of DHT security techniques. ACM Comput. Surv. (CSUR), 43 (2011)Google Scholar
  16. 16.
    Wang, H., Zhu, Y., Hu, Y.: An efficient and secure peer-to-peer overlay network. In: 2005 IEEE Conference on Local Computer Networks 30th Anniversary. IEEE (2005)Google Scholar
  17. 17.
    Wang, Z., Minsky, N.: Establishing global policies over decentralized online social networks. In: Proceedings of the 9th IEEE International Workshop on Trusted Collaboration, October 2014Google Scholar
  18. 18.
    Wang, Z., Minsky, N.: Regularity based decentralized social networks. In: Proceedings of the 9th International Conference on Risks and Security of Internet and Systems (CRiSIS2014), October 2014Google Scholar
  19. 19.
    Haifeng, Y., Kaminsky, M., Gibbons, P.B., Flaxman, A.: Sybilguard: defending against sybil attacks via social networks. ACM SIGCOMM Comput. Commun. Rev. 36, 267–278 (2006)CrossRefGoogle Scholar

Copyright information

© Institute for Computer Sciences, Social Informatics and Telecommunications Engineering 2016

Authors and Affiliations

  1. 1.Rutgers UniversityPiscatawayUSA

Personalised recommendations