Handling Algebraic Properties in Automatic Analysis of Security Protocols

DOI10.1007/11921240_11MaRDI QIDQ3525147zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

algebraic propertiesapproximationautomatic verificationsecurity protocol

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Specification and verification (program logics, model checking, etc.) (68Q60) Cryptography (94A60)

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

Cited in

(9)

• Protocol Security and Algebraic Properties: Decision Results for a Bounded Number of Sessions
• Symbol different term rewrite systems
• Handling left-quadratic rules when completing tree automata
• scientific article; zbMATH DE number 7211469 (Why is no real title available?)
• Tree automata for detecting attacks on protocols with algebraic cryptographic primitives
• Algebraic Intruder Deductions
• Towards an Efficient Implementation of Tree Automata Completion
• Ground approximations of term rewriting systems
• A theoretical limit for safety verification techniques with regular fix-point computations

Describes a project that uses

Uses Software

• HERMES
• AVISPA
• Timbuk

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)