Handling Algebraic Properties in Automatic Analysis of Security Protocols
DOI10.1007/11921240_11zbMATH Open1168.68378OpenAlexW1587641948MaRDI QIDQ3525147FDOQ3525147
Authors: Yohan Boichut, Pierre-Cyrille Héam, Olga Kouchnarenko 
Publication date: 11 September 2008
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/inria-00070169/file/RR-5857.pdf
Recommendations
- Algebraic Intruder Deductions
- Tree automata for detecting attacks on protocols with algebraic cryptographic primitives
- Protocol Security and Algebraic Properties: Decision Results for a Bounded Number of Sessions
- scientific article; zbMATH DE number 1927581
- Symbolic protocol analysis for monoidal equational theories
Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Specification and verification (program logics, model checking, etc.) (68Q60)
Cited In (8)
- Towards an Efficient Implementation of Tree Automata Completion
- Tree automata for detecting attacks on protocols with algebraic cryptographic primitives
- A theoretical limit for safety verification techniques with regular fix-point computations
- Title not available (Why is that?)
- Handling left-quadratic rules when completing tree automata
- Protocol Security and Algebraic Properties: Decision Results for a Bounded Number of Sessions
- Symbol different term rewrite systems
- Algebraic Intruder Deductions
Uses Software
This page was built for publication: Handling Algebraic Properties in Automatic Analysis of Security Protocols
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3525147)
