{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,17]],"date-time":"2026-08-17T14:57:06Z","timestamp":1786978626115,"version":"build-2736575974"},"publisher-location":"Berlin, Heidelberg","reference-count":32,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540499909","type":"print"},{"value":"9783540499916","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11945529_20","type":"book-chapter","created":{"date-parts":[[2006,11,27]],"date-time":"2006-11-27T07:18:52Z","timestamp":1164611932000},"page":"275-289","source":"Crossref","is-referenced-by-count":23,"title":["Robust Random Number Generation for Peer-to-Peer Systems"],"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":"20_CR1","unstructured":"Aspnes, J., Shah, G.: Skip graphs. In: Proc.\u00a0of the 14th ACM Symp.\u00a0on Discrete Algorithms (SODA), pp. 384\u2013393 (2003)"},{"key":"20_CR2","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Scheideler, C.: Group Spreading: A protocol for provably secure distributed name service. In: Proc.\u00a0of the 31st International Colloquium on Automata, Languages and Programming (ICALP) (2004)","DOI":"10.1007\/978-3-540-27836-8_18"},{"key":"20_CR3","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)"},{"key":"20_CR4","unstructured":"Awerbuch, B., Scheideler, C.: Towards a scalable and robust DHT. In: Proc.\u00a0of the 18th ACM Symp.\u00a0on Parallel Algorithms and Architectures (SPAA) (2006), See also, http:\/\/www14.in.tum.de\/personen\/scheideler"},{"key":"20_CR5","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Kelmer, B., Rabin, T.: Asynchronous secure computations with optimal resilience. In: Proc.\u00a0of the 13th ACM Symp.\u00a0on Principles of Distributed Computing (PODC), pp. 183\u2013192 (1994)","DOI":"10.1145\/197917.198088"},{"key":"20_CR6","doi-asserted-by":"crossref","unstructured":"Castro, M., Druschel, P., Ganesh, A., Rowstron, A., Wallach, D.: Security for structured peer-to-peer overlay networks. In: Proc.\u00a0of the 5th Usenix Symp.\u00a0on Operating Systems Design and Implementation (OSDI) (2002)","DOI":"10.1145\/1060289.1060317"},{"key":"20_CR7","unstructured":"Castro, M., Liskov, B.: Practical Byzantine fault tolerance. In: Proc. of the 2nd Usenix Symp.\u00a0on Operating Systems Design and Implementation (OSDI) (1999)"},{"key":"20_CR8","unstructured":"Crosby, S., Wallach, D.: Denial of service via algorithmic complexity attacks. In: Usenix Security (2003)"},{"key":"20_CR9","doi-asserted-by":"crossref","unstructured":"Douceur, J.R.: The sybil attack. In: Proc.\u00a0of the 1st International Workshop on Peer-to-Peer Systems (IPTPS) (2002)","DOI":"10.1007\/3-540-45748-8_24"},{"key":"20_CR10","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":"20_CR11","series-title":"Algorithms and Combinatorics","volume-title":"Modern Cryptography, Probabilistic Proofs and Pseudorandomness","author":"O. Goldreich","year":"1998","unstructured":"Goldreich, O.: Modern Cryptography, Probabilistic Proofs and Pseudorandomness. Algorithms and Combinatorics, vol.\u00a017. Springer, Heidelberg (1998)"},{"key":"20_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/3-540-68697-5_16","volume-title":"Advances in Cryptology - CRYPTO \u201996","author":"S. Halevi","year":"1996","unstructured":"Halevi, S., Micali, S.: Practical and provably-secure commitment schemes from collision-free hashing. In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol.\u00a01109, pp. 201\u2013215. Springer, Heidelberg (1996)"},{"key":"20_CR13","doi-asserted-by":"crossref","unstructured":"Karger, D., Lehman, E., Leighton, T., Levine, M., Lewin, D., Panigrahi, R.: Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the World Wide Web. In: 29th ACM Symp.\u00a0on Theory of Computing (STOC), pp. 654\u2013663 (1997)","DOI":"10.1145\/258533.258660"},{"key":"20_CR14","doi-asserted-by":"crossref","unstructured":"King, V., Saia, J., Sanwalani, V., Vee, E.: Towards a secure and scalable computation in peer-to-peer networks. In: Proc.\u00a0of the 47th IEEE Symp.\u00a0on Foundations of Computer Science (FOCS) (2006)","DOI":"10.1109\/FOCS.2006.77"},{"key":"20_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/11558989_2","volume-title":"Peer-to-Peer Systems IV","author":"F. Kuhn","year":"2005","unstructured":"Kuhn, F., Schmid, S., Wattenhofer, R.: A self-repairing peer-to-peer system resilient to dynamic adversarial churn. In: Castro, M., van Renesse, R. (eds.) IPTPS 2005. LNCS, vol.\u00a03640, pp. 13\u201323. Springer, Heidelberg (2005)"},{"key":"20_CR16","doi-asserted-by":"crossref","DOI":"10.1515\/9780691206844","volume-title":"Pseudorandomness and Cryptographic Applications","author":"M. Luby","year":"1996","unstructured":"Luby, M.: Pseudorandomness and Cryptographic Applications. Princeton University Press, Princeton (1996)"},{"issue":"2","key":"20_CR17","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/BF00196774","volume":"4","author":"M. Naor","year":"1991","unstructured":"Naor, M.: Bit commitment using pseudorandomness. Journal of Cryptology\u00a04(2), 151\u2013158 (1991)","journal-title":"Journal of Cryptology"},{"key":"20_CR18","doi-asserted-by":"crossref","unstructured":"Naor, M., Wieder, U.: Novel architectures for P2P applications: the continuous-discrete approach. In: Proc.\u00a0of the 15th ACM Symp.\u00a0on Parallel Algorithms and Architectures (SPAA) (2003)","DOI":"10.1145\/777412.777421"},{"key":"20_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/11558989_4","volume-title":"Peer-to-Peer Systems IV","author":"S.J. Nielson","year":"2005","unstructured":"Nielson, S.J., Crosby, S.A., Wallach, D.S.: A taxonomy of rational attacks. In: Castro, M., van Renesse, R. (eds.) IPTPS 2005. LNCS, vol.\u00a03640, pp. 36\u201346. Springer, Heidelberg (2005)"},{"key":"20_CR20","doi-asserted-by":"crossref","unstructured":"Plaxton, G., Rajaraman, R., Richa, A.W.: Accessing nearby copies of replicated objects in a distributed environment. In: Proc.\u00a0of the 9th ACM Symp.\u00a0on Parallel Algorithms and Architectures (SPAA), pp. 311\u2013320 (1997)","DOI":"10.1145\/258492.258523"},{"key":"20_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/11795490_9","volume-title":"Principles of Distributed Systems","author":"H.V. Ramasamy","year":"2006","unstructured":"Ramasamy, H.V., Cachin, C.: Parsimonious asynchronous byzantine-fault-tolerant atomic broadcast. In: Anderson, J.H., Prencipe, G., Wattenhofer, R. (eds.) OPODIS 2005. LNCS, vol.\u00a03974, pp. 88\u2013102. Springer, Heidelberg (2006)"},{"key":"20_CR22","unstructured":"Rhea, S., Geels, D., Roscoe, T., Kubiatowicz, J.: Handling churn in a DHT. In: USENIX Annual Technical Conference (2004)"},{"key":"20_CR23","unstructured":"Ritter, T.: RNG implementations: A literature survey, http:\/\/www.ciphersbyritter.com\/RES\/RNGENS.HTM"},{"key":"20_CR24","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., Fiat, A., Gribble, S.D., Karlin, A.R., Saroiu, S.: Dynamically fault-tolerant content addressable networks. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol.\u00a02429, p. 270. Springer, Heidelberg (2002)"},{"key":"20_CR25","doi-asserted-by":"crossref","unstructured":"Scheideler, C.: How to spread adversarial nodes? Rotate? In: Proc.\u00a0of the 37th ACM Symp.\u00a0on Theory of Computing (STOC), pp. 704\u2013713 (2005)","DOI":"10.1145\/1060590.1060694"},{"key":"20_CR26","doi-asserted-by":"crossref","unstructured":"Singh, A., Castro, M., Rowstron, A., Druschel, P.: Defending against Eclipse attacks on overlay networks. In: Proc.\u00a0of the 11th ACM SIGOPS European Workshop (2004)","DOI":"10.1145\/1133572.1133613"},{"key":"20_CR27","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, p. 261. Springer, Heidelberg (2002)"},{"key":"20_CR28","doi-asserted-by":"crossref","unstructured":"Srinathan, K., Rangan, C.P.: Efficient asynchronous secure multiparty distributed computation. In: Proc.\u00a0of the 1st Int. Conference on Progress in Cryptology, pp. 117\u2013129 (2000)","DOI":"10.1007\/3-540-44495-5_11"},{"key":"20_CR29","unstructured":"Srivatsa, M., Liu, L.: Vulnerabilities and security threats in structured overlay networks: A quantitative analysis. In: ACSAC (2004)"},{"key":"#cr-split#-20_CR30.1","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":"#cr-split#-20_CR30.2","unstructured":"See also, http:\/\/www.pdos.lcs.mit.edu\/chord\/"},{"key":"20_CR31","doi-asserted-by":"crossref","unstructured":"Viega, J.: Practical random number generation in software. In: Proc. of the 19th Annual Computer Security Applications Conference (2003)","DOI":"10.1109\/CSAC.2003.1254318"}],"container-title":["Lecture Notes in Computer Science","Principles of Distributed Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11945529_20.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T15:00:27Z","timestamp":1605625227000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11945529_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540499909","9783540499916"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/11945529_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}