{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,31]],"date-time":"2025-12-31T20:08:34Z","timestamp":1767211714060},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2004,11,1]],"date-time":"2004-11-01T00:00:00Z","timestamp":1099267200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IJIS"],"published-print":{"date-parts":[[2004,11]]},"DOI":"10.1007\/s10207-004-0044-x","type":"journal-article","created":{"date-parts":[[2004,11,5]],"date-time":"2004-11-05T13:22:51Z","timestamp":1099660971000},"page":"70-85","source":"Crossref","is-referenced-by-count":13,"title":["A graph-theoretical model of computer security"],"prefix":"10.1007","volume":"3","author":[{"given":"Mark","family":"Burgess","sequence":"first","affiliation":[]},{"given":"Geoffrey","family":"Canright","sequence":"additional","affiliation":[]},{"given":"Kenth","family":"Eng\u00f8-Monsen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2004,11,1]]},"reference":[{"key":"44_CR1","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1109\/TC.1981.1675753","volume":"30","author":"Snyder","year":"1981","unstructured":"Snyder L (1981) Formal models of capability-based protection systems. IEEE Trans Comput 30:172","journal-title":"IEEE Trans Comput"},{"key":"44_CR2","doi-asserted-by":"crossref","unstructured":"Moser LE (1987) Graph homomorphisms and the design of secure computer systems. In: Proceedings of the symposium on security and privacy. IEEE Press, New York, p 89","DOI":"10.1109\/SP.1987.10025"},{"key":"44_CR3","doi-asserted-by":"crossref","unstructured":"Williams JC (1987) A graph theoretic formulation of multilevel secure distributed systems: an overview. In: Proceedings of the symposium on security and privacy. IEEE Press, New York, p 97","DOI":"10.1109\/SP.1987.10026"},{"key":"44_CR4","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1145\/316194.316229","volume":"29","author":"Faloutsos","year":"1999","unstructured":"Faloutsos M, Faloutsos P, Faloutsos C (1999) On power-law relationships of the internet topology. Comput Commun Rev 29:251","journal-title":"Comput Commun Rev"},{"key":"44_CR5","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/S0378-4371(00)00018-2","volume":"281","author":"Barab","year":"2000","unstructured":"Barab\u00e1si AL, Albert R, Jeong H (2000) Scale-free characteristics of random networks: topology of the world-wide web. Physica A 281:69","journal-title":"Physica A"},{"key":"44_CR6","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"Barab","year":"1999","unstructured":"Barab\u00e1si AL, Albert R (1999) Emergence of scaling in random networks. Science 286:509","journal-title":"Science"},{"key":"44_CR7","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1038\/43601","volume":"401","author":"Albert","year":"1999","unstructured":"Albert R, Jeong H, Barab\u00e1si AL (1999) Diameter of the world-wide web. Nature 401:130","journal-title":"Nature"},{"key":"44_CR8","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1038\/43604","volume":"401","author":"Huberman","year":"1999","unstructured":"Huberman B, Adamic A (1999) Growth dynamics of the world-wide web. Nature 401:131","journal-title":"Nature"},{"key":"44_CR9","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1103\/RevModPhys.74.47","volume":"74","author":"Albert","year":"2002","unstructured":"Albert R, Barab\u00e1si A (2002) Statistical mechanics of complex networks. Rev Mod Phys 74:47","journal-title":"Rev Mod Phys"},{"key":"44_CR10","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1137\/S0895480193243274","volume":"9","author":"Kao","year":"1996","unstructured":"Kao MY (1996) Data security equals graph connectivity. SIAM J Discrete Math 9:87","journal-title":"SIAM J Discrete Math"},{"key":"44_CR11","doi-asserted-by":"crossref","first-page":"026118","DOI":"10.1103\/PhysRevE.64.026118","volume":"64","author":"Newman","year":"2001","unstructured":"Newman MEJ, Strogatz SH, Watts DJ (2001) Random graphs with arbitrary degree distributions and their applications. Phys Rev E 64:026118","journal-title":"Phys Rev E"},{"key":"44_CR12","doi-asserted-by":"crossref","unstructured":"Brewer D, Nash M (1989) The chinese wall security policy. In: Proceedings of the IEEE symposium on security and privacy. IEEE Press, New York, p 206","DOI":"10.1109\/SECPRI.1989.36295"},{"key":"44_CR13","doi-asserted-by":"crossref","unstructured":"Burgess M (2004) Analytical network and system administration \u2013 managing human-computer systems. Wiley, Chichester","DOI":"10.1002\/047086107X"},{"key":"44_CR14","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1017\/S0963548398003526","volume":"7","author":"Molloy","year":"1998","unstructured":"Molloy M, Reed B (1998) The size of the giant component of a random graph with a given degree sequence. Combinator Probabil Comput 7:295","journal-title":"Combinator Probabil Comput"},{"key":"44_CR15","doi-asserted-by":"crossref","first-page":"1170","DOI":"10.1086\/228631","volume":"92","author":"Bonacich","year":"1987","unstructured":"Bonacich P (1987) Power and centrality: a family of measures. Am J Sociol 92:1170\u20131182","journal-title":"Am J Sociol"},{"key":"44_CR16","unstructured":"Canright G, Weltzien \u00c5 (2003) Multiplex structure of the communications network in a small working group. In: Proceedings of the international Sunbelt Social Network conference XXIII, Cancun, Mexico"},{"key":"44_CR17","doi-asserted-by":"crossref","unstructured":"Canright G, Eng\u00f8-Monsen K (2004) A natural definition of clusters and roles in undirected graphs. Sci Comput Programm (in press)","DOI":"10.1016\/j.scico.2003.12.008"},{"key":"44_CR18","unstructured":"Burgess M, Canright G, Hassel Stang T, Pourbayat F, Engo K, Weltzien \u00c5 (2003) Archipelago: a network security analysis tool. Iin: Proceedings of the 17th conference on systems administration (LISA XVII), USENIX Association, Berkeley, CA, p 153"},{"key":"44_CR19","unstructured":"Burgess M (2000) Theoretical system administration. In: Proceedings of the 14th conference on systems administration (LISA XIV), USENIX Association, Berkeley, CA, p 1"}],"container-title":["International Journal of Information Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10207-004-0044-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10207-004-0044-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10207-004-0044-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,3]],"date-time":"2020-04-03T20:20:32Z","timestamp":1585945232000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10207-004-0044-x"}},"subtitle":["From file sharing to social engineering"],"short-title":[],"issued":{"date-parts":[[2004,11]]},"references-count":19,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2004,11]]}},"alternative-id":["44"],"URL":"https:\/\/doi.org\/10.1007\/s10207-004-0044-x","relation":{},"ISSN":["1615-5262","1615-5270"],"issn-type":[{"value":"1615-5262","type":"print"},{"value":"1615-5270","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004,11]]}}}