Computing knowledge in security protocols under convergent equational theories
type: Item
instance of: scholarly article
title: Computing knowledge in security protocols under convergent equational theories
zbMATH Open document ID: 1242.68098
author: Ştefan Ciobâcă
author: Stéphanie Delaune
author: Steve Kremer
published in: Journal of Automated Reasoning
publication date: 2012-07-17T00:00:00Z
Mathematics Subject Classification ID: 68P25
Mathematics Subject Classification ID: 68M12
Mathematics Subject Classification ID: 68T15
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 6057740
zbMATH Keywords: formal methods
zbMATH Keywords: security protocols
zbMATH Keywords: static equivalence
describes a project that uses: YAPA
describes a project that uses: AVISPA
MaRDI profile type: Publication
full work available at URL: s10817-010-9197-7
OpenAlex ID: W2057936571
cites work: Deciding knowledge in security protocols under equational theories
cites work: Mobile values, new names, and secure communication
cites work: Intruders with Caps
cites work: Computer Aided Verification
cites work: Combining Algorithms for Deciding Knowledge in Security Protocols
cites work: YAPA: A Generic Tool for Computing Intruder Knowledge
cites work: Deciding knowledge in security protocols under some e-voting theories
cites work: Automated verification of selected equivalences for security protocols
cites work: Key Substitution in the Symbolic Analysis of Cryptographic Protocols
cites work: Computing Knowledge in Security Protocols under Convergent Equational Theories
cites work: Analysing password protocol security against off-line dictionary attacks
cites work: Deciding Knowledge in Security Protocols for Monoidal Equational Theories
cites work: Verifying Privacy-Type Properties of Electronic Voting Protocols: A Taster
cites work: Programming Languages and Systems
cites work: Intruder deduction for the equational theory of abelian groups with distributive encryption
cites work: Q4387311
cites work: Protocol insecurity with a finite number of sessions and composed keys is NP-complete.
DOI: 10.1007/S10817-010-9197-7
description: scientific article; zbMATH DE number 6057740