Computing knowledge in security protocols under convergent equational theories
From MaRDI portal
Publication:437033
DOI10.1007/S10817-010-9197-7zbMATH Open1242.68098OpenAlexW2057936571MaRDI QIDQ437033FDOQ437033
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
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
Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Network protocols (68M12)
Cites Work
- YAPA: A Generic Tool for Computing Intruder Knowledge
- Computer Aided Verification
- Mobile values, new names, and secure communication
- Automated verification of selected equivalences for security protocols
- Deciding knowledge in security protocols under equational theories
- Title not available (Why is that?)
- Programming Languages and Systems
- Protocol insecurity with a finite number of sessions and composed keys is NP-complete.
- Analysing password protocol security against off-line dictionary attacks
- Deciding knowledge in security protocols under some e-voting theories
- Deciding Knowledge in Security Protocols for Monoidal Equational Theories
- Combining Algorithms for Deciding Knowledge in Security Protocols
- Verifying privacy-type properties of electronic voting protocols: a taster
- Computing Knowledge in Security Protocols under Convergent Equational Theories
- Intruders with Caps
- Key Substitution in the Symbolic Analysis of Cryptographic Protocols
- Intruder deduction for the equational theory of abelian groups with distributive encryption
Cited In (17)
- DeepSec: deciding equivalence properties for security protocols -- improved theory and practice
- Deciding knowledge in security protocols under equational theories
- Computing Knowledge in Security Protocols under Convergent Equational Theories
- YAPA: A Generic Tool for Computing Intruder Knowledge
- Decidability and combination results for two notions of knowledge in security protocols
- Analysing privacy-type properties in cryptographic protocols (invited talk)
- Terminating non-disjoint combined unification
- Notions of knowledge in combinations of theories sharing constructors
- Probability timed automata for investigating communication processes
- Automated verification of equivalence properties of cryptographic protocols
- Title not available (Why is that?)
- Computing knowledge in equational extensions of subterm convergent theories
- A survey of symbolic methods for establishing equivalence-based properties in cryptographic protocols
- Automata, Languages and Programming
- Deciding knowledge in security protocols under some e-voting theories
- YAPA: a generic tool for computing intruder knowledge
- Combining Algorithms for Deciding Knowledge in Security Protocols
Uses Software
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)
