{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:52:05Z","timestamp":1725468725804},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540358930"},{"type":"electronic","value":"9783540359029"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11787181_27","type":"book-chapter","created":{"date-parts":[[2006,8,25]],"date-time":"2006-08-25T13:06:40Z","timestamp":1156511200000},"page":"374-387","source":"Crossref","is-referenced-by-count":3,"title":["On Lattices in Access Control Models"],"prefix":"10.1007","author":[{"given":"Sergei","family":"Obiedkov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Derrick G.","family":"Kourie","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J. H. P.","family":"Eloff","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"27_CR1","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1109\/2.241422","volume":"26","author":"R. Sandhu","year":"1993","unstructured":"Sandhu, R.: Lattice-based access control models. IEEE Computer\u00a026, 9\u201319 (1993)","journal-title":"IEEE Computer"},{"key":"27_CR2","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1145\/360051.360056","volume":"19","author":"D. Denning","year":"1976","unstructured":"Denning, D.: A lattice model of secure information flow. Comm. ACM\u00a019, 236\u2013243 (1976)","journal-title":"Comm. ACM"},{"key":"27_CR3","unstructured":"Biba, K.: Integrity considerations for secure computer systems. Report TR-3153, Mitre Corporation, Bedford, Mass. (1977)"},{"key":"27_CR4","volume-title":"Computer Security","author":"D. Gollmann","year":"1999","unstructured":"Gollmann, D.: Computer Security. John Wiley & Sons Ltd, Chichester (1999)"},{"key":"27_CR5","unstructured":"Bell, D., LaPadula, L.: Secure computer systems: Mathematical foundations and model. Report M74-244, Mitre Corporation, Bedford, Mass. (1975)"},{"key":"27_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-59830-2","volume-title":"Formal Concept Analysis: Mathematical Foundations","author":"B. Ganter","year":"1999","unstructured":"Ganter, B., Wille, R.: Formal Concept Analysis: Mathematical Foundations. Springer, Berlin (1999)"},{"key":"27_CR7","first-page":"2","volume-title":"Proc. IEEE Symp. Security and Privacy","author":"S. Lipner","year":"1982","unstructured":"Lipner, S.: Nondiscretionary controls for commercial applications. In: Proc. IEEE Symp. Security and Privacy, pp. 2\u201310. IEEE CS Press, Los Alamitos (1982)"},{"key":"27_CR8","unstructured":"Smith, G.: The Modeling and Representation of Security Semantics for Database Applications. PhD thesis, George Mason Univ. Fairfax, Va. (1990)"},{"key":"27_CR9","unstructured":"Birkhoff, G.: Lattice Theory. Amer. Math. Soc. Coll. Publ. Providence, R.I. (1973)"},{"key":"27_CR10","first-page":"5","volume":"95","author":"J.L. Guigues","year":"1986","unstructured":"Guigues, J.L., Duquenne, V.: Familles minimales d\u2019implications informatives resultant d\u2019un tableau de donn\u00e9es binaires. Math. Sci. Humaines\u00a095, 5\u201318 (1986)","journal-title":"Math. Sci. Humaines"},{"key":"27_CR11","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/S0304-3975(98)00271-0","volume":"217","author":"B. Ganter","year":"1999","unstructured":"Ganter, B.: Attribute exploration with background knowledge. Theoretical Computer Science\u00a0217, 215\u2013233 (1999)","journal-title":"Theoretical Computer Science"},{"key":"27_CR12","unstructured":"Ganter, B., Krausse, R.: Pseudo models and propositional horn inference. Technical Report MATH-AL-15-1999, Technische Universit\u00e4t Dresden, Germany (1999)"},{"key":"27_CR13","unstructured":"Ganter, B.: Two basic algorithms in concept analysis. Preprint Nr. 831, Technische Hochschule Darmstadt (1984)"}],"container-title":["Lecture Notes in Computer Science","Conceptual Structures: Inspiration and Application"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11787181_27.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:20:39Z","timestamp":1619508039000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11787181_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540358930","9783540359029"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/11787181_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}