Game semantics for access control

DOI10.1016/J.ENTCS.2009.07.088MaRDI QIDQ2805155zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Samson Abramsky, Radha Jagadeesan

Publication date 10 May 2016

Published in Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1401.5325

zbMATH Keywords

game semanticsaccess controldependency analysisauthorization logic

Mathematics Subject Classification ID

Applications of game theory (91A80) Logic in computer science (03B70) Semantics in the theory of computing (68Q55)

Abstract: We introduce a semantic approach to the study of logics for access control and dependency analysis, based on Game Semantics. We use a variant of AJM games with explicit justification (but without pointers). Based on this, we give a simple and intuitive model of the information flow constraints underlying access control. This is used to give strikingly simple proofs of emph{non-interference theorems} in robust, semantic versions.

Recommendations

• A system-level game semantics
• scientific article; zbMATH DE number 2110612
• Static Analysis
• Game semantics in the nominal model
• A Modal Deconstruction of Access Control Logics

Cites work

• scientific article; zbMATH DE number 1670817 (Why is no real title available?)
• scientific article; zbMATH DE number 2185654 (Why is no real title available?)
• scientific article; zbMATH DE number 1241697 (Why is no real title available?)
• scientific article; zbMATH DE number 1241700 (Why is no real title available?)
• scientific article; zbMATH DE number 1259144 (Why is no real title available?)
• scientific article; zbMATH DE number 1324438 (Why is no real title available?)
• scientific article; zbMATH DE number 2079039 (Why is no real title available?)
• scientific article; zbMATH DE number 1848312 (Why is no real title available?)
• scientific article; zbMATH DE number 2110612 (Why is no real title available?)
• A Modal Deconstruction of Access Control Logics
• A linear logic of authorization and knowledge
• Access control in a core calculus of dependency
• Automata, Languages and Programming
• Foundations of Software Science and Computation Structures
• Foundations of Software Science and Computational Structures
• Full abstraction for PCF
• Full abstraction for nominal general references
• Games and full completeness for multiplicative linear logic
• Linear logic
• Monad as modality
• Notions of computation and monads
• On full abstraction for PCF: I, II and III
• On-the-Fly Techniques for Game-Based Software Model Checking
• Payoffs, intensionality and abstraction in games
• Polarized games
• Relating categorical semantics for intuitionistic linear logic
• Variations in Access Control Logic

Cited in

(9)

• Axiomatizations of Banzhaf permission values for games with a permission structure
• Noninterference in a predicative polymorphic calculus for access control
• A system-level game semantics
• Imperfect information in logic and concurrent games
• Payoffs, intensionality and abstraction in games
• Games for dependent types
• Non-zero-sum cooperative access control game model with user trust and permission risk
• Game semantics for dependent types
• Disentangling parallelism and interference in game semantics

This page was built for publication: Game semantics for access control

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2805155)