{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,13]],"date-time":"2025-02-13T05:26:05Z","timestamp":1739424365640,"version":"3.37.0"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642052835"},{"type":"electronic","value":"9783642052842"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-05284-2_25","type":"book-chapter","created":{"date-parts":[[2009,10,13]],"date-time":"2009-10-13T12:06:00Z","timestamp":1255435560000},"page":"437-447","source":"Crossref","is-referenced-by-count":0,"title":["Reliable Resource Searching in P2P Networks"],"prefix":"10.1007","author":[{"given":"Michael T.","family":"Goodrich","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jonathan Z.","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roberto","family":"Tamassia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nikos","family":"Triandopoulos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"25_CR1","first-page":"384","volume-title":"SODA","author":"J. Aspnes","year":"2003","unstructured":"Aspnes, J., Shah, G.: Skip graphs. In: SODA, pp. 384\u2013393. ACM, New York (2003)"},{"key":"25_CR2","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1145\/1148109.1148163","volume-title":"SPAA","author":"B. Awerbuch","year":"2006","unstructured":"Awerbuch, B., Scheideler, C.: Towards a scalable and robust DHT. In: SPAA, pp. 318\u2013327. ACM, New York (2006)"},{"key":"25_CR3","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1145\/1060289.1060317","volume-title":"OSDI","author":"M. Castro","year":"2002","unstructured":"Castro, M., Druschel, P., Ganesh, A., Rowstron, A., Wallach, D.S.: Secure routing for structured P2P overlay networks. In: OSDI, pp. 299\u2013314. ACM, New York (2002)"},{"key":"25_CR4","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1145\/502034.502054","volume-title":"SOSP","author":"F. Dabek","year":"2001","unstructured":"Dabek, F., Kaashoek, M.F., Karger, D., Morris, R., Stoica, I.: Wide-area cooperative storage with CFS. In: SOSP, pp. 202\u2013215. ACM, New York (2001)"},{"key":"25_CR5","first-page":"94","volume-title":"SODA","author":"A. Fiat","year":"2002","unstructured":"Fiat, A., Saia, J.: Censorship resistant peer-to-peer content addressable networks. In: SODA, pp. 94\u2013103. ACM, New York (2002)"},{"key":"25_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)"},{"issue":"1","key":"25_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/505452.505453","volume":"20","author":"K. Fu","year":"2002","unstructured":"Fu, K., Kaashoek, M.F., Mazieres, D.: Fast and secure distributed read-only file system. Transactions on Computer Systems\u00a020(1), 1\u201324 (2002)","journal-title":"Transactions on Computer Systems"},{"key":"25_CR8","first-page":"1068","volume-title":"DISCEX 2002","author":"M.T. Goodrich","year":"2001","unstructured":"Goodrich, M.T., Tamassia, R., Schwerin, A.: Implementation of an authenticated dictionary with skip lists and commutative hashing. In: DISCEX 2002, p. 1068. IEEE, Los Alamitos (2001)"},{"key":"25_CR9","unstructured":"Kapadia, A., Triandopoulos, N.: Halo: High assurance locate for distributed hash tables. In: NDSS, pp. 61\u201379 (2008); Internet Society"},{"key":"25_CR10","first-page":"188","volume-title":"I-SPAN","author":"K. Kothapalli","year":"2005","unstructured":"Kothapalli, K., Scheideler, C.: Supervised peer-to-peer systems. In: I-SPAN, pp. 188\u2013193. IEEE, Los Alamitos (2005)"},{"key":"25_CR11","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1145\/1180405.1180409","volume-title":"CCS","author":"A. Nambiar","year":"2006","unstructured":"Nambiar, A., Wright, M.: Salsa: a structured approach to large-scale anonymity. In: CCS, pp. 17\u201326. ACM, New York (2006)"},{"key":"25_CR12","volume-title":"The Design of Dynamic Data Structures","author":"M..H. Overmars","year":"1983","unstructured":"Overmars, M.H.: The Design of Dynamic Data Structures, vol.\u00a0156. Springer, Heidelberg (1983)"},{"issue":"6","key":"25_CR13","doi-asserted-by":"publisher","first-page":"668","DOI":"10.1145\/78973.78977","volume":"33","author":"W. Pugh","year":"1990","unstructured":"Pugh, W.: Skip lists: a probabilistic alternative to balanced trees. Communications of the ACM\u00a033(6), 668\u2013676 (1990)","journal-title":"Communications of the ACM"},{"key":"25_CR14","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1145\/383059.383072","volume-title":"SIGCOMM","author":"S. Ratnasamy","year":"2001","unstructured":"Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A scalable content-addressable network. In: SIGCOMM, pp. 161\u2013172. ACM, New York (2001)"},{"key":"25_CR15","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1145\/1080091.1080102","volume-title":"SIGCOMM","author":"S. Rhea","year":"2005","unstructured":"Rhea, S., Godfrey, B., Karp, B., Kubiatowicz, J., Ratnasamy, S., Shenker, S., Stoica, I., Yu, H.: OpenDHT: A public DHT service and its uses. In: SIGCOMM, pp. 73\u201384. ACM, New York (2005)"},{"key":"25_CR16","first-page":"270","volume-title":"IPTPS","author":"J. Saia","year":"2002","unstructured":"Saia, J., Fiat, A., Gribble, S.D., Karlin, A.R., Saroiu, S.: Dynamically fault-tolerant content addressable networks. In: IPTPS, pp. 270\u2013279. Springer, Heidelberg (2002)"},{"key":"25_CR17","doi-asserted-by":"crossref","unstructured":"Stoica, I., Morris, R., Karger, D., Kaashoek, F., Balakrishnan, H.: Chord: A scalable P2P lookup service for Internet applications. In: SIGCOMM, pp. 149\u2013160 (2001)","DOI":"10.1145\/964723.383071"},{"key":"25_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/978-3-540-72738-5_23","volume-title":"Applied Cryptography and Network Security","author":"R. Tamassia","year":"2007","unstructured":"Tamassia, R., Triandopoulos, N.: Efficient content authentication in peer-to-peer networks. In: Katz, J., Yung, M. (eds.) ACNS 2007. LNCS, vol.\u00a04521, pp. 354\u2013372. Springer, Heidelberg (2007)"}],"container-title":["Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","Security and Privacy in Communication Networks"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-05284-2_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,12]],"date-time":"2025-02-12T18:48:29Z","timestamp":1739386109000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-05284-2_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642052835","9783642052842"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-05284-2_25","relation":{},"ISSN":["1867-8211","1867-822X"],"issn-type":[{"type":"print","value":"1867-8211"},{"type":"electronic","value":"1867-822X"}],"subject":[],"published":{"date-parts":[[2009]]}}}