Efficient representation of the attacker's knowledge in cryptographic protocols analysis

DOI10.1007/s00165-008-0078-3zbMath1147.68499OpenAlexW2033241152MaRDI QIDQ931442

Ivan Cibrario Bertolotti, Adriano Valenzano, Riccardo Sisto, Luca Durante

Publication date: 25 June 2008

Published in: Formal Aspects of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00165-008-0078-3

zbMATH Keywords

Knowledge representationCryptographic protocolsState space exploration

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Knowledge representation (68T30)

Uses Software

• Casper
• OFMC

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An NP decision procedure for protocol insecurity with XOR
• A calculus of mobile processes. I
• A calculus for cryptographic protocols: The spi calculus
• Protocol insecurity with a finite number of sessions and composed keys is NP-complete.
• Proof Techniques for Cryptographic Processes
• New directions in cryptography
• On the security of public key protocols
• Automatic recognition of tractability in inference relations
• Formal Techniques for Networked and Distributed Systems - FORTE 2003

This page was built for publication: Efficient representation of the attacker's knowledge in cryptographic protocols analysis