A survey of DHT security techniques
The DOI matches its Crossref record; 68 of the 68 references it cites were found in a registry or an index.
Abstract
Peer-to-peer networks based on distributed hash tables (DHTs) have received considerable attention ever since their introduction in 2001. Unfortunately, DHT-based systems have been shown to be notoriously difficult to protect against security attacks. Various reports have been published that discuss or classify general security issues, but so far a comprehensive survey describing the various proposed defenses has been lacking. In this article, we present an overview of techniques reported in the literature for making DHT-based systems resistant to the three most important attacks that can be launched by malicious nodes participating in the DHT: (1) the Sybil attack, (2) the Eclipse attack, and (3) routing and storage attacks. We review the advantages and disadvantages of the proposed solutions and, in doing so, confirm how difficult it is to secure DHT-based systems in an adversarial environment.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Lecture Notes in Computer Science 1205
(1999) · Industrial Robot: An International Journal · doi:10.1108/ir.1999.04926fae.001 · Cited by 38,662
Chord: A scalable peer-to-peer lookup service for internet applications
Stoica, I., Morris, R., Karger, D., Kaashoek, M. F., & Balakrishnan, H. (2001) · Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/383059.383071 · Cited by 9,623
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Rowstron, A., & Druschel, P. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-45518-3_18 · Cited by 7,276 · cited 23×
“The .rst one requires the uses of iterative routing so that the requester can check the lookup progress and detect anomalies such as responses that get far from the requested key in overlays such as Chord, Pastry, and Tapestry.”
BackgroundMethodInfluentialA scalable content-addressable network
Ratnasamy, S., Francis, P., Handley, M., Karp, R., & Shenker, S. (2001) · Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/383059.383072 · Cited by 6,372 · cited 3×
“A common approach studied in the literature to implement this functionality is the use of structured peer-to-peer systems, also known as distributed hash tables (DHTs) [Ratnasamy et al. 2001; Stoica et al. 2003; Rowstron and Druschel 2001a; Zhao et al. 2004; Maymounkov and Mazi` eres 2002].”
BackgroundDouceur, J. R. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45748-8_24 · Cited by 4,419 · cited 1×
“The Sybil attack was first studied by Douceur [2002]. It exploits the fact that in a distributed system, remote entities are perceived as informational abstractions known as identities.”
BackgroundChord: a scalable peer-to-peer lookup protocol for internet applications
Stoica, I., Morris, R., Liben-Nowell, D., Karger, D. R., Kaashoek, M. F., Dabek, F., & Balakrishnan, H. (2003) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2002.808407 · Cited by 3,133 · cited 9×
“A common approach studied in the literature to implement this functionality is the use of structured peer-to-peer systems, also known as distributed hash tables (DHTs) [Ratnasamy et al. 2001; Stoica et al. 2003; Rowstron and Druschel 2001a; Zhao et al. 2004; Maymounkov and Mazières 2002].”
BackgroundMethodInfluentialKademlia: A Peer-to-Peer Information System Based on the XOR Metric
Maymounkov, P., & Mazières, D. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45748-8_5 · Cited by 3,004 · cited 2×
“A common approach studied in the literature to implement this functionality is the use of structured peer-to-peer systems, also known as distributed hash tables (DHTs) [Ratnasamy et al. 2001; Stoica et al. 2003; Rowstron and Druschel 2001a; Zhao et al. 2004; Maymounkov and Mazi` eres 2002].”
BackgroundPractical byzantine fault tolerance and proactive recovery
Castro, M., & Liskov, B. (2002) · ACM Transactions on Computer Systems · doi:10.1145/571637.571640 · Cited by 2,475 · cited 4×
“Castro et al. [2002a] outlined the use of a Byzantine-fault-tolerant replication algorithm [Castro and Liskov 2002] to provide strong consistency guarantees for mutable data, but many other replication algorithms could be used as long as they are aware of the overlay structure and the…”
MethodInfluentialThe small-world phenomenon: an algorithmic perspective
Kleinberg, J. (2000) · Proceedings of the thirty-second annual ACM symposium on Theory of computing · doi:10.1145/335305.335325 · Cited by 1,882 · cited 1×
“The authors tested the system with simulations using Kleinberg’s synthetic social network model [Kleinberg 2000].”
MethodTapestry: A Resilient Global-Scale Overlay for Service Deployment
Zhao, B. Y., Huang, L., Stribling, J., Rhea, S. C., Joseph, A. D., & Kubiatowicz, J. D. (2004) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2003.818784 · Cited by 1,730 · cited 11×
“A common approach studied in the literature to implement this functionality is the use of structured peer-to-peer systems, also known as distributed hash tables (DHTs) [Ratnasamy et al. 2001; Stoica et al. 2003; Rowstron and Druschel 2001a; Zhao et al. 2004; Maymounkov and Mazières 2002].”
BackgroundMethodInfluentialEpidemic algorithms for replicated database maintenance
Demers, A., Greene, D., Hauser, C., Irish, W., & Larson, J. (1987) · Proceedings of the sixth annual ACM Symposium on Principles of distributed computing - PODC '87 · doi:10.1145/41840.41841 · Cited by 1,673
Lecture Notes in Computer Science 1867
Baldwin, J., Martin, T., & Tzanavari, A. (2000) · Cited by 1,643
Scribe: a large-scale and decentralized application-level multicast infrastructure
Castro, M., Druschel, P., Kermarrec, A.-M., & Rowstron, A. I. T. (2002) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2002.803069 · Cited by 1,461 · cited 8×
“…while others take a more engineering approach and have their properties measured with experiments, but also with mathematical analysis in many cases [Castro et al. 2002a; Hildrum and Kubiatowicz 2003; Harvesf and Blough 2006; Ganesh and Zhao 2005; S´ anchez Artigas et al. 2005; Wang et al.…”
BackgroundMethodInfluentialWide-area cooperative storage with CFS
Dabek, F., Kaashoek, M. F., Karger, D., Morris, R., & Stoica, I. (2001) · Proceedings of the eighteenth ACM symposium on Operating systems principles · doi:10.1145/502034.502054 · Cited by 1,428 · cited 2×
“The notion of a decentralized lookup service is very useful for many distributed applications [Cai et al. 2004; Ramasubramanian and Sirer 2004b; Zhou and van Renesse 2004; Dabek et al. 2001; Rowstron and Druschel 2001b; Castro et al. 2002; Stading et al. 2002].”
BackgroundMethodStorage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility
Rowstron, A., & Druschel, P. (2001) · Proceedings of the eighteenth ACM symposium on Operating systems principles · doi:10.1145/502034.502053 · Cited by 1,218 · cited 24×
“The .rst one requires the uses of iterative routing so that the requester can check the lookup progress and detect anomalies such as responses that get far from the requested key in overlays such as Chord, Pastry, and Tapestry.”
BackgroundMethodInfluentialRhea, S. C., Geels, D., Roscoe, T., & Kubiatowicz, J. D. (2004) · Cited by 875
Secure routing for structured peer-to-peer overlay networks
Castro, M., Druschel, P., Ganesh, A., Rowstron, A., & Wallach, D. S. (2002) · ACM SIGOPS Operating Systems Review · doi:10.1145/844128.844156 · Cited by 743 · cited 9×
“…while others take a more engineering approach and have their properties measured with experiments, but also with mathematical analysis in many cases [Castro et al. 2002a; Hildrum and Kubiatowicz 2003; Harvesf and Blough 2006; Ganesh and Zhao 2005; S´ anchez Artigas et al. 2005; Wang et al.…”
BackgroundMethodInfluentialSybilGuard: defending against sybil attacks via social networks
Yu, H., Kaminsky, M., Gibbons, P. B., & Flaxman, A. (2006) · ACM SIGCOMM Computer Communication Review · doi:10.1145/1151659.1159945 · Cited by 725
SybilLimit: A Near-Optimal Social Network Defense against Sybil Attacks
Yu, H., Gibbons, P. B., Kaminsky, M., & Xiao, F. (2008) · 2008 IEEE Symposium on Security and Privacy (sp 2008) · doi:10.1109/sp.2008.13 · Cited by 563
Rhea, S. C., Godfrey, B., Karp, B. N., Kubiatowicz, J. D., Ratnasamy, S., Shenker, S. J., Stoica, I. G., & Yu, H. (2005) · ACM SIGCOMM Conference (SIGCOMM) · doi:10.1145/1080091.1080102 · Cited by 502
High Availability in DHTs: Erasure Coding vs. Replication
Rodrigues, R., & Liskov, B. H. (2005) · Lecture notes in computer science · doi:10.1007/11558989_21 · Cited by 411 · cited 1×
“However, a study [Rodrigues and Liskov 2005] has shown that while coding does provide storage savings, the bandwidth required to maintain appropriate redundancy levels under various degrees of churn is approximately the same for both coding and replication.”
BackgroundMeasurements and mitigation of peer-to-peer-based botnets: a case study on storm worm
Holz, T., Steiner, M., Dahl, F., Biersack, E. W., & Freiling, F. (2008) · Cited by 383
Beacon vector routing: scalable point-to-point routing in wireless sensornets
Fonseca, R., Ratnasamy, S., Zhao, J., Ee, C. T., Culler, D., Shenker, S. J., & Stoica, I. G. (2005) · Networked Systems Design and Implementation · doi:10.5555/1251203.1251227 · Cited by 357
Load balancing in dynamic structured P2P systems
Godfrey, B., Lakshminarayanan, K., Surana, S., Karp, R. M., & Stoica, I. G. (2005) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infcom.2004.1354648 · Cited by 355 · cited 2×
“…et al. 2004; Godfrey et al. 2006; Li et al. 2005; Blake and Rodrigues 2003], load balancing [Zhu and Hu 2005; Rao et al. 2003; Karger and Ruhl 2006; Godfrey et al. 2004], and .ash crowds [Ramasubramanian and Sirer 2004a; Yu et al. 2005] in DHTs. Issues that are inherent to all DHT deployments,…”
BackgroundT RIBLER: a social‐based peer‐to‐peer system
Pouwelse, J. A., Garbacki, P., Wang, J., Bakker, A., Yang, J., Iosup, A., Epema, D. H. J., Reinders, M., van Steen, M. R., & Sips, H. J. (2008) · Concurrency and Computation: Practice and Experience · doi:10.1002/cpe.1189 · Cited by 343 · cited 1×
“Similar ideas have also been applied to file-sharing applications [Pouwelse et al. 2007].”
MethodThe Computational and Storage Potential of Volunteer Computing
Anderson, D. P., & Fedak, G. (2006) · Sixth IEEE International Symposium on Cluster Computing and the Grid (CCGRID'06) · doi:10.1109/ccgrid.2006.101 · Cited by 320 · cited 2×
“It has been shown that heterogeneity in a practical peer-to-peer system can be signi.cant, with the most powerful nodes having several orders of magnitude more CPU power than the least powerful nodes [Anderson and Fedak 2006].”
BackgroundEclipse Attacks on Overlay Networks: Threats and Defenses
Singh, A., Ngan, T.-W., Druschel, P., & Wallach, D. S. (2006) · Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications · doi:10.1109/infocom.2006.231 · Cited by 317 · cited 1×
“Singh et al. [2006] discuss localized attacks, which require an honest node to be surrounded by malicious nodes in terms of network distance.”
BackgroundThe design and implementation of a next generation name service for the internet
Ramasubramanian, V., & Sirer, E. G. (2004) · ACM SIGCOMM Conference (SIGCOMM) · doi:10.1145/1015467.1015504 · Cited by 292 · cited 3×
“The notion of a decentralized lookup service is very useful for many distributed applications [Cai et al. 2004; Ramasubramanian and Sirer 2004b; Zhou and van Renesse 2004; Dabek et al. 2001; Rowstron and Druschel 2001b; Castro et al. 2002; Stading et al. 2002].”
BackgroundMethodA Survey of Solutions to the Sybil Attack
Levine, B. N., Shields, C., & Margolin, N. B. (2006) · Cited by 288
Kelips: Building an Efficient and Stable P2P DHT through Increased Memory and Background Overhead
Gupta, I., Birman, K., Linga, P., Demers, A., & van Renesse, R. (2003) · Lecture notes in computer science · doi:10.1007/978-3-540-45172-3_15 · Cited by 285 · cited 1×
“The additional O( √ logm) factor allows routing tables to be used for O(1) DHT routing, similar to approaches described in [Gupta et al. 2003; Gupta et al. 2004].”
MethodSybilGuard: defending against sybil attacks via social networks
Yu, H., Kaminsky, M., Gibbons, P. B., & Flaxman, A. (2006) · Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/1159913.1159945 · Cited by 260 · cited 1×
“Defenses that use social information [Yu et al. 2006; Yu et al. 2008; Danezis et al. 2005] have been shown to be very effective at limiting Sybil attacks.”
MethodSybillimit: a near-optimal social network defense against sybil attacks
Yu, H., Gibbons, P. B., Kaminsky, M., & Xiao, F. (2010) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2009.2034047 · Cited by 246
A Survey of Peer-to-Peer Security Issues
Wallach, D. S. (2003) · Lecture Notes in Computer Science · doi:10.1007/3-540-36532-x_4 · Cited by 224
A performance vs. cost framework for evaluating DHT design tradeoffs under churn
Li, J., Stribling, J., Morris, R., Kaashock, M. F., & Gil, T. A. (2005) · Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies. · doi:10.1109/infcom.2005.1497894 · Cited by 216 · cited 1×
“There is a vast amount of literature related to the study of churn [Castro et al. 2004; Rhea et al. 2004; Godfrey et al. 2006; Li et al. 2005; Blake and Rodrigues 2003], load balancing [Zhu and Hu 2005; Rao et al. 2003; Karger and Ruhl 2006; Godfrey et al. 2004], and .ash crowds [Ramasubramanian…”
BackgroundExperiences building PlanetLab
Peterson, L., Bavier, A. C., Fiuczynski, M. E., & Muir, S. (2006) · doi:10.5555/1298455.1298489 · Cited by 210
Minimizing churn in distributed systems
Godfrey, P. B., Shenker, S., & Stoica, I. (2006) · ACM SIGCOMM Computer Communication Review · doi:10.1145/1151659.1159931 · Cited by 207
Beehive: O(1)lookup performance for power-law query distributions in peer-to-peer overlays
Ramasubramanian, V., & Sirer, E. G. (2004) · Networked Systems Design and Implementation · Cited by 194
Peer-to-Peer Caching Schemes to Address Flash Crowds
Stading, T., Maniatis, P., & Baker, M. G. (2002) · Lecture notes in computer science · doi:10.1007/3-540-45748-8_19 · Cited by 184 · cited 2×
“The notion of a decentralized lookup service is very useful for many distributed applications [Cai et al. 2004; Ramasubramanian and Sirer 2004b; Zhou and van Renesse 2004; Dabek et al. 2001; Rowstron and Druschel 2001b; Castro et al. 2002; Stading et al. 2002].”
BackgroundMethodEfficient routing for peer-to-peer overlays
Gupta, A., Liskov, B. H., & Rodrigues, R. (2004) · Cited by 181
Computational Puzzles as Sybil Defenses
Borisov, N. (2006) · IEEE International Conference on Peer-to-Peer Computing (P2P) · doi:10.1109/p2p.2006.10 · Cited by 180 · cited 2×
“Since this is impossible in a dynamic system where nodes can join and leave at any time, the proposed Sybil defenses [Borisov 2006; Rowaihy et al. 2007] require a periodic revalidation of all identities.”
BackgroundDanezis, G., Lesniewski-Laas, C., Kaashoek, M. F., & Anderson, R. (2005) · Lecture Notes in Computer Science · doi:10.1007/11555827_18 · Cited by 165 · cited 3×
“Danezis et al. [2005] Does not put barriers to enter the system.”
BackgroundMethodA Simple Fault Tolerant Distributed Hash Table
Naor, M., & Wieder, U. (2003) · Lecture notes in computer science · doi:10.1007/978-3-540-45172-3_8 · Cited by 153 · cited 8×
“Perhaps the clearest distinction between the different solutions is that some are based on purely theoretical constructions defined at a very high level [Fiat and Saia 2007; Fiat et al. 2005; Awerbuch and Scheideler 2006; Naor and Wieder 2003], while others take a more engineering approach and have their properties me…”
BackgroundMethodInfluentialS/Kademlia: A practicable approach towards secure key-based routing
Baumgart, I., & Mies, S. (2007) · IEEE International Conference on Parallel and Distributed Systems (ICPADS) · doi:10.1109/icpads.2007.4447808 · Cited by 147 · cited 1×
“This conclusion is also drawn in other studies [Baumgart and Mies 2007; Cerri et al. 2005] in which secure identifier assignment is proposed.”
ResultCensorship Resistant Peer-to-Peer Content Addressable Networks
Fiat, A., Saia, J., Hobbes, T., Descartes, R., Bacon, F., Spinoza, B., Milton, J., Locke, J., Hume, D., Rousseau, J.-J., et al. (2001) · Cited by 139
Dinger, J., & Hannes Hartenstein, B. (2006) · International Conference on Availability, Reliability and Security (ARES) · doi:10.1109/ares.2006.45 · Cited by 122 · cited 3×
“Distributed registration [Dinger and Hartenstein 2006], while unable to fully prevent Sybil attacks, tries to mitigate their effects while relaxing the assumptions made by centralized certification.”
BackgroundInfluentialSteiner, M., En-Najjary, T., & Biersack, E. W. (2007) · ACM SIGCOMM Computer Communication Review · doi:10.1145/1290168.1290176 · Cited by 121 · cited 7×
“IMPLEMENTATIONS DHTs have been used in numerous popular peer-to-peer systems in the real world, such as the KAD network (used by eMule and other compatible programs), BitTorrent, and LimeWire.”
BackgroundResultInfluentialAsymptotically Efficient Approaches to Fault-Tolerance in Peer-to-Peer Networks
Hildrum, K. W., & Kubiatowicz, J. D. (2003) · Lecture notes in computer science · doi:10.1007/978-3-540-39989-6_23 · Cited by 119 · cited 12×
“The simplest approach is probably the use of redundant routing table entries [Hildrum and Kubiatowicz 2003], where it is expected that some entries will be honest and thus suf.cient to allow successful redundant routing.”
BackgroundMethodInfluentialVulnerabilities and Security Threats in Structured Overlay Networks: A Quantitative Analysis
Srivatsa, M., & Liu, L. (2005) · Annual Computer Security Applications Conference · doi:10.1109/csac.2004.50 · Cited by 119
Towards a Scalable and Robust DHT
Awerbuch, B., & Scheideler, C. (2008) · Theory of Computing Systems · doi:10.1007/s00224-008-9099-9 · Cited by 118 · cited 6×
“Perhaps the clearest distinction between the different solutions is that some are based on purely theoretical constructions defined at a very high level [Fiat and Saia 2007; Fiat et al. 2005; Awerbuch and Scheideler 2006; Naor and Wieder 2003], while others take a more engineering approach and have their properties me…”
InfluentialMaking Chord Robust to Byzantine Attacks
Fiat, A., Saia, J., & Young, M. (2005) · Lecture notes in computer science · doi:10.1007/11561071_71 · Cited by 116 · cited 8×
“…between the different solutions is that some are based on purely theoretical constructions de.ned at a very high level [Fiat and Saia 2007; Fiat et al. 2005; Awerbuch and Scheideler 2006; Naor and Wieder 2003], while others take a more engineering approach and have their properties…”
BackgroundMethodInfluentialMinimizing churn in distributed systems
Godfrey, P. B., Shenker, S. J., & Stoica, I. G. (2006) · ACM SIGCOMM Conference (SIGCOMM) · doi:10.1145/1159913.1159931 · Cited by 107 · cited 2×
“There is a vast amount of literature related to the study of churn [Castro et al. 2004; Rhea et al. 2004; Godfrey et al. 2006; Li et al. 2005; Blake and Rodrigues 2003], load balancing [Zhu and Hu 2005; Rao et al. 2003; Karger and Ruhl 2006; Godfrey et al. 2004], and .ash crowds [Ramasubramanian…”
BackgroundGlobule: a collaborative content delivery network
Pierre, G., & van Steen, M. R. (2006) · IEEE Communications Magazine · doi:10.1109/mcom.2006.1678120 · Cited by 104
Self-citationScalaris: reliable transactional p2p key/value store
Schütt, T., Schintke, F., & Reinefeld, A. (2008) · ACM SIGPLAN Workshop on Erlang (Erlang) · doi:10.1145/1411273.1411280 · Cited by 101
Towards a scalable and robust DHT
Awerbuch, B., & Scheideler, C. (2006) · ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) · doi:10.1145/1148109.1148163 · Cited by 95
Group Spreading: A Protocol for Provably Secure Distributed Name Service
Awerbuch, B., & Scheideler, C. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-27836-8_18 · Cited by 89 · cited 4×
“Awerbuch and Scheideler [2006] Guarantees that malicious nodes are spread over the ID space and thus do not pollute region-based routing tables.”
BackgroundMethodResultInfluentialOn the establishment of distinct identities in overlay networks
Bazzi, R. A., & Konjevod, G. (2005) · Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing · doi:10.1145/1073814.1073873 · Cited by 77
How to spread adversarial nodes?
Scheideler, C. (2005) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/1060590.1060694 · Cited by 67
An Analysis of BitTorrent’s Two Kademlia-Based DHTs
Crosby, S. A., & Wallach, D. S. (2007) · Cited by 54
Towards scalable and robust overlay networks
Awerbuch, B. (2007) · Cited by 53
Practical large-scale latency estimation
Szymaniak, M., Presotto, D. L., Pierre, G., et al. (2008) · Computer Networks · doi:10.1016/j.comnet.2007.11.022 · Cited by 50 · cited 3×
“It should also be noted that stable network coordinates are difficult to produce [Szymaniak et al. 2004; Szymaniak et al. 2008], which introduces a trade-off between security and resilience to variable network conditions.”
BackgroundInfluentialSelf-citationInduced Churn as Shelter from Routing-Table Poisoning.
Condie, T., Kacholia, V., Sank, S., Hellerstein, J. M., & Maniatis, P. (2006) · Cited by 47
Lesniewski-Laas, C. (2008) · Social Network Systems · doi:10.1145/1435497.1435501 · Cited by 46
Informant: Detecting Sybils Using Incentives
Margolin, N. B., & Levine, B. N. (2007) · Lecture notes in computer science · doi:10.1007/978-3-540-77366-5_18 · Cited by 40 · cited 1×
“Finally, game theory has also been proposed to deal with Sybil attacks [Margolin and Levine 2007].”
BackgroundKubiatowicz, J. D., & Rhea, S. C. (2005) · Cited by 33
Proof: A DHT-Based Peer-to-Peer Search Engine
Yang, K.-H., & Ho, J.-M. (2006) · IEEE/WIC/ACM International Conference on Web Intelligence · doi:10.1109/wi.2006.137 · Cited by 23 · cited 1×
“Examples of deployed systems that rely on DHTs include BitTorrent, the Kademlia-based KAD .le sharing network used by eMule, MLDonkey and other compatible programs, peerto-peer search engines [Yang and Ho 2006; Tang et al. 2003], and botnets [Holz et al. 2008].”
MethodMalicious Behaviour in Content-Addressable Peer-to-Peer Networks
Reidemeister, T., Böhm, K., Ward, P. A. S., & Buchmann, E. (2005) · Annual Communication Networks and Services Research Conference (CNSR) · doi:10.1109/cnsr.2005.39 · Cited by 12
P2P systems with transactional semantics
Antony, S., Agrawal, D., & Abbadi, A. E. (2008) · International Conference on Extending Database Technology (EDBT) · doi:10.1145/1353343.1353349 · Cited by 10 · cited 2×
“Such systems have been proposed [Antony et al. 2008; Sch ¨ utt et al. 2008; Plantikow et al. 2007; Mesaros et al. 2005], but we are not aware of any transactional DHT design that tolerates malicious nodes.”
BackgroundSurvey of Six Myths and Oversights about Distributed Hash Tables' Security
Dahan, S., & Sato, M. (2007) · IEEE International Conference on Distributed Computing Systems Workshops (ICDCSW) · doi:10.1109/icdcsw.2007.77 · Cited by 6
Cited by
The socialbot network: when bots socialize for fame and money
Boshmaf, Y., Muslukhov, I., Beznosov, K., & Ripeanu, M. (2011) · Proceedings of the 27th Annual Computer Security Applications Conference · doi:10.1145/2076732.2076746 · Cited by 436
On Security in Publish/Subscribe Services: A Survey
Esposito, C., & Ciampi, M. (2015) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2014.2364616 · Cited by 55
“, by adopting proper techniques [107], [108] to secure IP Multicast or techniques [109] to protect Pastry in the case of Scribe.”
Method
Metadata
- Authors
- Urdaneta, G., Pierre, G., & Steen, M. V.
- Venue
- ACM Computing Surveys
- Published
- 2011-01
- Volume
- 43
- Issue
- 2
- Pages
- 1-49
- ISSN
- 0360-0300 (ISSN-L)
- 1557-7341
- OpenAlex
- W2004075592
- Cited by
- 209
- References
- 68
- FWCI
- 37.12
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.