Computing knowledge in security protocols under convergent equational theories

DOI10.1007/S10817-010-9197-7MaRDI QIDQ437033zbMATH OpenOpenAlexFDO

Authors Ştefan Ciobâcă, Stéphanie Delaune, Steve Kremer

Publication date 17 July 2012

Published in Journal of Automated Reasoning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10817-010-9197-7

zbMATH Keywords

formal methodssecurity protocolsstatic equivalence

Mathematics Subject Classification ID

Network protocols (68M12) Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• Computing Knowledge in Security Protocols under Convergent Equational Theories
• Automata, Languages and Programming
• Deciding knowledge in security protocols under equational theories
• Decidability and combination results for two notions of knowledge in security protocols
• Combining Algorithms for Deciding Knowledge in Security Protocols

Cites work

• Analysing password protocol security against off-line dictionary attacks
• Automated verification of selected equivalences for security protocols
• Combining Algorithms for Deciding Knowledge in Security Protocols
• Computer Aided Verification
• Computing Knowledge in Security Protocols under Convergent Equational Theories
• Deciding Knowledge in Security Protocols for Monoidal Equational Theories
• Deciding knowledge in security protocols under equational theories
• Deciding knowledge in security protocols under some e-voting theories
• scientific article; zbMATH DE number 1149900 (Why is no real title available?)
• Intruder deduction for the equational theory of abelian groups with distributive encryption
• Intruders with Caps
• Key Substitution in the Symbolic Analysis of Cryptographic Protocols
• Mobile values, new names, and secure communication
• Programming Languages and Systems
• Protocol insecurity with a finite number of sessions and composed keys is NP-complete.
• Verifying privacy-type properties of electronic voting protocols: a taster
• YAPA: A Generic Tool for Computing Intruder Knowledge

Cited in

(19)

• Terminating non-disjoint combined unification
• Notions of knowledge in combinations of theories sharing constructors
• YAPA: a generic tool for computing intruder knowledge
• Deciding knowledge in security protocols under some e-voting theories
• Combining Algorithms for Deciding Knowledge in Security Protocols
• YAPA: A Generic Tool for Computing Intruder Knowledge
• Decidability and combination results for two notions of knowledge in security protocols
• scientific article; zbMATH DE number 1534512 (Why is no real title available?)
• Analysing privacy-type properties in cryptographic protocols (invited talk)
• A survey of symbolic methods for establishing equivalence-based properties in cryptographic protocols
• Computing knowledge in equational extensions of subterm convergent theories
• Computing Knowledge in Security Protocols under Convergent Equational Theories
• Automated verification of equivalence properties of cryptographic protocols
• Automata, Languages and Programming
• DeepSec: deciding equivalence properties for security protocols -- improved theory and practice
• Graph-embedded rewrite systems: combination and undecidability results
• Knowledge problems in protocol analysis: extending the notion of subterm convergent
• Probability timed automata for investigating communication processes
• Deciding knowledge in security protocols under equational theories

Describes a project that uses

Uses Software

• YAPA
• AVISPA

This page was built for publication: Computing knowledge in security protocols under convergent equational theories

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