@InProceedings{Broberg:Sands:ESOP06,
  author = 	 {N. Broberg and David Sands},
  title = 	 {Flow Locks: Towards a core calculus for Dynamic Flow Policies},
  booktitle = 	 {Programming Languages and Systems. 15th European Symposium on Programming, ESOP 2006},
  year =	 2006,
  volume = {3924},
  series = {LNCS},
  abstract = {Security is rarely a static notion. What is considered to be
  confidential or untrusted data varies over time according to
  changing events and states. The static verification of secure
  information flow has been a popular theme in recent programming
  language research, but information flow policies considered are
  based on multilevel security which presents a static view of
  security levels. In this paper we introduce a very simple mechanism
  for specifying dynamic information flow policies, flow locks, which
  specify conditions under which data may be read by a certain
  actor. The interface between the policy and the code is via
  instructions which open and close flow locks. We present a type and
  effect system for an ML-like language with references which permits
  the completely static verification of flow lock policies, and prove
  that the system satisfies a semantic security property generalising
  noninterference. We show that this simple mechanism can represent a
  number of recently proposed information flow paradigms for
  declassification.},
    url_Paper = {http://www.cse.chalmers.se/~dave/papers/Broberg-Sands-ESOP06.pdf},
  publisher = {Springer Verlag}    
}

{"_id":"R7dXTJd9Jq5RoSy6Y","bibbaseid":"broberg-sands-flowlockstowardsacorecalculusfordynamicflowpolicies-2006","downloads":0,"creationDate":"2017-02-03T08:24:26.813Z","title":"Flow Locks: Towards a core calculus for Dynamic Flow Policies","author_short":["Broberg, N.","Sands, D."],"year":2006,"bibtype":"inproceedings","biburl":"http://www.cse.chalmers.se/~dave/davewww2016.bib","bibdata":{"bibtype":"inproceedings","type":"inproceedings","author":[{"firstnames":["N."],"propositions":[],"lastnames":["Broberg"],"suffixes":[]},{"firstnames":["David"],"propositions":[],"lastnames":["Sands"],"suffixes":[]}],"title":"Flow Locks: Towards a core calculus for Dynamic Flow Policies","booktitle":"Programming Languages and Systems. 15th European Symposium on Programming, ESOP 2006","year":"2006","volume":"3924","series":"LNCS","abstract":"Security is rarely a static notion. What is considered to be confidential or untrusted data varies over time according to changing events and states. The static verification of secure information flow has been a popular theme in recent programming language research, but information flow policies considered are based on multilevel security which presents a static view of security levels. In this paper we introduce a very simple mechanism for specifying dynamic information flow policies, flow locks, which specify conditions under which data may be read by a certain actor. The interface between the policy and the code is via instructions which open and close flow locks. We present a type and effect system for an ML-like language with references which permits the completely static verification of flow lock policies, and prove that the system satisfies a semantic security property generalising noninterference. We show that this simple mechanism can represent a number of recently proposed information flow paradigms for declassification.","url_paper":"http://www.cse.chalmers.se/~dave/papers/Broberg-Sands-ESOP06.pdf","publisher":"Springer Verlag","bibtex":"@InProceedings{Broberg:Sands:ESOP06,\n author = \t {N. Broberg and David Sands},\n title = \t {Flow Locks: Towards a core calculus for Dynamic Flow Policies},\n booktitle = \t {Programming Languages and Systems. 15th European Symposium on Programming, ESOP 2006},\n year =\t 2006,\n volume = {3924},\n series = {LNCS},\n abstract = {Security is rarely a static notion. What is considered to be\n confidential or untrusted data varies over time according to\n changing events and states. The static verification of secure\n information flow has been a popular theme in recent programming\n language research, but information flow policies considered are\n based on multilevel security which presents a static view of\n security levels. In this paper we introduce a very simple mechanism\n for specifying dynamic information flow policies, flow locks, which\n specify conditions under which data may be read by a certain\n actor. The interface between the policy and the code is via\n instructions which open and close flow locks. We present a type and\n effect system for an ML-like language with references which permits\n the completely static verification of flow lock policies, and prove\n that the system satisfies a semantic security property generalising\n noninterference. We show that this simple mechanism can represent a\n number of recently proposed information flow paradigms for\n declassification.},\n url_Paper = {http://www.cse.chalmers.se/~dave/papers/Broberg-Sands-ESOP06.pdf},\n publisher = {Springer Verlag} \n}\n\n","author_short":["Broberg, N.","Sands, D."],"key":"Broberg:Sands:ESOP06","id":"Broberg:Sands:ESOP06","bibbaseid":"broberg-sands-flowlockstowardsacorecalculusfordynamicflowpolicies-2006","role":"author","urls":{" paper":"http://www.cse.chalmers.se/~dave/papers/Broberg-Sands-ESOP06.pdf"},"downloads":0},"search_terms":["flow","locks","towards","core","calculus","dynamic","flow","policies","broberg","sands"],"keywords":[],"authorIDs":[],"dataSources":["SBHWXKotbthoEYKJv"]}