A Decentralized Resilient Short-Term Cache for Messaging

  • Henner HeckEmail author
  • Olga Kieselmann
  • Nils Kopal
  • Arno Wacker
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10853)


Messaging applications are among the most popular internet applications and people use them worldwide on a daily basis. Their supporting infrastructure, though consisting of a multitude of servers, is typically under central control. This enables censorship and seamless user profiling. A fully decentralized infrastructure, with decentralized control and redundant data storage, can mitigate these dangers. In this paper we evaluate the basic ability of decentralized networks created by the network overlay and data storage protocol Kademlia to serve as a short-term data cache for messaging applications. Our results show, that reliable retrieval of up to 20 replicas is possible.


Overlay networks Storage resilience Censorship resilience 



We thank the German Research Foundation (DFG) for their support within the project CYPHOC (WA 2828/1-1).


  1. 1.
    Cai, X.S., Devroye, L.: The analysis of kademlia for random IDs. Internet Math. 11(6), 572–587 (2015)MathSciNetCrossRefGoogle Scholar
  2. 2.
    Clarke, I., Sandberg, O., Wiley, B., Hong, T.W.: Freenet: a distributed anonymous information storage and retrieval system. In: Federrath, H. (ed.) Designing Privacy Enhancing Technologies. LNCS, vol. 2009, pp. 46–66. Springer, Heidelberg (2001). Scholar
  3. 3.
    Dingledine, R., Mathewson, N., Syverson, P.: Tor: The second-generation onion router. Technical report (2004)Google Scholar
  4. 4.
    Fedotova, N., Fanti, S., Veltri, L.: Kademlia for data storage and retrieval in enterprise networks. In: CollaborateCom 2007, pp. 382–386. IEEE (2007)Google Scholar
  5. 5.
    Heck, H., Kieselmann, O., Wacker, A.: Evaluating connection resilience for self-organized cyber-physical systems. In: SASO 2016. IEEE, September 2016Google Scholar
  6. 6.
    Heck, H., Kieselmann, O., Wacker, A.: Evaluating Connection Resilience for the Overlay Network Kademlia. In: ICDCS, pp. 2581–2584. IEEE, Atlanta, June 2017Google Scholar
  7. 7.
    Azureus Software Inc.: Vuze wiki (2012). Accessed 5 July 2017
  8. 8.
    Ji-Yi, W., Jian-Lin, Z., Tong, W., Qian-li, S.: Study on redundant strategies in peer to peer cloud storage systems. Appl. Math. Inf. Sci. 5(2), 235S–242S (2011)Google Scholar
  9. 9.
    Montresor, A., Jelasity, M.: Peersim: a scalable p2p simulator. In: P2P, pp. 99–100. IEEE (2009)Google Scholar
  10. 10.
    Montresor, A., Jelasity, M.: Peersim: A peer-to-peer simulator (2016). Accessed 20 Feb 2018 and Accessed 1 Feb 2018
  11. 11.
    Park, G.S., Song, H.: A novel hybrid P2P and cloud storage system for retrievability and privacy enhancement. Peer-to-Peer Netw. Appl. 9(2), 299–312 (2016)CrossRefGoogle Scholar
  12. 12.
    Risson, J., Moors, T.: Survey of research towards robust peer-to-peer networks: search methods. Comput. Netw. 50(17), 3485–3521 (2006)CrossRefGoogle Scholar
  13. 13.
    Roos, S., Nguyen, G.T., Strufe, T.: Integrating churn into the formal analysis of routing algorithms. In: International Conference and Workshops on Networked Systems (NetSys), 2015, pp. 1–5. IEEE (2015)Google Scholar
  14. 14.
    Roos, S., Salah, H., Strufe, T.: Determining the hop count in kademlia-type systems (2015)Google Scholar
  15. 15.
    Roos, S., Schiller, B., Hacker, S., Strufe, T.: Measuring freenet in the wild: censorship-resilience under observation. In: De Cristofaro, E., Murdoch, S.J. (eds.) PETS 2014. LNCS, vol. 8555, pp. 263–282. Springer, Cham (2014). Scholar
  16. 16.
    Urdaneta, G., Pierre, G., Steen, M.V.: A survey of DHT security techniques. ACM Comput. Surv. (CSUR) 43(2), 8 (2011)CrossRefGoogle Scholar

Copyright information

© IFIP International Federation for Information Processing 2018

Authors and Affiliations

  • Henner Heck
    • 1
    Email author
  • Olga Kieselmann
    • 1
  • Nils Kopal
    • 1
  • Arno Wacker
    • 1
  1. 1.Applied Information SecurityUniversity of KasselKasselGermany

Personalised recommendations