{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T15:35:59Z","timestamp":1753889759605,"version":"3.41.2"},"reference-count":20,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","license":[{"start":{"date-parts":[[2005,12,20]],"date-time":"2005-12-20T00:00:00Z","timestamp":1135036800000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/arxiv.org\/licenses\/nonexclusive-distrib\/1.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>We propose a simple global computing framework, whose main concern is code migration. Systems are structured in sites, and each site is divided into two parts: a computing body, and a membrane, which regulates the interactions between the computing body and the external environment. More precisely, membranes are filters which control access to the associated site, and they also rely on the well-established notion of trust between sites. We develop a basic theory to express and enforce security policies via membranes. Initially, these only control the actions incoming agents intend to perform locally. We then adapt the basic theory to encompass more sophisticated policies, where the number of actions an agent wants to perform, and also their order, are considered.<\/jats:p>","DOI":"10.2168\/lmcs-1(3:2)2005","type":"journal-article","created":{"date-parts":[[2006,11,23]],"date-time":"2006-11-23T09:25:23Z","timestamp":1164273923000},"source":"Crossref","is-referenced-by-count":8,"title":["Security Policies as Membranes in Systems for Global Computing"],"prefix":"10.46298","volume":"Volume 1, Issue 3","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8859-9844","authenticated-orcid":false,"given":"Daniele","family":"Gorla","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthew","family":"Hennessy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vladimiro","family":"Sassone","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"25203","published-online":{"date-parts":[[2005,12,20]]},"reference":[{"doi-asserted-by":"publisher","key":"10.2168\/LMCS-1(3:2)2005_amadio:modelling-mobility","DOI":"10.1016\/S0304-3975(99)00230-3"},{"key":"10.2168\/LMCS-1(3:2)2005_Bou04:membranes","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1007\/978-3-540-31794-4_11","volume":"3267","author":"G. Boudol","year":"2004","journal-title":"In Proc. of Global Computing, LNCS"},{"doi-asserted-by":"crossref","unstructured":"Z. Bouziane. A primitive recursive algorithm for the general Petri net reachability problem. InProc. of FOCS'98, pages 130-136. IEEE, 1998.","key":"10.2168\/LMCS-1(3:2)2005_primRecAlgorPetriNets","DOI":"10.1109\/SFCS.1998.743436"},{"doi-asserted-by":"publisher","key":"10.2168\/LMCS-1(3:2)2005_CG00:mobile-ambients","DOI":"10.1016\/S0304-3975(99)00231-5"},{"doi-asserted-by":"crossref","unstructured":"U. Erlingsson and F. Schneider. SASI Enforcement of Security Policies: A Retrospective. InProc. of New Security Paradigms Workshop, pages 87-95. ACM, 1999.","key":"10.2168\/LMCS-1(3:2)2005_ES99","DOI":"10.1145\/335169.335201"},{"doi-asserted-by":"publisher","key":"10.2168\/LMCS-1(3:2)2005_ferrari.moggi.pugliese.2003","DOI":"10.1017\/S0960129504004165"},{"doi-asserted-by":"crossref","unstructured":"C. Fournet, G. Gonthier, J. L\u00e9vy, L. Maranget, and D. R\u00e9my. A calculus of mobile agents. InProc. of CONCUR'96}, volume 1119 of {\\em LNCS, pages 406-421. Springer, 1996.","key":"10.2168\/LMCS-1(3:2)2005_fournet.gonthier.ea:calculus-mobile","DOI":"10.1007\/3-540-61604-7_67"},{"doi-asserted-by":"publisher","key":"10.2168\/LMCS-1(3:2)2005_concurRegExprPetri","DOI":"10.1016\/0304-3975(92)90339-H"},{"doi-asserted-by":"crossref","unstructured":"D. Gorla and M. Hennessy and V .Sassone. Security Policies as Membranes in Systems for Global Computing. InProc. of FGUC'04, ENTCS. Elsevier, 2004.","key":"10.2168\/LMCS-1(3:2)2005_GHS04:fguc","DOI":"10.2168\/LMCS-1(3:2)2005"},{"doi-asserted-by":"crossref","unstructured":"D. Gorla and R. Pugliese. Resource access and mobility control with dynamic privileges acquisition. InProc. of ICALP'03}, volume 2719 of {\\em LNCS, pages 119-132. Springer-Verlag, 2003.","key":"10.2168\/LMCS-1(3:2)2005_GP03:icalp","DOI":"10.1007\/3-540-45061-0_11"},{"doi-asserted-by":"publisher","key":"10.2168\/LMCS-1(3:2)2005_HenRie-IC02","DOI":"10.1006\/inco.2001.3089"},{"unstructured":"J. Hopcroft and J. Ullman.Introduction to automata theory, languages and computation. Addison-Wesley, 1979.","key":"10.2168\/LMCS-1(3:2)2005_Hopc.Ullm:intro"},{"doi-asserted-by":"crossref","unstructured":"A. Igarashi and N. Kobayashi. A generic type system for the pi-calculus. InProceedings of POPL '01, pages 128-141. ACM, 2001.","key":"10.2168\/LMCS-1(3:2)2005_igarashi.kobayashi:generic-type","DOI":"10.1145\/373243.360215"},{"doi-asserted-by":"publisher","key":"10.2168\/LMCS-1(3:2)2005_reachabilityPetri","DOI":"10.1137\/0213029"},{"unstructured":"R. Milner.A Calculus for Communicating Systems. Springer-Verlag, 1982.","key":"10.2168\/LMCS-1(3:2)2005_milner:CCS"},{"unstructured":"R. Milner.Communicating and Mobile Systems: the\\pi-Calculus. Cambridge University Press, 1999.","key":"10.2168\/LMCS-1(3:2)2005_milner:communicating-mobile"},{"unstructured":"N. Nguyen and J. Rathke. Typed Static Analysis for Concurrent, Policy-Based, Resource Access Control. Draft, 2005.","key":"10.2168\/LMCS-1(3:2)2005_NR04:typed-static-analysis"},{"unstructured":"J. Peterson.Petri Net Theory and Modeling of Systems. Prentice Hall, 1981.","key":"10.2168\/LMCS-1(3:2)2005_Peterson:PetriNetTheory"},{"doi-asserted-by":"publisher","key":"10.2168\/LMCS-1(3:2)2005_riely.hennessy:trust-partial","DOI":"10.1023\/B:JARS.0000021016.61054.3b"},{"doi-asserted-by":"crossref","unstructured":"A. Schmitt and J. Stefani. The M-calculus: a higher-order distributed process calculus. InProc. of POPL'03, pages 50-61. ACM, 2003.","key":"10.2168\/LMCS-1(3:2)2005_stefani:M-calculus","DOI":"10.1145\/604131.604136"}],"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/lmcs.episciences.org\/2262\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/lmcs.episciences.org\/2262\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,12]],"date-time":"2025-01-12T02:17:50Z","timestamp":1736648270000},"score":1,"resource":{"primary":{"URL":"https:\/\/lmcs.episciences.org\/2262"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,12,20]]},"references-count":20,"URL":"https:\/\/doi.org\/10.2168\/lmcs-1(3:2)2005","relation":{"is-same-as":[{"id-type":"arxiv","id":"cs\/0506061","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.cs\/0506061","asserted-by":"subject"}]},"ISSN":["1860-5974"],"issn-type":[{"type":"electronic","value":"1860-5974"}],"subject":[],"published":{"date-parts":[[2005,12,20]]},"article-number":"2262"}}