Encoding cryptographic primitives in a calculus with polyadic synchronisation

DOI10.1007/s10817-010-9189-7zbMath1216.68194OpenAlexW2093425000MaRDI QIDQ540687

Joana Martinho, António Ravara

Publication date: 3 June 2011

Published in: Journal of Automated Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10817-010-9189-7

zbMATH Keywords

cryptographic primitivesbarbed congruence(early) bisimulation\(\pi \)-calculusfully abstract encodingpolyadic synchronisation

Mathematics Subject Classification ID

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

Related Items (1)

Encoding cryptographic primitives in a calculus with polyadic synchronisation

Uses Software

• MWB

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Encoding cryptographic primitives in a calculus with polyadic synchronisation
• A theory of bisimulation for the \(\pi\)-calculus
• Automated verification of selected equivalences for security protocols
• Proof Techniques for Cryptographic Processes
• Square patterns and secondary instabilities in driven capillary waves
• Mobile values, new names, and secure communication
• On bisimulations for the spi calculus

This page was built for publication: Encoding cryptographic primitives in a calculus with polyadic synchronisation