{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:02:13Z","timestamp":1725562933605},"publisher-location":"Berlin, Heidelberg","reference-count":32,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642151071"},{"type":"electronic","value":"9783642151088"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15108-8_6","type":"book-chapter","created":{"date-parts":[[2010,8,17]],"date-time":"2010-08-17T07:22:39Z","timestamp":1282029759000},"page":"62-74","source":"Crossref","is-referenced-by-count":2,"title":["Secure Routing Strategies in DHT-Based Systems"],"prefix":"10.1007","author":[{"given":"Ricardo","family":"Villanueva","sequence":"first","affiliation":[]},{"given":"Maria","family":"Pilar Villamil","sequence":"additional","affiliation":[]},{"given":"Mile","family":"Arnedo","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"6_CR1","first-page":"318","volume-title":"SPPA\u201906","author":"B. Awerbuch","year":"2006","unstructured":"Awerbuch, B., Scheideler, C.: Towards a scalable and robust DHT. In: SPPA\u201906, pp. 318\u2013327. ACM, New York (2006)"},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Scheideler, C.: Towards scalable and robust overlay networks. In: IPTPS\u201907 (2007)","DOI":"10.1145\/1148109.1148163"},{"key":"6_CR3","first-page":"299","volume-title":"SIGOPS\u201902","author":"M. Castro","year":"2002","unstructured":"Castro, M., Druschel, P., Ganesh, A., Rowstron, A., Wallach, D.: Secure routing for structured peer-to-peer overlay networks. In: SIGOPS\u201902, pp. 299\u2013314. ACM, New York (2002)"},{"key":"6_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/11555827_18","volume-title":"Computer Security \u2013 ESORICS 2005","author":"G. Danezis","year":"2005","unstructured":"Danezis, G., Lesniewski-Laas, C., Kaashoek, M., Anderson, R.: Sybil-resistant DHT routing. In: di Vimercati, S.d.C., Syverson, P.F., Gollmann, D. (eds.) ESORICS 2005. LNCS, vol.\u00a03679, pp. 305\u2013318. Springer, Heidelberg (2005)"},{"key":"6_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/3-540-45748-8_24","volume-title":"Peer-to-Peer Systems","author":"J. Douceur","year":"2002","unstructured":"Douceur, J.: The sybil attack. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol.\u00a02429, pp. 251\u2013260. Springer, Heidelberg (2002)"},{"key":"6_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"803","DOI":"10.1007\/11561071_71","volume-title":"Algorithms \u2013 ESA 2005","author":"A. Fiat","year":"2005","unstructured":"Fiat, A., Saia, J., Young, M.: Making chord robust to byzantine attacks. In: Brodal, G.S., Leonardi, S. (eds.) ESA 2005. LNCS, vol.\u00a03669, pp. 803\u2013814. Springer, Heidelberg (2005)"},{"key":"6_CR7","first-page":"4","volume-title":"ICIW\u201907","author":"N. Fedotova","year":"2007","unstructured":"Fedotova, N., Bertucci, M., Veltri, L.: Reputation management techniques in DHT-based peer-to-peer networks. In: ICIW\u201907, p. 4. IEEE, Los Alamitos (2007)"},{"key":"6_CR8","volume-title":"TDSC\u201909","author":"C. Harvesf","year":"2007","unstructured":"Harvesf, C., Blough, D.: Replica placement for route diversity in tree-based routing distributed hash tables. In: TDSC\u201909. IEEE, Los Alamitos (2007)"},{"key":"6_CR9","first-page":"321","volume-title":"DICS\u201903","author":"K. Hildrum","year":"2003","unstructured":"Hildrum, K., Kubiatowicz, J.: Asymptotically efficient approaches to fault-tolerance in peer-to-peer networks. In: DICS\u201903, pp. 321\u2013336. Springer, Heidelberg (2003)"},{"key":"6_CR10","unstructured":"Kapadia, A., Triandopoulos, N.: Halo: high-assurance locate for distributed hash tables. In: NDSS\u201908 (2008)"},{"key":"6_CR11","unstructured":"Lesniewski-Laas, C., Kaashoek, F.: Wh\u0101nau: A Sybil-Proof Distributed Hash Table. In: NSDI\u201910 (2010)"},{"key":"6_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1007\/978-3-540-30183-7_10","volume-title":"Peer-to-Peer Systems III","author":"S. Marti","year":"2005","unstructured":"Marti, S., Ganesan, P., Garcia-Molina, H.: DHT routing using social links. In: Voelker, G.M., Shenker, S. (eds.) IPTPS 2004. LNCS, vol.\u00a03279, pp. 100\u2013111. Springer, Heidelberg (2005)"},{"key":"6_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/978-3-540-45172-3_8","volume-title":"Peer-to-Peer Systems II","author":"M. Naor","year":"2003","unstructured":"Naor, M., Wieder, U.: A simple Fault Tolerant Distributed Hash Table. In: Kaashoek, M.F., Stoica, I. (eds.) IPTPS 2003. LNCS, vol.\u00a02735, pp. 88\u201397. Springer, Heidelberg (2003)"},{"key":"6_CR14","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1145\/1529282.1529292","volume-title":"SAC\u201909","author":"K. Needels","year":"2009","unstructured":"Needels, K., Kwon, M.: Secure routing in peer-to-peer distributed hash tables. In: SAC\u201909, pp. 54\u201358. ACM, New York (2009)"},{"key":"6_CR15","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1145\/383059.383072","volume-title":"SIGCOMM\u201901","author":"S. Ratsanamy","year":"2001","unstructured":"Ratsanamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A scalable content-addressable network. In: SIGCOMM\u201901, pp. 161\u2013172. ACM, New York (2001)"},{"key":"6_CR16","first-page":"43","volume-title":"IPTPS\u201906","author":"B. Roh","year":"2006","unstructured":"Roh, B., Kwon, O., Hong, S., Kim, J.: The exclusion of malicious routing peers in structured P2P systems. In: IPTPS\u201906, pp. 43\u201350. Springer, Heidelberg (2006)"},{"key":"6_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/3-540-45518-3_18","volume-title":"Middleware 2001","author":"A. Rowstron","year":"2001","unstructured":"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.\u00a02218, pp. 329\u2013350. Springer, Heidelberg (2001)"},{"key":"6_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1007\/3-540-45748-8_26","volume-title":"Peer-to-Peer Systems","author":"J. Saia","year":"2002","unstructured":"Saia, J., Fiaty, A., Gribble, S., Karlin, A., Saroiu, S.: Dynamically fault-tolerant content addressable networks. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol.\u00a02429, pp. 270\u2013279. Springer, Heidelberg (2002)"},{"key":"6_CR19","first-page":"50","volume-title":"Internet Computing\u201905","author":"M. S\u00e1nchez-Artigas","year":"2005","unstructured":"S\u00e1nchez-Artigas, M., Garc\u00eda-L\u00f3pez, P., G\u00f3mez, A.: A novel methodology for constructing secure multi-path overlay. In: Internet Computing\u201905, pp. 50\u201357. IEEE, Los Alamitos (2005)"},{"key":"6_CR20","first-page":"934","volume-title":"ISCC\u201908","author":"M. S\u00e1nchez-Artigas","year":"2008","unstructured":"S\u00e1nchez-Artigas, M., Garc\u00eda-L\u00f3pez, P., G\u00f3mez, A.: Bypass: providing secure DHT routing through bypassing malicious peers. In: ISCC\u201908, pp. 934\u2013941. IEEE, Los Alamitos (2008)"},{"key":"6_CR21","first-page":"611","volume-title":"EuroPar\u201908","author":"M. S\u00e1nchez-Artigas","year":"2008","unstructured":"S\u00e1nchez-Artigas, M., Garc\u00eda-L\u00f3pez, P., G\u00f3mez, A.: Secure forwarding in DHTs-is redundancy the key to robustness? In: EuroPar\u201908, pp. 611\u2013621. Springer, Heidelberg (2008)"},{"key":"6_CR22","first-page":"31","volume-title":"P2P\u201909","author":"M. S\u00e1nchez-Artigas","year":"2009","unstructured":"S\u00e1nchez-Artigas, M., Garc\u00eda-L\u00f3pez, P.: On routing in distributed hash tables: is reputation a shelter from malicious behavior and churn? In: P2P\u201909, pp. 31\u201340. IEEE, Los Alamitos (2009)"},{"key":"6_CR23","first-page":"1","volume-title":"INFOCOM\u201906","author":"A. Singh","year":"2006","unstructured":"Singh, A., Ngan, T., Druschel, P., Wallach, D.: Eclipse attacks on overlay networks: threats and defenses. In: INFOCOM\u201906, pp. 1\u201312. IEEE, Los Alamitos (2006)"},{"key":"6_CR24","doi-asserted-by":"crossref","first-page":"704","DOI":"10.1145\/1060590.1060694","volume-title":"STOC\u201905","author":"C. Scheideler","year":"2005","unstructured":"Scheideler, C.: How to spread adversarial nodes? Rotate! In: STOC\u201905, pp. 704\u2013713. ACM, New York (2005)"},{"key":"6_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/3-540-45748-8_25","volume-title":"Peer-to-Peer Systems","author":"E. Sit","year":"2002","unstructured":"Sit, E., Morris, R.: Security considerations for peer-to-peer distributed hash tables. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol.\u00a02429, pp. 261\u2013269. Springer, Heidelberg (2002)"},{"key":"6_CR26","first-page":"252","volume-title":"ACSAC\u201904","author":"M. Srivatsa","year":"2004","unstructured":"Srivatsa, M., Liu, L.: Vulnerabilities and security threats in structured overlay networks: A quantitative analysis. In: ACSAC\u201904, pp. 252\u2013261. IEEE, Los Alamitos (2004)"},{"key":"6_CR27","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1145\/383059.383071","volume-title":"SIGCOMM\u201901","author":"I. Stoica","year":"2001","unstructured":"Stoica, I., Morris, R., Karger, D., Kaashoek, M., Balakrishnan, H.: Chord: a scalable peer-to-peer lookup service for internet applications. In: SIGCOMM\u201901, pp. 149\u2013160. ACM, New York (2001)"},{"key":"6_CR28","unstructured":"Wang, P., Osipkov, I., Hopper, N., Kim, Y.: Myrmic: secure and robust DHT routing (2007) (submission)"},{"key":"6_CR29","first-page":"354","volume-title":"NSWCTC\u201909","author":"X. Xiang","year":"2009","unstructured":"Xiang, X., Jin, T.: Efficient secure message routing for structured peer-to-peer systems. In: NSWCTC\u201909, pp. 354\u2013357. IEEE, Los Alamitos (2009)"},{"key":"6_CR30","volume-title":"ICDCS\u201910","author":"M. Young","year":"2010","unstructured":"Young, M., Kate, A., Goldberg, I., Karsten, M.: Practical robust communication in DHTs tolerating a byzantine adversary. In: ICDCS\u201910. IEEE, Los Alamitos (2010)"},{"key":"6_CR31","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1145\/1159913.1159945","volume-title":"SIGCOMM\u201906","author":"H. Yu","year":"2006","unstructured":"Yu, H., Kaminsky, M., Gibbons, P., Falxman, A.: SybilGuard: defending against sybil attacks via social networks. In: SIGCOMM\u201906, pp. 267\u2013278. ACM, New York (2006)"},{"key":"6_CR32","first-page":"41","volume-title":"J-SAC\u201904","author":"B. Zhao","year":"2004","unstructured":"Zhao, B., Huang, L., Stribling, J., Rhea, S., Joseph, A., Kubiatowicz, J.: Tapestry: a resilient global-scale overlay for service deployment. In: J-SAC\u201904, pp. 41\u201353. IEEE, Los Alamitos (2004)"}],"container-title":["Data Management in Grid and Peer-to-Peer Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15108-8_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,2]],"date-time":"2023-06-02T22:00:34Z","timestamp":1685743234000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15108-8_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642151071","9783642151088"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15108-8_6","relation":{},"subject":[],"published":{"date-parts":[[2010]]}}}