Bounding messages for free in security protocols -- extension to various security properties

DOI10.1016/j.ic.2014.09.003zbMath1309.68059OpenAlexW2033327323MaRDI QIDQ476179

Marie Duflot, Myrto Arapinis

Publication date: 28 November 2014

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2014.09.003

zbMATH Keywords

verificationformal methodsauthenticationcryptographic protocolssecrecy

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Authentication, digital signatures and secret sharing (94A62)

Related Items (1)

Unnamed Item

Uses Software

• NRL

Cites Work

• Unnamed Item
• Unnamed Item
• Verification of cryptographic protocols: tagging enforces termination
• Tree automata with one memory set constraints and cryptographic protocols
• Protocol insecurity with a finite number of sessions and composed keys is NP-complete.
• Information based reasoning about security protocols
• The NRL Protocol Analyzer: An Overview
• An Efficient Unification Algorithm
• FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
• Computer Science Logic
• Deciding Key Cycles for Security Protocols
• Safely Composing Security Protocols
• Bounding Messages for Free in Security Protocols

This page was built for publication: Bounding messages for free in security protocols -- extension to various security properties