{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T01:50:16Z","timestamp":1729648216038,"version":"3.28.0"},"reference-count":25,"publisher":"IEEE Comput. Soc","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/csfw.2002.1021825","type":"proceedings-article","created":{"date-parts":[[2005,8,24]],"date-time":"2005-08-24T23:23:34Z","timestamp":1124925814000},"page":"288","source":"Crossref","is-referenced-by-count":18,"title":["Information flow ecurity in dynamic contexts"],"prefix":"10.1109","author":[{"given":"R.","family":"Focardi","sequence":"first","affiliation":[]},{"given":"S.","family":"Rossi","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48119-2_44"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/SP.1982.10014"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(90)90025-D"},{"key":"ref13","first-page":"264","article-title":"Online minimization of transition systems","author":"lee","year":"1992","journal-title":"Proc of the 24th ACM Symposium on Theory of Computing (STOC'92)"},{"key":"ref14","article-title":"Defining information flow","author":"lowe","year":"1999","journal-title":"Technical Report 1999\/3"},{"journal-title":"Communication and Concurrency","year":"1989","author":"milner","key":"ref15"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/S1571-0661(05)80257-9"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1137\/0216062"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/CSFW.1997.596788"},{"key":"ref19","doi-asserted-by":"crossref","first-page":"75","DOI":"10.3233\/JCS-2001-91-204","article-title":"Process algebra and noninterference","volume":"9","author":"ryan","year":"2001","journal-title":"Journal of Computer Security"},{"key":"ref4","first-page":"96","article-title":"Symbolic bisimulation minimization","author":"bouali","year":"1992","journal-title":"Proc of International Conference on Computer Aided Verification (CAV'92) volume 663 of LNCS"},{"key":"ref3","article-title":"Primitives for Authentication in Process Algebras","author":"bodei","year":"2001","journal-title":"Theoretical Computer Science"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/CSFW.2001.930150"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44585-4_8"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45608-2_6"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/32.629493"},{"key":"ref2","article-title":"Secure computer systems: Unified exposition and multics interpretation","author":"bell","year":"1976","journal-title":"Technical Report ESD-TR-75–306 MITRE Corp MTR-2997"},{"key":"ref9","first-page":"744","article-title":"Non Interference for the Analysis of Cryptographic Protocols","author":"focardi","year":"2000","journal-title":"Proc of International Colloquium on Automata Languages and Programming (ICALP'00) volume 1853 of LNCS"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/324133.324266"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/CSFW.2000.856937"},{"key":"ref22","first-page":"119","article-title":"Analysis of a Fair Exchange Protocol","author":"shmatikov","year":"2000","journal-title":"Proc of 7th Annual Symposium on Network and Distributed System Security (NDSS 2000)"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/32.713329"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1994.1028"},{"key":"ref23","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1145\/268946.268975","article-title":"Secure Information Flow in a Multi-threaded Imperative Language","author":"smith","year":"1998","journal-title":"Proc of 25th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL98)"},{"key":"ref25","first-page":"149","article-title":"Modal and Temporal Logics for Processes","author":"stirling","year":"1996","journal-title":"Logics for Concurrency Structures versus Automata volume 1043 of LNCS"}],"event":{"name":"15th IEEE Computer Security Foundations Workshop CSFW-15","acronym":"CSFW-02","location":"Cape Breton, NS, Canada"},"container-title":["Proceedings 15th IEEE Computer Security Foundations Workshop. CSFW-15"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/7957\/21985\/01021825.pdf?arnumber=1021825","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,16]],"date-time":"2017-06-16T18:55:52Z","timestamp":1497639352000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1021825\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":25,"URL":"https:\/\/doi.org\/10.1109\/csfw.2002.1021825","relation":{},"subject":[]}}