Handling Algebraic Properties in Automatic Analysis of Security Protocols

DOI10.1007/11921240_11zbMath1168.68378OpenAlexW1587641948MaRDI QIDQ3525147

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

approximationautomatic verificationsecurity protocolalgebraic properties

Mathematics Subject Classification ID

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

Related Items (5)

Symbol different term rewrite systems ⋮ A theoretical limit for safety verification techniques with regular fix-point computations ⋮ Tree Automata for Detecting Attacks on Protocols with Algebraic Cryptographic Primitives ⋮ Handling Left-Quadratic Rules When Completing Tree Automata ⋮ Towards an Efficient Implementation of Tree Automata Completion

Uses Software

• HERMES
• AVISPA
• Timbuk

This page was built for publication: Handling Algebraic Properties in Automatic Analysis of Security Protocols