Reducing protocol analysis with XOR to the XOR-free case in the Horn theory based approach
type: Item
instance of: scholarly article
title: Reducing protocol analysis with XOR to the XOR-free case in the Horn theory based approach
zbMATH Open document ID: 1213.94119
author: Ralf Küsters
author: Tomasz Truderung
published in: Journal of Automated Reasoning
publication date: 2011-06-03T00:00:00Z
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 68Q60
Mathematics Subject Classification ID: 68T15
zbMATH DE Number: 5903834
zbMATH Keywords: security protocols
zbMATH Keywords: XOR
zbMATH Keywords: automated verification
describes a project that uses: ProVerif
MaRDI profile type: Publication
full work available at URL: s10817-010-9188-8
OpenAlex ID: W2053014980
Wikidata QID: Q60530316
cites work: Automated verification of selected equivalences for security protocols
cites work: Q4797389
cites work: An NP decision procedure for protocol insecurity with XOR
cites work: Automatic Analysis of the Security of XOR-Based Key Management Schemes
cites work: Q4447230
cites work: Security properties: two agents are sufficient
cites work: Term Rewriting and Applications
cites work: On the Security of PKCS #11
cites work: On the Automatic Analysis of Recursive Security Protocols with XOR
cites work: Session Key Distribution Using Smart Cards
cites work: Automated Deduction – CADE-20
cites work: Flat and One-Variable Clauses for Single Blind Copying Protocols: The XOR Case
DOI: 10.1007/S10817-010-9188-8
description: scientific article; zbMATH DE number 5903834