Automating security analysis: symbolic equivalence of constraint systems

DOI10.1007/978-3-642-14203-1_35MaRDI QIDQ5747780zbMATH OpenOpenAlexFDO

Authors Vincent Cheval, Hubert Comon-Lundh, Stéphanie Delaune

Publication date 14 September 2010

Published in Automated Reasoning (Search for Journal in Brave)

Full work available at URL https://kar.kent.ac.uk/46730/1/CCD-ijcar10.pdf

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• A procedure for deciding symbolic equivalence between sets of constraint systems
• Deciding equivalence-based properties using constraint solving
• scientific article; zbMATH DE number 1754628
• Universally composable symbolic security analysis
• A survey of symbolic methods for establishing equivalence-based properties in cryptographic protocols

Cites work

• scientific article; zbMATH DE number 1341618 (Why is no real title available?)
• Analysing password protocol security against off-line dictionary attacks
• Automated verification of selected equivalences for security protocols
• Automating security analysis: symbolic equivalence of constraint systems
• Challenges in the Automated Verification of Security Protocols
• Decidability of equivalence of symbolic derivations
• Deciding framed bisimilarity
• Deciding knowledge in security protocols under equational theories
• Deciding security properties for cryptographic protocols. application to key cycles
• Mobile values, new names, and secure communication
• Modal logics for cryptographic processes
• Protocol insecurity with a finite number of sessions and composed keys is NP-complete.
• The NRL Protocol Analyzer: An Overview
• YAPA: A Generic Tool for Computing Intruder Knowledge

Cited in

(14)

• Deciding equivalence-based properties using constraint solving
• Decidability of equivalence of symbolic derivations
• DeepSec: deciding equivalence properties for security protocols -- improved theory and practice
• CONCUR 2005 – Concurrency Theory
• On Communication Models When Verifying Equivalence Properties
• A procedure for deciding symbolic equivalence between sets of constraint systems
• A reduced semantics for deciding trace equivalence
• Automating security analysis: symbolic equivalence of constraint systems
• Automated verification of equivalence properties of cryptographic protocols
• POR for security protocol equivalences. Beyond action-determinism
• Stateful applied pi calculus: observational equivalence and labelled bisimilarity
• A survey of symbolic methods for establishing equivalence-based properties in cryptographic protocols
• Beyond Subterm-Convergent Equational Theories in Automated Verification of Stateful Protocols
• FAST: an efficient decision procedure for deduction and static equivalence

Describes a project that uses

Uses Software

• YAPA

This page was built for publication: Automating security analysis: symbolic equivalence of constraint systems

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