{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,11]],"date-time":"2026-11-11T07:11:10Z","timestamp":1794381070785,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540228493","type":"print"},{"value":"9783540278368","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27836-8_18","type":"book-chapter","created":{"date-parts":[[2010,9,15]],"date-time":"2010-09-15T18:53:21Z","timestamp":1284576801000},"page":"183-195","source":"Crossref","is-referenced-by-count":41,"title":["Group Spreading: A Protocol for Provably Secure Distributed Name Service"],"prefix":"10.1007","author":[{"given":"Baruch","family":"Awerbuch","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Christian","family":"Scheideler","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"18_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/978-3-540-30183-7_23","volume-title":"Peer-to-Peer Systems III","author":"B. Awerbuch","year":"2005","unstructured":"Awerbuch, B., Scheideler, C.: Robust distributed name service. In: Voelker, G.M., Shenker, S. (eds.) IPTPS 2004. LNCS, vol.\u00a03279, pp. 237\u2013249. Springer, Heidelberg (2005)"},{"issue":"1","key":"18_CR2","first-page":"1","volume":"3","author":"R. Canetti","year":"1997","unstructured":"Canetti, R., Gennaro, R., Herzberg, A., Naor, D.: Proactive security: Long-term protection against break-ins. RSA CryptoBytes\u00a03(1), 1\u20138 (1997)","journal-title":"RSA CryptoBytes"},{"key":"18_CR3","doi-asserted-by":"crossref","unstructured":"Castro, M., Druschel, P., Ganesh, A., Rowstron, A., Wallach, D.: Secure routing for structured peer-to-peer overlay networks. In: Proc. of the 5th Usenix Symp. on Operating Systems Design and Implementation, OSDI (2002)","DOI":"10.1145\/1060289.1060317"},{"key":"18_CR4","unstructured":"Castro, M., Liskov, B.: Practical Byzantine fault tolerance. In: Proc. of the 2nd Usenix Symp. on Operating Systems Design and Implementation, OSDI (1999)"},{"key":"18_CR5","unstructured":"Crosby, S., Wallach, D.: Denial of service via algorithmic complexity attacks. In: Usenix Security (2003)"},{"key":"18_CR6","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.R. Douceur","year":"2002","unstructured":"Douceur, J.R.: The sybil attack. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol.\u00a02429, p. 251. Springer, Heidelberg (2002)"},{"key":"18_CR7","doi-asserted-by":"crossref","unstructured":"Druschel, P., Rowstron, A.: Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In: Guerraoui, R. (ed.) Middleware 2001. LNCS, vol.\u00a02218, p. 329. Springer, Heidelberg (2001)","DOI":"10.1007\/3-540-45518-3_18"},{"key":"18_CR8","unstructured":"Fiat, A., Saia, J.: Censorship resistant peer-to-peer content addressable networks. In: Proc. of the 13th ACM Symp. on Discrete Algorithms, SODA (2002)"},{"key":"18_CR9","doi-asserted-by":"crossref","unstructured":"Frankel, Y., Gemmell, P., MacKenzie, P.D., Yung, M.: Optimal resilience proactive public-key cryptosystems. In: Proc. of the 38th IEEE Symp. on Foundations of Computer Science (FOCS), pp. 384\u2013393 (1997)","DOI":"10.1109\/SFCS.1997.646127"},{"key":"18_CR10","doi-asserted-by":"crossref","unstructured":"Herzberg, A., Jakobsson, M., Jarecki, S., Krawczyk, H., Yung, M.: Proactive public key and signature systems. In: Proc. of the ACM Conference on Computer and Communications Security (CCS), pp. 100\u2013110 (1997)","DOI":"10.1145\/266420.266442"},{"key":"18_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1007\/3-540-44750-4_27","volume-title":"Advances in Cryptology - CRYPTO \u201995","author":"A. Herzberg","year":"1995","unstructured":"Herzberg, A., Jarecki, S., Krawczyk, H., Yung, M.: Proactive secret sharing or: How to cope with perpetual leakage. In: Coppersmith, D. (ed.) CRYPTO 1995. LNCS, vol.\u00a0963, pp. 339\u2013352. Springer, Heidelberg (1995)"},{"issue":"3","key":"18_CR12","doi-asserted-by":"publisher","first-page":"669","DOI":"10.1145\/2402.322398","volume":"30","author":"L. Lamport","year":"1983","unstructured":"Lamport, L.: The weak Byzantine generals problem. Journal of the ACM\u00a030(3), 669\u2013676 (1983)","journal-title":"Journal of the ACM"},{"key":"18_CR13","doi-asserted-by":"crossref","unstructured":"Lamport, L., Lynch, N.: Handbook on Theoretical Computer Science. In: Distributed computing; Also, to be published as Technical Memo MIT\/LCS\/TM- 384, Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA (1989)","DOI":"10.21236\/ADA208996"},{"key":"18_CR14","doi-asserted-by":"crossref","unstructured":"Naor, M., Wieder, U.: Novel architectures for P2P applications: the continuousdiscrete approach. In: Proc. of the 15th ACM Symp. on Parallel Algorithms and Architectures, SPAA (2003)","DOI":"10.1145\/777412.777421"},{"key":"18_CR15","doi-asserted-by":"crossref","unstructured":"Ostrovsky, R., Yung, M.: How to withstand mobile virus attacks. In: Proc. of the 10th ACM Symp. on Principles of Distributed Computing (PODC), pp. 51\u201359 (1991)","DOI":"10.1145\/112600.112605"},{"key":"18_CR16","doi-asserted-by":"crossref","unstructured":"De Prisco, R., Lampson, B.W., Lynch, N.: Revisiting the Paxos algorithm. In: Workshop on Distributed Algorithms, pp. 111\u2013125 (1997)","DOI":"10.1007\/BFb0030679"},{"key":"18_CR17","doi-asserted-by":"crossref","unstructured":"Stoica, I., Morris, R., Karger, D., Kaashoek, M.F., Balakrishnan, H.: Chord: A scalable peer-to-peer lookup service for Internet applications. In: Proc. of the ACM SIGCOMM 2001 (2001)","DOI":"10.1145\/383059.383071"},{"key":"18_CR18","unstructured":"Zhao, B.Y., Kubiatowicz, J., Joseph, A.: Tapestry: An infrastructure for faulttolerant wide-area location and routing. Technical report, University of California at Berkeley, Computer Science Department (2001)"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27836-8_18.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,18]],"date-time":"2020-11-18T23:23:50Z","timestamp":1605741830000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27836-8_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540228493","9783540278368"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27836-8_18","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/b99859","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004]]}}}