Deciding Key Cycles for Security Protocols

DOI10.1007/11916277_22MaRDI QIDQ5387901zbMATH OpenOpenAlexFDO

Authors Véronique Cortier, Eugen Zălinescu

Publication date 27 May 2008

Published in Logic for Programming, Artificial Intelligence, and Reasoning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11916277_22

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Cryptography (94A60)

Recommendations

• Deciding security properties for cryptographic protocols. application to key cycles
• Protocol insecurity with a finite number of sessions and composed keys is NP-complete.
• CONCUR 2004 - Concurrency Theory
• STACS 2004
• scientific article; zbMATH DE number 1759624

Cited in

(9)

• Safely composing security protocols
• Deciding the security of protocols with commuting public key encryption
• Deciding security properties for cryptographic protocols. application to key cycles
• Verifying Cryptographic Protocols with Subterms Constraints
• Bounding messages for free in security protocols -- extension to various security properties
• A survey of symbolic methods in computational analysis of cryptographic systems
• Safely Composing Security Protocols
• Bounding Messages for Free in Security Protocols
• Circular insecure encryption: from long cycles to short cycles

Describes a project that uses

Uses Software

• AVISPA

This page was built for publication: Deciding Key Cycles for Security Protocols

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5387901)