{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T01:27:25Z","timestamp":1772242045077,"version":"3.50.1"},"reference-count":0,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","license":[{"start":{"date-parts":[[2017,12,20]],"date-time":"2017-12-20T00:00:00Z","timestamp":1513728000000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/arxiv.org\/licenses\/nonexclusive-distrib\/1.0"},{"start":{"date-parts":[[2017,12,20]],"date-time":"2017-12-20T00:00:00Z","timestamp":1513728000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/arxiv.org\/licenses\/nonexclusive-distrib\/1.0"},{"start":{"date-parts":[[2017,12,20]],"date-time":"2017-12-20T00:00:00Z","timestamp":1513728000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/arxiv.org\/licenses\/nonexclusive-distrib\/1.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"accepted":{"date-parts":[[2025,3,31]]},"abstract":"<jats:p>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.<\/jats:p>\n                  <jats:p>Comment: 43 pages<\/jats:p>","DOI":"10.23638\/lmcs-13(4:27)2017","type":"journal-article","created":{"date-parts":[[2025,4,3]],"date-time":"2025-04-03T13:35:44Z","timestamp":1743687344000},"source":"Crossref","is-referenced-by-count":1,"title":["Privacy by typing in the $\\pi$-calculus"],"prefix":"10.23638","volume":"Volume 13, Issue 4","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9300-0146","authenticated-orcid":false,"given":"Dimitrios","family":"Kouzapas","sequence":"first","affiliation":[]},{"given":"Anna","family":"Philippou","sequence":"additional","affiliation":[]}],"member":"25203","published-online":{"date-parts":[[2017,12,20]]},"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/arxiv.org\/pdf\/1710.06494v2","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/arxiv.org\/pdf\/1710.06494v2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,3]],"date-time":"2025-04-03T13:35:44Z","timestamp":1743687344000},"score":1,"resource":{"primary":{"URL":"http:\/\/lmcs.episciences.org\/4152"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,12,20]]},"references-count":0,"URL":"https:\/\/doi.org\/10.23638\/lmcs-13(4:27)2017","relation":{"is-same-as":[{"id-type":"arxiv","id":"1710.06494","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.1710.06494","asserted-by":"subject"}],"is-cited-by":[{"id-type":"doi","id":"10.4204\/EPTCS.304.8","asserted-by":"object"},{"id-type":"doi","id":"10.1007\/978-3-030-03421-4_30","asserted-by":"object"}]},"ISSN":["1860-5974"],"issn-type":[{"value":"1860-5974","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,12,20]]},"article-number":"4152"}}