Protocol Security and Algebraic Properties: Decision Results for a Bounded Number of Sessions

DOI10.1007/978-3-642-02348-4_10zbMath1242.94020OpenAlexW1562259153MaRDI QIDQ3636823

Sergiu Bursuc, Hubert Comon-Lundh

Publication date: 30 June 2009

Published in: Rewriting Techniques and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02348-4_10

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Decidability of theories and sets of sentences (03B25)

Related Items (1)

Maude-NPA: Cryptographic Protocol Analysis Modulo Equational Properties

Cites Work

• Unnamed Item
• An NP decision procedure for protocol insecurity with XOR
• An undecidability result for AGh
• Protocol insecurity with a finite number of sessions and composed keys is NP-complete.
• Symbolic protocol analysis for monoidal equational theories
• Effectively Checking the Finite Variant Property
• Hierarchical Combination of Intruder Theories
• Associative-Commutative Deducibility Constraints
• Deducibility Constraints, Equational Theory and Electronic Money
• FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
• Programming Languages and Systems
• Term Rewriting and Applications

This page was built for publication: Protocol Security and Algebraic Properties: Decision Results for a Bounded Number of Sessions