The C_-calculus: a model for confidential name passing

DOI10.1016/J.JLAMP.2020.100622MaRDI QIDQ1996859zbMATH OpenOpenAlexFDO

Authors Ivan Prokić, Hugo Torres Vieira

Publication date 26 February 2021

Published in Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave)

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

zbMATH Keywords

\(\pi\)-calculuslanguage-based securityprocess calculus

Mathematics Subject Classification ID

Computer security (68M25) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Abstract: Sharing confidential information in distributed systems is a necessity in many applications, however, it opens the problem of controlling information sharing even among trusted parties. In this paper, we present a formal model in which dissemination of information is disabled at the level of the syntax in a direct way. We introduce a subcalculus of the pi-calculus in which channels are considered as confidential information. The only difference with respect to the pi-calculus is that channels once received cannot be forwarded later on. By means of examples, we give an initial idea of how some privacy notions already studied in the past, such as group creation and name hiding, can be represented without any additional language constructs. We also present an encoding of the (sum-free) pi-calculus in our calculus.

Recommendations

• Hide and new in the -calculus
• A distributed \(\pi\)-calculus with local areas of communication
• Controlling information release in the \(\pi\)-calculus
• Privacy by typing in the -calculus
• -calculi

Cites work

• \(\pi\)-calculus, internal mobility, and agent-passing calculi
• A calculus for cryptographic protocols: The spi calculus
• A calculus for modeling floating authorizations
• A calculus of communicating systems
• A Distributed Pi-Calculus
• A Distribution Law for CCS and a New Congruence Result for the pi-calculus
• A fully abstract semantics for causality in the \(\pi\)-calculus
• Analysing and comparing encodability criteria
• Controlling information release in the \(\pi\)-calculus
• Decoding choice encodings
• Encyclopedia of parallel computing.
• Event structure semantics of parallel extrusion in the pi-calculus
• Expressiveness of process algebras
• Functions as processes
• Hide and new in the -calculus
• scientific article; zbMATH DE number 2059568 (Why is no real title available?)
• scientific article; zbMATH DE number 1555188 (Why is no real title available?)
• scientific article; zbMATH DE number 1759484 (Why is no real title available?)
• scientific article; zbMATH DE number 7015117 (Why is no real title available?)
• Introduction to bisimulation and coinduction
• Mobile values, new names, and secure communication
• On asynchrony in name-passing calculi
• On Bisimilarity and Substitution in Presence of Replication
• On compensation primitives as adaptable processes
• On the expressiveness and decidability of higher-order process calculi
• On the expressiveness of internal mobility in name-passing calculi
• Origins of bisimulation and coinduction
• Privacy by typing in the -calculus
• Region analysis and a π-calculus with groups
• Resource access control in systems of mobile agents
• Secrecy and group creation
• Session types revisited
• Some congruence properties for \(\pi\)-calculus bisimilarities
• Static VS Dynamic Reversibility in CCS
• The -calculus: A theory of mobile processes
• The Applied Pi Calculus
• The chemical abstract machine
• The security pi-calculus and non-interference
• Towards a unified approach to encodability and separation results for process calculi

Cited in

(2)

• \textsf{Catalic}: delegated PSI cardinality with applications to contact tracing
• Hide and new in the -calculus

This page was built for publication: The \(C_\pi\)-calculus: a model for confidential name passing

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