Modal logics for mobile processes
Selected papers of the 3rd workshop on Concurrency and compositionality
Secure information flow in a multi-threaded imperative language
POPL '98 Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The SLam calculus: programming with secrecy and integrity
POPL '98 Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
IEEE Transactions on Software Engineering
Trust and partial typing in open systems of mobile agents
Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Pict: a programming language based on the Pi-Calculus
Proof, language, and interaction
A sound type system for secure flow analysis
Journal of Computer Security
An Axiomatic Approach to Information Flow in Programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Certification of programs for secure information flow
Communications of the ACM
Resource access control in systems of mobile agents
Information and Computation
Communication and Concurrency
Secrecy by Typing inSecurity Protocols
TACS '97 Proceedings of the Third International Symposium on Theoretical Aspects of Computer Software
Non Interference for the Analysis of Cryptographic Protocols
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Non-Interference Through Determinism
ESORICS '94 Proceedings of the Third European Symposium on Research in Computer Security
Control Flow Analysis for the pi-calculus
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
On Asynchronous Communication Semantics
ECOOP '91 Proceedings of the Workshop on Object-Based Concurrent Computing
Graph Types for Monadic Mobile Processes
Proceedings of the 16th Conference on Foundations of Software Technology and Theoretical Computer Science
Testing Theories for Asynchronous Languages
Proceedings of the 18th Conference on Foundations of Software Technology and Theoretical Computer Science
Process Algebra and Non-interference
CSFW '99 Proceedings of the 12th IEEE workshop on Computer Security Foundations
A Classification of Security Properties
A Classification of Security Properties
Access control for mobile agents: The calculus of boxed ambients
ACM Transactions on Programming Languages and Systems (TOPLAS)
Stack-based access control and secure information flow
Journal of Functional Programming
Types and full abstraction for polyadic π-calculus
Information and Computation
Information flow in secure contexts
Journal of Computer Security
P-congruences as non-interference for the pi-calculus
Proceedings of the fourth ACM workshop on Formal methods in security
Classification of security properties in a Linda-like process algebra
Science of Computer Programming - Special issue on security issues in coordination models, languages, and systems
Information flow security in dynamic contexts
Journal of Computer Security
Controlling information release in the π-calculus
Information and Computation
State-oriented Noninterference for CCS
Electronic Notes in Theoretical Computer Science (ENTCS)
A type system for data-flow integrity on windows vista
Proceedings of the third ACM SIGPLAN workshop on Programming languages and analysis for security
Security types for dynamic web data
Theoretical Computer Science
A type system for data-flow integrity on Windows Vista
ACM SIGPLAN Notices
Formal Aspects in Security and Trust
A type system for discretionary access control†
Mathematical Structures in Computer Science
Tagged Systems: A Framework for the Specification of History-dependent Properties
Electronic Notes in Theoretical Computer Science (ENTCS)
Unwinding in Information Flow Security
Electronic Notes in Theoretical Computer Science (ENTCS)
Types and full abstraction for polyadic π-calculus
Information and Computation
Security types for dynamic web data
TGC'06 Proceedings of the 2nd international conference on Trustworthy global computing
Scalable formalization of publish/subscribe messaging scheme based on message brokers
WS-FM'07 Proceedings of the 4th international conference on Web services and formal methods
Dynamic resource reallocation between deployment components
ICFEM'10 Proceedings of the 12th international conference on Formal engineering methods and software engineering
Validating timed models of deployment components with parametric concurrency
FoVeOOS'10 Proceedings of the 2010 international conference on Formal verification of object-oriented software
A theory of noninterference for the π-calculus
TGC'05 Proceedings of the 1st international conference on Trustworthy global computing
Models of Rate Restricted Communication for Concurrent Objects
Electronic Notes in Theoretical Computer Science (ENTCS)
Using π-calculus to formalize domain administration of RBAC
ISPEC'06 Proceedings of the Second international conference on Information Security Practice and Experience
Non-disclosure for distributed mobile code
Mathematical Structures in Computer Science - Programming Language Interference and Dependence
Bridging language-based and process calculi security
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
Admissible interference by typing for cryptographic protocols
ICICS'05 Proceedings of the 7th international conference on Information and Communications Security
Dynamic access control in a concurrent object calculus
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
Security correctness for secure nested transactions: position paper
Proceedings of the 7th Workshop on Programming Languages and Analysis for Security
Addressing covert termination and timing channels in concurrent information flow systems
Proceedings of the 17th ACM SIGPLAN international conference on Functional programming
Information flow in systems with schedulers, Part I: Definitions
Theoretical Computer Science
| Hi-index | 0.00 |
We propose an extension of the asynchronous π-calculus in which a variety of security properties may be captured using types. These are an extension of the input/output types for the π-calculus in which I/O capabilities are assigned specific security levels. The main innovation is a uniform typing system that, by varying slightly the allowed set of types, captures different notions of security.We first define a typing system that ensures that processes running at security level σ cannot access resources with a security level higher than σ. The notion of access control guaranteed by this system is formalized in terms of a Type Safety Theorem.We then show that, by restricting the allowed types, our system prohibits implicit information flow from high-level to low-level processes. We prove that low-level behavior can not be influenced by changes to high-level behavior. This is formalized as a noninterference theorem with respect to may testing.