Compiling and securing cryptographic protocols

DOI10.1016/J.IPL.2009.11.004zbMath1209.68211arXiv0910.5099OpenAlexW2030265421MaRDI QIDQ990127

Yannick Chevalier, Michaël Rusinowitch

Publication date: 2 September 2010

Published in: Information Processing Letters (Search for Journal in Brave)

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

zbMATH Keywords

formal methodscryptographic protocolssafety/security in digital systemsrolesDolev Yao modelprotocol compiling

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25)

Related Items (4)

Alice and Bob: Reconciling Formal Models and Implementation ⋮ Alice and Bob Meet Equational Theories ⋮ Decidability of equivalence of symbolic derivations ⋮ Compiling and securing cryptographic protocols

Uses Software

• YAPA
• Casper

Cites Work

• Unnamed Item
• Deciding knowledge in security protocols under equational theories
• On the semantics of Alice \& Bob specifications of security protocols
• Compiling and securing cryptographic protocols
• Deciding Knowledge in Security Protocols for Monoidal Equational Theories
• Combining Algorithms for Deciding Knowledge in Security Protocols
• Cryptographic Protocol Explication and End-Point Projection
• YAPA: A Generic Tool for Computing Intruder Knowledge
• Using encryption for authentication in large networks of computers
• Intruders with Caps
• Automata, Languages and Programming

This page was built for publication: Compiling and securing cryptographic protocols