{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T03:19:22Z","timestamp":1725851962491},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319312033"},{"type":"electronic","value":"9783319312040"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-31204-0_20","type":"book-chapter","created":{"date-parts":[[2016,3,22]],"date-time":"2016-03-22T07:24:40Z","timestamp":1458631480000},"page":"299-314","source":"Crossref","is-referenced-by-count":0,"title":["Reducing Efficiency of Connectivity-Splitting Attack on Newscast via Limited Gossip"],"prefix":"10.1007","author":[{"given":"Jakub","family":"Muszy\u0144ski","sequence":"first","affiliation":[]},{"given":"S\u00e9bastien","family":"Varrette","sequence":"additional","affiliation":[]},{"given":"Pascal","family":"Bouvry","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,3,15]]},"reference":[{"key":"20_CR1","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1109\/TDSC.2004.2","volume":"1","author":"A Avizienis","year":"2004","unstructured":"Avizienis, A., Laprie, J.C., Randell, B., Landwehr, C.E.: Basic concepts and taxonomy of dependable and secure computing. IEEE Trans. Dependable Secure Comput. 1, 11\u201333 (2004)","journal-title":"IEEE Trans. Dependable Secure Comput."},{"key":"20_CR2","doi-asserted-by":"publisher","first-page":"2340","DOI":"10.1016\/j.comnet.2009.03.008","volume":"53","author":"E Bortnikov","year":"2009","unstructured":"Bortnikov, E., Gurevich, M., Keidar, I., Kliot, G., Shraer, A.: Brahms: Byzantine resilient random membership sampling. Comput. Netw. 53, 2340\u20132359 (2009)","journal-title":"Comput. Netw."},{"key":"20_CR3","doi-asserted-by":"crossref","unstructured":"Canon, L., Jeannot, E., Weissman, J.: A scheduling and certification algorithm for defeating collusion in desktop grids. In: 2011 31st International Conference on Distributed Computing Systems (ICDCS), pp. 343\u2013352, June 2011","DOI":"10.1109\/ICDCS.2011.66"},{"key":"20_CR4","unstructured":"Dutot, A., Guinand, F., Olivier, D., Pign\u00e9, Y.: GraphStream: A Tool for bridging the gap between Complex Systems and Dynamic Graphs. In: Emergent Properties in Natural and Artificial Complex Systems. Satellite Conference within the 4th European Conference on Complex Systems (ECCS\u20192007), Dresden, Allemagne (2007\u20132010). \n                      http:\/\/graphstream-project.org\/"},{"key":"20_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/978-3-540-30229-2_5","volume-title":"Middleware 2004","author":"M Jelasity","year":"2004","unstructured":"Jelasity, M., Guerraoui, R., Kermarrec, A.-M., van Steen, M.: The peer sampling service: experimental evaluation of unstructured gossip-based implementations. In: Jacobsen, H.-A. (ed.) Middleware 2004. LNCS, vol. 3231, pp. 79\u201398. Springer, Heidelberg (2004)"},{"issue":"3","key":"20_CR6","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1145\/1082469.1082470","volume":"23","author":"M Jelasity","year":"2005","unstructured":"Jelasity, M., Montresor, A., Babaoglu, O.: Gossip-based aggregation in large dynamic networks. ACM Trans. Comput. Syst. 23(3), 219\u2013252 (2005)","journal-title":"ACM Trans. Comput. Syst."},{"key":"20_CR7","unstructured":"Jelasity, M., van Steen, M.: Large-Scale newscast computing on the internet. Technical Report IR-503, Vrije Universiteit Amsterdam, Department of Computer Science, Amsterdam, The Netherlands, October 2002"},{"key":"20_CR8","doi-asserted-by":"publisher","first-page":"2086","DOI":"10.1016\/j.comnet.2010.03.020","volume":"54","author":"GP Jesi","year":"2010","unstructured":"Jesi, G.P., Montresor, A., Van Steen, M.: Secure peer sampling. Comput. Netw. 54, 2086\u20132098 (2010)","journal-title":"Comput. Netw."},{"issue":"4","key":"20_CR9","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1145\/1218063.1217937","volume":"40","author":"H Johansen","year":"2006","unstructured":"Johansen, H., Allavena, A., van Renesse, R.: Fireflies: Scalable support for intrusion-tolerant network overlays. SIGOPS Oper. Syst. Rev. 40(4), 3\u201313 (2006)","journal-title":"SIGOPS Oper. Syst. Rev."},{"issue":"2","key":"20_CR10","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/s10710-009-9096-z","volume":"11","author":"J Laredo","year":"2010","unstructured":"Laredo, J., Eiben, A., Steen, M., Merelo, J.: Evag: a scalable peer-to-peer evolutionary algorithm. Genet. Program Evolvable Mach. 11(2), 227\u2013246 (2010)","journal-title":"Genet. Program Evolvable Mach."},{"issue":"1","key":"20_CR11","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/s00446-002-0082-4","volume":"16","author":"YM Minsky","year":"2003","unstructured":"Minsky, Y.M., Schneider, F.B.: Tolerating malicious gossip. Distrib. Comput. 16(1), 49\u201368 (2003)","journal-title":"Distrib. Comput."},{"key":"20_CR12","unstructured":"Moore, R.: Cybercrime: Investigating high-technology computer crime. LexisNexis\/Matthew Bender (2005)"},{"key":"20_CR13","series-title":"Communications in Computer and Information Science","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/978-3-662-44893-9_8","volume-title":"Cryptography and Security Systems","author":"J Muszy\u0144ski","year":"2014","unstructured":"Muszy\u0144ski, J., Varrette, S., Laredo, J.L.J., Bouvry, P.: Analysis of the data flow in the newscast protocol for possible vulnerabilities. In: Kotulski, Z., Ksi\u017copolski, B., Mazur, K. (eds.) CSS 2014. CCIS, vol. 448, pp. 89\u201399. Springer, Heidelberg (2014)"},{"key":"20_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"152","DOI":"10.1007\/978-3-319-11698-3_12","volume-title":"Network and System Security","author":"J Muszy\u0144ski","year":"2014","unstructured":"Muszy\u0144ski, J., Varrette, S., Laredo, J.L.J., Bouvry, P.: Exploiting the\u00a0hard-wired vulnerabilities of\u00a0newscast via\u00a0connectivity-splitting attack. In: Au, M.H., Carminati, B., Kuo, C.-C.J. (eds.) NSS 2014. LNCS, vol. 8792, pp. 152\u2013165. Springer, Heidelberg (2014)"},{"key":"20_CR15","unstructured":"Patel, J., Gupta, I., Contractor, N.: Jetstream: Achieving predictable gossip dissemination by leveraging social network principles. In: Fifth IEEE International Symposium on Network Computing and Applications, 2006, NCA 2006 pp. 32\u201339, July 2006"},{"key":"20_CR16","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. 2218, pp. 329\u2013350. Springer, Heidelberg (2001)"},{"key":"20_CR17","unstructured":"Sherr, M., Loo, B.T., Blaze, M.: Veracity: A fully decentralized service for securing network coordinate systems. In: Proceedings of the 7th International Conference on Peer-to-peer Systems, IPTPS 2008, p. 15. USENIX Association, Berkeley (2008)"},{"issue":"1","key":"20_CR18","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1109\/TNET.2002.808407","volume":"11","author":"I Stoica","year":"2003","unstructured":"Stoica, I., Morris, R., Liben-Nowell, D., Karger, D., Kaashoek, M., Dabek, F., Balakrishnan, H.: Chord: a scalable peer-to-peer lookup protocol for internet applications. IEEE\/ACM Trans. Netw. 11(1), 17\u201332 (2003)","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"20_CR19","doi-asserted-by":"crossref","unstructured":"Varrette, S., Tantar, E., Bouvry, P.: On the resilience of [distributed] evolutionary algorithms against cheaters in global computing platforms. In: Proceedings of the 14th International Workshop on Nature Inspired Distributed Computing (NIDISC 2011), part of the 25th IEEE\/ACM International Parallel and Distributed Processing Symposium (IPDpPS 2011). IEEE Computer Society, Anchorage (Alaska), USA, 16\u201320 May 2011","DOI":"10.1109\/IPDPS.2011.179"},{"key":"20_CR20","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/978-3-540-25840-7_6","volume-title":"Agents and Peer-to-Peer Computing","author":"S Voulgaris","year":"2004","unstructured":"Voulgaris, S., Jelasity, M., van Steen, M.: A robust and scalable peer-to-peer gossiping protocol. In: Moro, G., Sartori, C., Singh, M.P. (eds.) AP2PC 2003. LNCS (LNAI), vol. 2872, pp. 47\u201358. Springer, Heidelberg (2004)"},{"issue":"1","key":"20_CR21","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1109\/JSAC.2003.818784","volume":"22","author":"B Zhao","year":"2004","unstructured":"Zhao, B., Huang, L., Stribling, J., Rhea, S.C., Joseph, A.D., Kubiatowicz, J.D.: Tapestry: A resilient global-scale overlay for service deployment. IEEE J. Sel. Areas Commun. 22(1), 41\u201353 (2004)","journal-title":"IEEE J. Sel. Areas Commun."}],"container-title":["Lecture Notes in Computer Science","Applications of Evolutionary Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-31204-0_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T17:01:38Z","timestamp":1559408498000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-31204-0_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319312033","9783319312040"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-31204-0_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}