%0 Conference Proceedings
%T Type Checking Privacy Policies in the π-calculus
%+ Imperial College London
%+ University of Glasgow
%+ University of Cyprus [Nicosia] (UCY)
%A Kouzapas, Dimitrios
%A Philippou, Anna
%Z Part 4: Security
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 35th International Conference on Formal Techniques for Distributed Objects, Components, and Systems (FORTE)
%C Grenoble, France
%Y Susanne Graf
%Y Mahesh Viswanathan
%I Springer International Publishing
%3 Formal Techniques for Distributed Objects, Components, and Systems
%V LNCS-9039
%P 181-195
%8 2015-06-02
%D 2015
%R 10.1007/978-3-319-19195-9_12
%K Access Control
%K Privacy Policy
%K Smart Card
%K Policy Language
%K Private Data
%Z Computer Science [cs]
%Z Computer Science [cs]/Networking and Internet Architecture [cs.NI]Conference papers
%X In this paper we propose a formal framework for studying privacy. Our framework is based on the π-calculus with groups accompanied by a type system for capturing privacy requirements relating to information collection, information processing and information dissemination. The framework incorporates a privacy policy language. We show that a system respects a privacy policy if the typing of the system is compatible with the policy. We illustrate our methodology via analysis of privacy-aware schemes proposed for electronic traffic pricing.
%G English
%Z TC 6
%Z WG 6.1
%2 https://inria.hal.science/hal-01767337/document
%2 https://inria.hal.science/hal-01767337/file/978-3-319-19195-9_12_Chapter.pdf
%L hal-01767337
%U https://inria.hal.science/hal-01767337
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-WG
%~ IFIP-TC6
%~ IFIP-WG6-1
%~ IFIP-FORTE
%~ IFIP-LNCS-9039