{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,17]],"date-time":"2026-02-17T03:46:54Z","timestamp":1771300014699,"version":"3.50.1"},"publisher-location":"Cham","reference-count":51,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031477508","type":"print"},{"value":"9783031477515","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,12,1]],"date-time":"2023-12-01T00:00:00Z","timestamp":1701388800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,12,1]],"date-time":"2023-12-01T00:00:00Z","timestamp":1701388800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-47751-5_19","type":"book-chapter","created":{"date-parts":[[2023,11,30]],"date-time":"2023-11-30T17:02:23Z","timestamp":1701363743000},"page":"327-345","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Kadabra: Adapting Kademlia for\u00a0the\u00a0Decentralized Web"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3363-9834","authenticated-orcid":false,"given":"Yunqi","family":"Zhang","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7355-634X","authenticated-orcid":false,"given":"Shaileshh","family":"Bojja Venkatakrishnan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,12,1]]},"reference":[{"key":"19_CR1","doi-asserted-by":"crossref","unstructured":"Alabdulwahhab, F.A.: Web 3.0: the decentralized web blockchain networks and protocol innovation. In: 2018 1st International Conference on Computer Applications & Information Security (ICCAIS), pp. 1\u20134. IEEE (2018)","DOI":"10.1109\/CAIS.2018.8441990"},{"key":"19_CR2","doi-asserted-by":"crossref","unstructured":"Assadi, S., Wang, C.: Exploration with limited memory: streaming algorithms for coin tossing, noisy comparisons, and multi-armed bandits. In: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, pp. 1237\u20131250 (2020)","DOI":"10.1145\/3357713.3384341"},{"key":"19_CR3","doi-asserted-by":"crossref","unstructured":"Baumgart, I., Heep, B., Krause, S.: OverSim: a flexible overlay network simulation framework. In: 2007 IEEE Global Internet Symposium, pp. 79\u201384. IEEE (2007)","DOI":"10.1109\/GI.2007.4301435"},{"key":"19_CR4","doi-asserted-by":"crossref","unstructured":"Baumgart, I., Mies, S.: S\/Kademlia: a practicable approach towards secure key-based routing. In: 2007 International Conference on Parallel and Distributed Systems, pp. 1\u20138. IEEE (2007)","DOI":"10.1109\/ICPADS.2007.4447808"},{"key":"19_CR5","unstructured":"Benet, J.: IPFS - Content Addressed, Versioned, P2P File System. arXiv preprint arXiv:1407.3561 (2014)"},{"key":"19_CR6","doi-asserted-by":"crossref","unstructured":"Bubeck, S., Cesa-Bianchi, N.: Regret analysis of stochastic and nonstochastic multi-armed bandit problems. Found. Trends\u00ae Mach. Learn. 5(1), 1\u2013122 (2012)","DOI":"10.1561\/2200000024"},{"key":"19_CR7","unstructured":"Castro, M., Druschel, P., Hu, Y.C., Rowstron, A.: Exploiting network proximity in distributed hash tables. In: International Workshop on Future Directions in Distributed Computing (FuDiCo), pp. 52\u201355. Citeseer (2002)"},{"issue":"3","key":"19_CR8","doi-asserted-by":"publisher","first-page":"380","DOI":"10.3390\/e23030380","volume":"23","author":"E Cavenaghi","year":"2021","unstructured":"Cavenaghi, E., Sottocornola, G., Stella, F., Zanker, M.: Non stationary multi-armed bandit: empirical evaluation of a new concept drift-aware algorithm. Entropy 23(3), 380 (2021)","journal-title":"Entropy"},{"key":"19_CR9","doi-asserted-by":"crossref","unstructured":"Chen, Z., Huang, M., Tan, Q.: The design of Kademlia system base on network topology matching. In: 2010 Second International Workshop on Education Technology and Computer Science, vol. 2, pp. 146\u2013149. IEEE (2010)","DOI":"10.1109\/ETCS.2010.305"},{"key":"19_CR10","unstructured":"Crosby, S.A., Wallach, D.S.: An analysis of BitTorrent\u2019s Two Kademlia-Based DHTs. Technical Report (2007)"},{"key":"19_CR11","unstructured":"Cointelegraph Report: DApp daily users surge to 2.4 M in Q1 2022 despite headwinds. https:\/\/cointelegraph.com\/news\/report-dapp-daily-users-surge-to-2-4m-in-q1-2022-despite-headwinds"},{"key":"19_CR12","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/j.comnet.2016.01.014","volume":"99","author":"G Einziger","year":"2016","unstructured":"Einziger, G., Friedman, R., Kantor, Y.: Shades: expediting Kademlia\u2019s lookup process. Comput. Netw. 99, 37\u201350 (2016)","journal-title":"Comput. Netw."},{"key":"19_CR13","unstructured":"Ethereum Node Tracker. https:\/\/etherscan.io\/nodetracker"},{"key":"19_CR14","unstructured":"Filecoin. https:\/\/filecoin.io\/"},{"key":"19_CR15","doi-asserted-by":"crossref","unstructured":"Guangmin, L.: An improved Kademlia routing algorithm for P2P network. In: 2009 International Conference on New Trends in Information and Service Science, pp. 63\u201366. IEEE (2009)","DOI":"10.1109\/NISS.2009.172"},{"key":"19_CR16","doi-asserted-by":"crossref","unstructured":"Gummadi, K., Gummadi, R., Gribble, S., Ratnasamy, S., Shenker, S., Stoica, I.: The impact of DHT routing geometry on resilience and proximity. In: Proceedings of the 2003 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, pp. 381\u2013394 (2003)","DOI":"10.1145\/863955.863998"},{"key":"19_CR17","doi-asserted-by":"crossref","unstructured":"Heck, H., Kieselmann, O., Wacker, A.: Evaluating connection resilience for the overlay network Kademlia. In: 2017 IEEE 37th International Conference on Distributed Computing Systems (ICDCS), pp. 2581\u20132584. IEEE (2017)","DOI":"10.1109\/ICDCS.2017.101"},{"key":"19_CR18","doi-asserted-by":"crossref","unstructured":"Heep, B.: R\/Kademlia: recursive and topology-aware overlay routing. In: 2010 Australasian Telecommunication Networks and Applications Conference, pp. 102\u2013107. IEEE (2010)","DOI":"10.1109\/ATNAC.2010.5680244"},{"key":"19_CR19","doi-asserted-by":"crossref","unstructured":"Hildrum, K., Kubiatowicz, J.D., Rao, S., Zhao, B.Y.: Distributed object location in a dynamic network. In: Proceedings of the Fourteenth Annual ACM Symposium on Parallel Algorithms and Architectures, pp. 41\u201352 (2002)","DOI":"10.1145\/564870.564877"},{"key":"19_CR20","unstructured":"Hypercore Protocol. https:\/\/hypercore-protocol.org\/"},{"key":"19_CR21","unstructured":"The IPFS-Filecoin Interface. https:\/\/github.com\/filecoin-project\/specs\/issues\/143"},{"key":"19_CR22","unstructured":"Jain, S., Mahajan, R., Wetherall, D.: A study of the performance potential of DHT-based overlays. In: 4th USENIX Symposium on Internet Technologies and Systems (USITS 03) (2003)"},{"key":"19_CR23","doi-asserted-by":"crossref","unstructured":"Jimenez, R., Osmani, F., Knutsson, B.: Sub-Second Lookups on a Large-Scale Kademlia-Based Overlay. In: 2011 IEEE International Conference on Peer-to-Peer Computing, pp. 82\u201391. IEEE (2011)","DOI":"10.1109\/P2P.2011.6038665"},{"key":"19_CR24","doi-asserted-by":"crossref","unstructured":"Kanemitsu, H., Nakazato, H.: KadRTT: routing with network proximity and uniform ID arrangement in Kademlia. In: 2021 IFIP Networking Conference (IFIP Networking), pp. 1\u20136. IEEE (2021)","DOI":"10.23919\/IFIPNetworking52078.2021.9472816"},{"key":"19_CR25","doi-asserted-by":"crossref","unstructured":"Karger, D.R., Ruhl, M.: Finding nearest neighbors in growth-restricted metrics. In: Proceedings of the Thirty-Fourth Annual ACM Symposium on Theory of Computing, pp. 741\u2013750 (2002)","DOI":"10.1145\/509907.510013"},{"key":"19_CR26","doi-asserted-by":"crossref","unstructured":"Kaune, S., Lauinger, T., Kovacevic, A., Pussep, K.: Embracing the peer next door: proximity in Kademlia. In: 2008 Eighth International Conference on Peer-to-Peer Computing, pp. 343\u2013350. IEEE (2008)","DOI":"10.1109\/P2P.2008.36"},{"issue":"2\u20133","key":"19_CR27","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/j.cosrev.2012.01.002","volume":"6","author":"E Koutrouli","year":"2012","unstructured":"Koutrouli, E., Tsalgatidou, A.: Taxonomy of attacks and defense mechanisms in P2P reputation systems-Lessons for reputation system designers. Comput. Sci. Rev. 6(2\u20133), 47\u201370 (2012)","journal-title":"Comput. Sci. Rev."},{"key":"19_CR28","unstructured":"Libp2p Kademlia. https:\/\/github.com\/libp2p\/go-libp2p-kad-dht"},{"key":"19_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/3-540-45748-8_5","volume-title":"Peer-to-Peer Systems","author":"P Maymounkov","year":"2002","unstructured":"Maymounkov, P., Mazi\u00e8res, D.: Kademlia: a peer-to-peer information system based on the XOR metric. In: Druschel, P., Kaashoek, F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol. 2429, pp. 53\u201365. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45748-8_5"},{"key":"19_CR30","doi-asserted-by":"crossref","unstructured":"Montresor, A., Jelasity, M.: PeerSim: a scalable P2P simulator. In: 2009 IEEE Ninth International Conference on Peer-to-Peer Computing, pp. 99\u2013100. IEEE (2009)","DOI":"10.1109\/P2P.2009.5284506"},{"key":"19_CR31","doi-asserted-by":"crossref","unstructured":"Nobari, S.: DBA: dynamic multi-armed bandit algorithm. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 33(01), pp. 9869\u20139870 (2019)","DOI":"10.1609\/aaai.v33i01.33019869"},{"key":"19_CR32","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/j.comnet.2015.11.010","volume":"94","author":"R Pecori","year":"2016","unstructured":"Pecori, R.: S-Kademlia: a trust and reputation method to mitigate a Sybil attack in Kademlia. Comput. Netw. 94, 205\u2013218 (2016)","journal-title":"Comput. Netw."},{"key":"19_CR33","doi-asserted-by":"crossref","unstructured":"Plaxton, C.G., Rajaraman, R., Richa, A.W.: Accessing nearby copies of replicated objects in a distributed environment. In: Proceedings of the Ninth Annual ACM Symposium on Parallel Algorithms and Architectures, pp. 311\u2013320 (1997)","DOI":"10.1145\/258492.258523"},{"key":"19_CR34","doi-asserted-by":"crossref","unstructured":"Putman, C., Nieuwenhuis, L.J., et al.: Business model of a botnet. In: 2018 26th Euromicro International Conference on Parallel, Distributed and Network-based Processing (PDP), pp. 441\u2013445. IEEE (2018)","DOI":"10.1109\/PDP2018.2018.00077"},{"key":"19_CR35","doi-asserted-by":"crossref","unstructured":"Ratnasamy, S., Handley, M., Karp, R., Shenker, S.: Topologically-aware overlay construction and server selection. In: Proceedings. Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies, vol. 3, pp. 1190\u20131199. IEEE (2002)","DOI":"10.1109\/INFCOM.2002.1019369"},{"key":"19_CR36","unstructured":"Safe Network. https:\/\/safenetwork.tech\/"},{"key":"19_CR37","doi-asserted-by":"crossref","unstructured":"Slivkins, A.: Introduction to multi-armed bandits. Found. Trends\u00ae Mach. Learn. 12(1\u20132), 1\u2013286 (2019)","DOI":"10.1561\/2200000068"},{"key":"19_CR38","doi-asserted-by":"crossref","unstructured":"Steiner, M., Carra, D., Biersack, E.W.: Faster content access in KAD. In: 2008 Eighth International Conference on Peer-to-Peer Computing, pp. 195\u2013204. IEEE (2008)","DOI":"10.1109\/P2P.2008.28"},{"issue":"5","key":"19_CR39","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1145\/1290168.1290176","volume":"37","author":"M Steiner","year":"2007","unstructured":"Steiner, M., En-Najjary, T., Biersack, E.W.: Exploiting KAD: possible uses and misuses. ACM SIGCOMM Comput. Commun. Rev. 37(5), 65\u201370 (2007)","journal-title":"ACM SIGCOMM Comput. Commun. Rev."},{"key":"19_CR40","unstructured":"Storj Labs Inc.: Storj: a decentralized cloud storage network framework. https:\/\/www.storj.io\/storjv3.pdf"},{"key":"19_CR41","doi-asserted-by":"crossref","unstructured":"Stutzbach, D., Rejaie, R.: Improving Lookup Performance over a Widely-Deployed DHT. In: Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications, pp. 1\u201312. IEEE (2006)","DOI":"10.1109\/INFOCOM.2006.329"},{"key":"19_CR42","unstructured":"Swarm. https:\/\/www.ethswarm.org\/"},{"key":"19_CR43","unstructured":"SWARM-storage and communication infrastructure for a self-sovereign digital society. https:\/\/www.ethswarm.org\/swarm-whitepaper.pdf"},{"key":"19_CR44","doi-asserted-by":"crossref","unstructured":"Trautwein, D., et al.: Design and evaluation of IPFS: a storage layer for the decentralized web. In: Proceedings of the ACM SIGCOMM 2022 Conference, pp. 739\u2013752 (2022)","DOI":"10.1145\/3544216.3544232"},{"key":"19_CR45","unstructured":"Tr\u00f3n, V.: The Book of Swarm: storage and communication infrastructure for self-sovereign digital society back-end stack for the decentralised web, V1. 0 pre-Release 7 (2020)"},{"key":"19_CR46","unstructured":"Website Load Time Statistics: why speed matters in 2022 - load speed can make or break a website. https:\/\/www.websitebuilderexpert.com\/building-websites\/website-load-time-statistics\/"},{"key":"19_CR47","unstructured":"WonderNetwork Pings. https:\/\/wondernetwork.com\/"},{"key":"19_CR48","doi-asserted-by":"crossref","unstructured":"Zhang, Y., Bojja Venkatakrishnan, S.: Kadabra: adapting Kademlia for the decentralized web. arXiv preprint arXiv:2210.12858 (2022)","DOI":"10.1007\/978-3-031-47751-5_19"},{"key":"19_CR49","unstructured":"Zhao, B.Y., Joseph, A., Kubiatowicz, J.: Locality aware mechanisms for large-scale networks. In: Proceedings of the FuDiCo, vol. 2 (2002)"},{"key":"19_CR50","doi-asserted-by":"crossref","unstructured":"Zhu, L., Zheng, K.: An improved Kademlia algorithm based on Qos. In: Proceedings of 2014 International Conference on Cloud Computing and Internet of Things, pp. 128\u2013130. IEEE (2014)","DOI":"10.1109\/CCIOT.2014.7062520"},{"key":"19_CR51","doi-asserted-by":"crossref","unstructured":"Zichichi, M., Ferretti, S., D\u2019Angelo, G.: On the efficiency of decentralized file storage for personal information management systems. In: 2020 IEEE Symposium on Computers and Communications (ISCC), pp. 1\u20136. IEEE (2020)","DOI":"10.1109\/ISCC50000.2020.9219623"}],"container-title":["Lecture Notes in Computer Science","Financial Cryptography and Data Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-47751-5_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,4]],"date-time":"2024-11-04T14:15:32Z","timestamp":1730729732000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-47751-5_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,1]]},"ISBN":["9783031477508","9783031477515"],"references-count":51,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-47751-5_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,12,1]]},"assertion":[{"value":"1 December 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Financial Cryptography and Data Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bol, Bra\u010d","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Croatia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 May 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 May 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fc2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/fc23.ifca.ai\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"HotCRP","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"182","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"39","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"21% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.5","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"For the workshops 7 full papers have been accepted from 18 submissions.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}