A pure labeled transition semantics for the applied pi calculus

DOI10.1016/j.ins.2010.07.008zbMath1207.68221OpenAlexW2138602467MaRDI QIDQ621583

Xiaojuan Cai

Publication date: 28 January 2011

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2010.07.008

zbMATH Keywords

bisimulationanonymitylabeled transition systemapplied pi calculuszero-knowledge proof

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Deciding knowledge in security protocols under equational theories
• Fair ambients
• A note on transition systems
• Zero knowledge and the chromatic number
• A calculus for cryptographic protocols: The spi calculus
• Bisimulation congruence of \(\chi\)-calculus
• Mobile ambients
• Variations on mobile processes
• Certificateless undeniable signature scheme
• Behavioral theory for mobile ambients
• A Probabilistic Applied Pi–Calculus
• Process algebra for synchronous communication
• Process Algebra
• Communicating sequential processes
• Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
• Foundations of Cryptography
• The knowledge complexity of interactive proof-systems
• Mobile values, new names, and secure communication
• Bisimulation congruences in safe ambients
• Programming Languages and Systems
• Programming Languages and Systems

This page was built for publication: A pure labeled transition semantics for the applied pi calculus