Dimitrios Kouzapas ; Anna Philippou - Privacy by typing in the $\pi$-calculus

lmcs:4152 - Logical Methods in Computer Science, December 20, 2017, Volume 13, Issue 4 - https://doi.org/10.23638/LMCS-13(4:27)2017
Privacy by typing in the $\pi$-calculusArticle

Authors: Dimitrios Kouzapas ORCID; Anna Philippou

In this paper we propose a formal framework for studying privacy in information systems. The proposal follows a two-axes schema where the first axis considers privacy as a taxonomy of rights and the second axis involves the ways an information system stores and manipulates information. We develop a correspondence between the above schema and an associated model of computation.
In particular, we propose the \Pcalc, a calculus based on the $\pi$-calculus with groups extended with constructs for reasoning about private data. The privacy requirements of an information system are captured via a privacy policy language. The correspondence between the privacy model and the \Pcalc semantics is established using a type system for the calculus and a satisfiability definition between types and privacy policies. We deploy a type preservation theorem to show that a system respects a policy and it is safe if the typing of the system satisfies the policy. We illustrate our methodology via analysis of two use cases: a privacy-aware scheme for electronic traffic pricing and a privacy-preserving technique for speed-limit enforcement.

Comment: 43 pages


Volume: Volume 13, Issue 4
Secondary volumes: Selected Papers of the 35th International Conference on Formal Techniques for Distributed Objects, Components and Systems and the 17th International Conference on Coordination Models and Languages (FORTE and COORDINATION 2015)
Published on: December 20, 2017
Imported on: December 20, 2017
Keywords: Computer Science - Logic in Computer Science, Computer Science - Cryptography and Security

Classifications

Mathematics Subject Classification 20201

2 Documents citing this article

Consultation statistics

This page has been seen 2116 times.
This article's PDF has been downloaded 648 times.