{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,27]],"date-time":"2026-10-27T18:58:41Z","timestamp":1793127521453,"version":"4.5.0"},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540441793","type":"print"},{"value":"9783540457480","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45748-8_26","type":"book-chapter","created":{"date-parts":[[2007,10,9]],"date-time":"2007-10-09T12:29:16Z","timestamp":1191932956000},"page":"270-279","source":"Crossref","is-referenced-by-count":46,"title":["Dynamically Fault-Tolerant Content Addressable Networks"],"prefix":"10.1007","author":[{"given":"Jared","family":"Saia","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Amos","family":"Fiat","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Steve","family":"Gribble","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Anna R.","family":"Karlin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Stefan","family":"Saroiu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2002,10,10]]},"reference":[{"key":"26_CR1","unstructured":"Amos Fiat and Jared Saia. Censorship Resistant Peer-to-Peer Content Addressable Networks. In Symposium on Discrete Algorithms, 2002."},{"key":"26_CR2","unstructured":"B.Y. Zhao, K.D. Kubiatowicz and A.D. Joseph. Tapestry: An Infrastructure for Fault-Resilient Wide-Area Location and Routing. Technical Report UCB\/\/CSD-01-1141, University of California at Berkeley Technical Report, April 2001."},{"key":"26_CR3","doi-asserted-by":"crossref","unstructured":"David Moore, Geoffrey Voelker and Stefan Savage. Inferring internet denial-ofservice activity. In Proceedings of the 2001 USENIX Security Symposium, 2001.","DOI":"10.21236\/ADA400003"},{"key":"26_CR4","doi-asserted-by":"crossref","unstructured":"Ion Stoica, Robert Morris, David Karger, Frans Kaashoek and Hari Balakrishnan. Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications. In Proceedings of the ACM SIGCOMM 2001 Technical Conference, San Diego, CA, USA, August 2001.","DOI":"10.1145\/383059.383071"},{"key":"26_CR5","doi-asserted-by":"crossref","unstructured":"Johan Hastad, Thomson Leighton and Mark Newman. Fast computation using faulty hypercubes. In Proceedings of the 21st Annual ACM Symposium on Theory of Computing, 1989.","DOI":"10.21236\/ADA211910"},{"key":"26_CR6","doi-asserted-by":"crossref","unstructured":"Mihir Bellare and Phillip Rogaway. Random oracles are practical: a paradigm for designing efficient protocols. In The First ACM Conference on Computer and Communications Security, pages 62\u201373, 1993.","DOI":"10.1145\/168588.168596"},{"key":"26_CR7","doi-asserted-by":"crossref","unstructured":"Noga Alon, Haim Kaplan, Michael Krivelevich, Dahlia Malkhi and Julien Stern. Scalable secure storage when half the system is faulty. In Proceedings of the 27th International Colloquium on Automata, Languages and Programming, 2000.","DOI":"10.1007\/3-540-45022-X_49"},{"key":"26_CR8","doi-asserted-by":"crossref","unstructured":"Stefan Saroiu, P. Krishna Gummadi and Steven D. Gribble. A Measurement Study of Peer-to-Peer File Sharing Systems. In Proceedings of Multimedia Computing and Networking, 2002.","DOI":"10.1117\/12.449977"},{"key":"26_CR9","doi-asserted-by":"crossref","unstructured":"Sylvia Ratnasamy, Paul Francis, Mark Handley, Richard Karp and Scott Shenker. A Scalable Content-Addressable Network. In Proceedings of the ACM SIGCOMM 2001 Technical Conference, San Diego, CA, USA, August 2001.","DOI":"10.1145\/383059.383072"}],"container-title":["Lecture Notes in Computer Science","Peer-to-Peer Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45748-8_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T13:41:25Z","timestamp":1737466885000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45748-8_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540441793","9783540457480"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/3-540-45748-8_26","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2002]]}}}