{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T04:03:54Z","timestamp":1760241834409,"version":"build-2065373602"},"reference-count":45,"publisher":"MDPI AG","issue":"9","license":[{"start":{"date-parts":[[2018,8,25]],"date-time":"2018-08-25T00:00:00Z","timestamp":1535155200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100004281","name":"Narodowe Centrum Nauki","doi-asserted-by":"publisher","award":["2014\/13\/B\/ST6\/01807"],"award-info":[{"award-number":["2014\/13\/B\/ST6\/01807"]}],"id":[{"id":"10.13039\/501100004281","id-type":"DOI","asserted-by":"publisher"}]},{"name":"R\u00e9gion Ile-de-France","award":["N\/A"],"award-info":[{"award-number":["N\/A"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information"],"abstract":"<jats:p>Networks are beneficial to those being connected but can also be used as carriers of contagious hostile attacks. These attacks are often facilitated by exploiting corrupt network users. To protect against the attacks, users can resort to costly defense. The decentralized nature of such protection is known to be inefficient, but the inefficiencies can be mitigated by a careful network design. Is network design still effective when not all users can be trusted? We propose a model of network design and defense with byzantine nodes to address this question. We study the optimal defended networks in the case of centralized defense and, for the case of decentralized defense, we show that the inefficiencies due to decentralization can be mitigated arbitrarily well when the number of nodes in the network is sufficiently large, despite the presence of the byzantine nodes.<\/jats:p>","DOI":"10.3390\/info9090214","type":"journal-article","created":{"date-parts":[[2018,8,27]],"date-time":"2018-08-27T10:56:04Z","timestamp":1535367364000},"page":"214","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Individual Security and Network Design with Malicious Nodes"],"prefix":"10.3390","volume":"9","author":[{"given":"Tomasz","family":"Janus","sequence":"first","affiliation":[{"name":"Institute of Informatics, University of Warsaw, Banacha 2, 02-097 Warsaw, Poland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mateusz","family":"Skomra","sequence":"additional","affiliation":[{"name":"CMAP, \u00c9cole Polytechnique, CNRS and INRIA, Route de Saclay, 91128 Palaiseau CEDEX, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marcin","family":"Dziubi\u0144ski","sequence":"additional","affiliation":[{"name":"Institute of Informatics, University of Warsaw, Banacha 2, 02-097 Warsaw, Poland"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2018,8,25]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1145\/2635673","article-title":"A survey of interdependent information security games","volume":"47","author":"Laszka","year":"2015","journal-title":"ACM Comput. Surv."},{"key":"ref_2","unstructured":"B\u00f6hme, R., and Schwartz, G. (2010, January 7\u20138). Modeling cyber-insurance: Towards a unifying framework. Proceedings of the 9th Workshop on the Economics of Information Security (WEIS 2010), Cambridge, MA, USA."},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Cerdeiro, D., Dziubi\u0144ski, M., and Goyal, S. (2014, January 9\u201312). Individual security and network design. Proceedings of the 15th ACM Conference on Economics and Computation (EC\u201914), Stanford, CA, USA.","DOI":"10.1145\/2600057.2602894"},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1016\/j.jet.2017.05.006","article-title":"Individual security, contagion, and network design","volume":"170","author":"Cerdeiro","year":"2017","journal-title":"J. Econom. Theory"},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Weaver, N., Paxson, V., Staniford, S., and Cunningham, R. (2003, January 27\u201330). A taxonomy of computer worms. Proceedings of Tenth ACM Conference on Computer and Communications Security 2003, Washington, DC, USA.","DOI":"10.1145\/948187.948190"},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Zou, C., Gong, W., and Towsley, D. (2002, January 18\u201322). Code red worm propagation modeling and analysis. Proceedings of the 9th ACM Conference on Computer and Communications Security, Washington, DC, USA.","DOI":"10.1145\/586110.586130"},{"key":"ref_7","unstructured":"Chen, Z., Gao, L., and Kwiat, K. (April, January 30). Modeling the spread of active worms. Proceedings of the Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE INFOCOM\u201903), San Francisco, CA, USA."},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Dainotti, A., Pescape, A., and Ventre, G. (2007, January 24\u201328). Worm Traffic Analysis and Characterization. Proceedings of the 2007 IEEE International Conference on Communications, Glasgow, Scotland.","DOI":"10.1109\/ICC.2007.241"},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Shapiro, C., and Varian, H. (2000). Information Rules: A Strategic Guide to the Network Economy, Harvard Business School Press.","DOI":"10.2307\/259025"},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Moscibroda, T., Schmid, S., and Wattenhofer, R. (2006, January 23\u201326). When selfish meets evil: Byzantine players in a virus inoculation game. Proceedings of the 25th ACM Symposium on Principles of Distributed Computing (PODC 2006), Denver, CO, USA.","DOI":"10.1145\/1146381.1146391"},{"key":"ref_11","first-page":"125","article-title":"The price of malice: A game-theoretic framework for malicious behavior","volume":"6","author":"Moscibroda","year":"2009","journal-title":"Int. Math."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/j.comcom.2016.12.010","article-title":"Q*: Energy and delay-efficient dynamic queue management in TCP\/IP virtualized data centers","volume":"102","author":"Baccarelli","year":"2017","journal-title":"Comput. Commun."},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Pooranian, Z., Chen, K., Yu, C., and Conti, M. (2018, January 15\u201319). RARE: Defeating side channels based on data-deduplication in cloud storage. Proceedings of the IEEE INFOCOM 2018\u2014IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS), Honolulu, HI, USA.","DOI":"10.1109\/INFCOMW.2018.8406888"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"894","DOI":"10.1049\/iet-com.2009.0191","article-title":"Security attacks and solutions for vehicular ad hoc networks","volume":"4","author":"Isaac","year":"2010","journal-title":"IET Commun."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/j.comcom.2018.03.014","article-title":"A collaborative approach for improving the security of vehicular scenarios: The case of platooning","volume":"122","author":"Petrillo","year":"2018","journal-title":"Comput. Commun."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"945","DOI":"10.3233\/JCS-2009-0350","article-title":"A cascade architecture for DoS attacks detection based on the wavelet transform","volume":"17","author":"Dainotti","year":"2009","journal-title":"J. Comput. Security"},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1109\/SURV.2009.090205","article-title":"Sensor network security: A survey","volume":"11","author":"Chen","year":"2009","journal-title":"IEEE Commun. Sur. Tutor."},{"key":"ref_18","unstructured":"Padmavathi, G., and Shanmugapriya, D. (arXiv, 2009). A survey of attacks, security mechanisms and challenges in wireless sensor networks, arXiv."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1016\/j.future.2015.11.026","article-title":"Secure group communication schemes for dynamic heterogeneous distributed computing","volume":"74","author":"Castiglione","year":"2017","journal-title":"Future Gener. Compute. Syst."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"10249","DOI":"10.1109\/TVT.2017.2756623","article-title":"A secure approach for caching contents in wireless ad hoc networks","volume":"66","author":"Kiskani","year":"2017","journal-title":"IEEE Trans. Veh. Tech."},{"key":"ref_21","doi-asserted-by":"crossref","unstructured":"Marti, S., Giuli, T., Lai, K., and Baker, M. (2000, January 6\u201311). Mitigating routing misbehavior in mobile ad hoc networks. Proceedings of the 6th Annual International Conference on Mobile Computing and Networking, Boston, MA, USA.","DOI":"10.1145\/345910.345955"},{"key":"ref_22","unstructured":"Jerman-Bla\u017ei\u010d, B., and Klobu\u010dar, T. (2002). Core: A Collaborative reputation mechanism to enforce node cooperation in mobile ad hoc networks. Advanced Communications and Multimedia Security: IFIP TC6\/TC11 Sixth Joint Working Conference on Communications and Multimedia Security, Springer."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1023\/A:1024600519144","article-title":"Intrusion detection techniques for mobile wireless networks","volume":"9","author":"Zhang","year":"2003","journal-title":"Wirel. Netw."},{"key":"ref_24","doi-asserted-by":"crossref","unstructured":"Castelluccia, C., Hartenstein, H., Paar, C., and Westhoff, D. (2005). Advanced detection of selfish or malicious nodes in ad hoc networks. Security in Ad-hoc and Sensor Networks, Springer.","DOI":"10.1007\/b105219"},{"key":"ref_25","doi-asserted-by":"crossref","unstructured":"Nasser, N., and Chen, Y. (2007, January 24\u201328). Enhanced intrusion detection system for discovering malicious nodes in mobile ad hoc networks. Proceedings of the 2007 IEEE International Conference on Communications, Glasgow, Scotland.","DOI":"10.1109\/ICC.2007.196"},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"579","DOI":"10.1023\/A:1025146013151","article-title":"Stimulating cooperation in self-organizing mobile ad hoc networks","volume":"8","author":"Hubaux","year":"2003","journal-title":"Mob. Netw. Appl."},{"key":"ref_27","unstructured":"Zhong, S., Chen, J., and Yang, Y. (April, January 30). Sprite: A simple, cheat-proof, credit-based system for mobile ad-hoc networks. Proceedings of the 22nd Annual Joint Conference of the IEEE Computer and Communications Societies, San Francisco, CA, USA."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1145\/2627534.2627536","article-title":"Multidefender security games on networks","volume":"41","author":"Smith","year":"2014","journal-title":"ACM SIGMETRICS Perform. Eval. Rev."},{"key":"ref_29","unstructured":"Lou, J., and Vorobeychik, Y. (2015, January 25\u201331). Equilibrium analysis of multidefender security games. Proceedings of the 24th International Conference on Artificial Intelligence (IJCAI\u201915), Buenos Aires, Argentina."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1109\/MIS.2017.11","article-title":"Multidefender security games","volume":"32","author":"Lou","year":"2017","journal-title":"IEEE Intell. Syst."},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1023\/A:1024119208153","article-title":"Interdependent security","volume":"26","author":"Kunreuther","year":"2003","journal-title":"J. Risk Uncertain."},{"key":"ref_32","doi-asserted-by":"crossref","unstructured":"Camp, L.J., and Lewis, S. (2004). System reliability and free riding. Economics of Information Security, Springer.","DOI":"10.1007\/b116816"},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"1077","DOI":"10.1016\/j.jcss.2006.02.003","article-title":"Inoculation strategies for victims of viruses and the sum-of-squares partition problem","volume":"72","author":"Aspnes","year":"2006","journal-title":"J. Comput. Syst. Sci."},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1145\/1384529.1375463","article-title":"Network externalities and the deployment of security features and protocols in the Internet","volume":"36","author":"Lelarge","year":"2008","journal-title":"ACM SIGMETRICS Perform. Eval. Rev."},{"key":"ref_35","doi-asserted-by":"crossref","unstructured":"Lelarge, M., and Bolot, J. (2008, January 17\u201322). A local mean field analysis of security investments in networks. Proceedings of the 3rd International Workshop on Economics of Networked Systems (NetEcon\u201908), Seattle, WA, USA.","DOI":"10.1145\/1403027.1403034"},{"key":"ref_36","unstructured":"Chan, H., Ceyko, M., and Ortiz, L. (arXiv, 2012). Interdependent defense games: modeling interdependent security under deliberate attacks, arXiv."},{"key":"ref_37","doi-asserted-by":"crossref","first-page":"536","DOI":"10.1016\/j.jet.2016.09.009","article-title":"Network security and contagion","volume":"166","author":"Acemoglu","year":"2016","journal-title":"J. Econom. Theory"},{"key":"ref_38","doi-asserted-by":"crossref","unstructured":"Gueye, A., Walrand, J., and Anantharam, V. (2010, January 22\u201323). Design of network topology in an adversarial environment. Proceedings of the 2010 Conference on Decision and Game Theory for Security (GameSec 2010), Berlin, Germany.","DOI":"10.1007\/978-3-642-17197-0_1"},{"key":"ref_39","unstructured":"Gueye, A., Walrand, J.C., and Anantharam, V. (2011, January 14\u201315). How to choose communication links in an adversarial environment?. Proceedings of the 2nd International Conference on Game Theory for Networks (GameNets 2011), College Park, MD, USA."},{"key":"ref_40","doi-asserted-by":"crossref","unstructured":"Gueye, A., Marbukh, V., and Walrand, J. (2012, January 5\u20136). Towards a metric for communication network vulnerability to attacks: A game theoretic approach. Proceedings of the 3rd International Conference on Game Theory for Networks (GameNets 2012), Budapest, Hungary.","DOI":"10.1007\/978-3-642-35582-0_20"},{"key":"ref_41","doi-asserted-by":"crossref","unstructured":"Laszka, A., Szeszl\u00e9r, D., and Butty\u00e1n, L. (2012, January 5\u20136). Game-theoretic robustness of many-to-one networks. Proceedings of the 3rd International Conference on Game Theory for Networks (GameNets 2012), Budapest, Hungary.","DOI":"10.1007\/978-3-642-35582-0_7"},{"key":"ref_42","doi-asserted-by":"crossref","unstructured":"Laszka, A., Szeszl\u00e9r, D., and Butty\u00e1n, L. (2012, January 5\u20136). Linear loss function for the network blocking game: An efficient model for measuring network robustness and link criticality. Proceedings of the 3rd International Conference on Game Theory for Networks (GameNets 2012), Budapest, Hungary.","DOI":"10.1007\/978-3-642-34266-0_9"},{"key":"ref_43","doi-asserted-by":"crossref","unstructured":"Goyal, S., Jabbari, S., Kearns, M., Khanna, S., and Morgenstern, J. (2016, January 11\u201314). Strategic network formation with attack and immunization. Proceedings of the 12th Conference on Web and Internet Economics (WINE 2016), Montreal, QC, Canada.","DOI":"10.1007\/978-3-662-54110-4_30"},{"key":"ref_44","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1007\/s10107-005-0686-0","article-title":"Robust game theory","volume":"107","author":"Aghassi","year":"2006","journal-title":"Math. Program."},{"key":"ref_45","doi-asserted-by":"crossref","unstructured":"Hiriart-Urruty, J.B., and Lemar\u00e9chal, C. (1993). Convex Analysis and Minimization Algorithms I: Fundamentals, Springer.","DOI":"10.1007\/978-3-662-02796-7"}],"container-title":["Information"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2078-2489\/9\/9\/214\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T15:21:09Z","timestamp":1760196069000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2078-2489\/9\/9\/214"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,8,25]]},"references-count":45,"journal-issue":{"issue":"9","published-online":{"date-parts":[[2018,9]]}},"alternative-id":["info9090214"],"URL":"https:\/\/doi.org\/10.3390\/info9090214","relation":{},"ISSN":["2078-2489"],"issn-type":[{"type":"electronic","value":"2078-2489"}],"subject":[],"published":{"date-parts":[[2018,8,25]]}}}