{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,5]],"date-time":"2025-04-05T11:06:54Z","timestamp":1743851214443},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662439357"},{"type":"electronic","value":"9783662439364"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-43936-4_8","type":"book-chapter","created":{"date-parts":[[2014,6,27]],"date-time":"2014-06-27T12:05:04Z","timestamp":1403870704000},"page":"114-129","source":"Crossref","is-referenced-by-count":8,"title":["Toward Software Diversity in Heterogeneous Networked Systems"],"prefix":"10.1007","author":[{"given":"Chu","family":"Huang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sencun","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert","family":"Erbacher","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"8_CR1","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1109\/MSP.2009.11","volume":"7","author":"J.H. Lala","year":"2009","unstructured":"Lala, J.H., Schneider, F.B.: It monoculture security risks and defenses. IEEE Security & Privacy\u00a07(1), 12\u201313 (2009)","journal-title":"IEEE Security & Privacy"},{"issue":"3","key":"8_CR2","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/971617.971650","volume":"47","author":"M. Stamp","year":"2004","unstructured":"Stamp, M.: Risks of monoculture. Communications of the ACM\u00a047(3), 120 (2004)","journal-title":"Communications of the ACM"},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"Zhang, Y., Vin, H., Alvisi, L., Lee, W., Dao, S.K.: Heterogeneous networking: a new survivability paradigm. In: Proceedings of the 2001 Workshop on New Security Paradigms, pp. 33\u201339. ACM (2001)","DOI":"10.1145\/508176.508177"},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"Yang, Y., Zhu, S., Cao, G.: Improving sensor network immunity under worm attacks: a software diversity approach. In: Proceedings of the 9th ACM International Symposium on Mobile Ad Hoc Networking and Computing, pp. 149\u2013158. ACM (2008)","DOI":"10.1145\/1374618.1374640"},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"O\u2019Donnell, A.J., Sethu, H.: On achieving software diversity for improved network security using distributed coloring algorithms. In: Proceedings of the 11th ACM Conference on Computer and Communications Security, pp. 121\u2013131. ACM (2004)","DOI":"10.1145\/1030083.1030101"},{"key":"8_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/978-3-642-02918-9_8","volume-title":"Detection of Intrusions and Malware, and Vulnerability Assessment","author":"J. Han","year":"2009","unstructured":"Han, J., Gao, D., Deng, R.H.: On the effectiveness of software diversity: A systematic study on real-world vulnerabilities. In: Flegel, U., Bruschi, D. (eds.) DIMVA 2009. LNCS, vol.\u00a05587, pp. 127\u2013146. Springer, Heidelberg (2009)"},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"Snow, K.Z., Monrose, F., Davi, L., Dmitrienko, A., Liebchen, C., Sadeghi, A.R.: Just-in-time code reuse: On the effectiveness of fine-grained address space layout randomization. In: 2013 IEEE Symposium on Security and Privacy (SP), pp. 574\u2013588. IEEE (2013)","DOI":"10.1109\/SP.2013.45"},{"key":"8_CR8","unstructured":"Giuffrida, C., Kuijsten, A., Tanenbaum, A.S.: Enhanced operating system security through efficient and fine-grained address space randomization. In: USENIX Security Symposium (2012)"},{"key":"8_CR9","doi-asserted-by":"crossref","unstructured":"Davi, L.V., Dmitrienko, A., N\u00fcrnberger, S., Sadeghi, A.R.: Gadge me if you can: secure and efficient ad-hoc instruction-level randomization for x86 and arm. In: Proceedings of the 8th ACM SIGSAC Symposium on Information, Computer and Communications Security, pp. 299\u2013310. ACM (2013)","DOI":"10.1145\/2484313.2484351"},{"key":"8_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/978-3-642-22424-9_12","volume-title":"Detection of Intrusions and Malware, and Vulnerability Assessment","author":"P. Philippaerts","year":"2011","unstructured":"Philippaerts, P., Younan, Y., Muylle, S., Piessens, F., Lachmund, S., Walter, T.: Code pointer masking: Hardening applications against code injection attacks. In: Holz, T., Bos, H. (eds.) DIMVA 2011. LNCS, vol.\u00a06739, pp. 194\u2013213. Springer, Heidelberg (2011)"},{"key":"8_CR11","doi-asserted-by":"crossref","unstructured":"Jafarian, J.H., Al-Shaer, E., Duan, Q.: Openflow random host mutation: transparent moving target defense using software defined networking. In: Proceedings of the First Workshop on Hot Topics in Software Defined Networks, pp. 127\u2013132. ACM (2012)","DOI":"10.1145\/2342441.2342467"},{"key":"8_CR12","doi-asserted-by":"crossref","unstructured":"Salamat, B., Jackson, T., Gal, A., Franz, M.: Orchestra: intrusion detection using parallel execution and monitoring of program variants in user-space. In: Proceedings of the 4th ACM European Conference on Computer Systems, pp. 33\u201346. ACM (2009)","DOI":"10.1145\/1519065.1519071"},{"key":"8_CR13","unstructured":"Jensen, T.R., Toft, B.: Graph coloring problems, vol.\u00a039. John Wiley & Sons (2011)"},{"key":"8_CR14","doi-asserted-by":"crossref","unstructured":"Chang, R.Y., Tao, Z., Zhang, J., Kuo, C.C.: A graph approach to dynamic fractional frequency reuse (ffr) in multi-cell ofdma networks. In: IEEE International Conference on Communications, ICC 2009, pp. 1\u20136. IEEE (2009)","DOI":"10.1109\/ICC.2009.5198612"},{"issue":"1","key":"8_CR15","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/0012-365X(93)90579-I","volume":"120","author":"M. Voigt","year":"1993","unstructured":"Voigt, M.: List colourings of planar graphs. Discrete Mathematics\u00a0120(1), 215\u2013219 (1993)","journal-title":"Discrete Mathematics"},{"issue":"1","key":"8_CR16","first-page":"1","volume":"62","author":"M. Hujter","year":"1993","unstructured":"Hujter, M., Tuza, Z.: Precoloring extension. ii. Graph classes related to bipartite graphs. Acta Mathematica Universitatis Comenianae\u00a062(1), 1\u201311 (1993)","journal-title":"Acta Mathematica Universitatis Comenianae"},{"issue":"1","key":"8_CR17","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/j.tcs.2005.09.028","volume":"349","author":"A.A. Bulatov","year":"2005","unstructured":"Bulatov, A.A.: H-coloring dichotomy revisited. Theoretical Computer Science\u00a0349(1), 31\u201339 (2005)","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"8_CR18","doi-asserted-by":"publisher","first-page":"161","DOI":"10.7151\/dmgt.1049","volume":"17","author":"Z. Tuza","year":"1997","unstructured":"Tuza, Z.: Graph colorings with local constraints-a survey. Discussiones Mathematicae Graph Theory\u00a017(2), 161\u2013228 (1997)","journal-title":"Discussiones Mathematicae Graph Theory"},{"key":"8_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2011.11.010","volume":"418","author":"A. Borodin","year":"2012","unstructured":"Borodin, A., Ivan, I., Ye, Y., Zimny, B.: On sum coloring and sum multi-coloring for restricted families of graphs. Theoretical Computer Science\u00a0418, 1\u201313 (2012)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"8_CR20","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1093\/comjnl\/10.1.85","volume":"10","author":"D.J. Welsh","year":"1967","unstructured":"Welsh, D.J., Powell, M.B.: An upper bound for the chromatic number of a graph and its application to timetabling problems. The Computer Journal\u00a010(1), 85\u201386 (1967)","journal-title":"The Computer Journal"},{"issue":"1","key":"8_CR21","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/BF02122551","volume":"8","author":"B. Bollob\u00e1s","year":"1988","unstructured":"Bollob\u00e1s, B.: The chromatic number of random graphs. Combinatorica\u00a08(1), 49\u201355 (1988)","journal-title":"Combinatorica"},{"key":"8_CR22","unstructured":"Scale-free networks, \n                  \n                    https:\/\/en.wikipedia.org\/wiki\/Scale-free_network"},{"key":"8_CR23","doi-asserted-by":"crossref","unstructured":"Premo, L.: Local extinctions, connectedness, and cultural evolution in structured populations. Advances in Complex Systems 15(01n02) (2012)","DOI":"10.1142\/S0219525911003268"},{"key":"8_CR24","doi-asserted-by":"crossref","unstructured":"Jackson, T., Salamat, B., Homescu, A., Manivannan, K., Wagner, G., Gal, A., Brunthaler, S., Wimmer, C., Franz, M.: Compiler-generated software diversity. In: Moving Target Defense, pp. 77\u201398. Springer (2011)","DOI":"10.1007\/978-1-4614-0977-9_4"}],"container-title":["Lecture Notes in Computer Science","Data and Applications Security and Privacy XXVIII"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-43936-4_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T04:41:42Z","timestamp":1558932102000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-43936-4_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662439357","9783662439364"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-43936-4_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}