Decision procedures for the security of protocols with probabilistic encryption against offline dictionary attacks
type: Item
instance of: scholarly article
title: Decision procedures for the security of protocols with probabilistic encryption against offline dictionary attacks
zbMATH Open document ID: 1107.68041
author: Stéphanie Delaune
author: Florent Jacquemard
published in: Journal of Automated Reasoning
publication date: 2007-01-30T00:00:00Z
full work available at URL: document
Mathematics Subject Classification ID: 68P25
Mathematics Subject Classification ID: 68T15
Mathematics Subject Classification ID: 94A62
zbMATH DE Number: 5119734
zbMATH Keywords: cryptographic protocols
zbMATH Keywords: protocol insecurity problem
MaRDI profile type: Publication
OpenAlex ID: W2027656737
cites work: Automata, Languages and Programming
cites work: Mobile values, new names, and secure communication
cites work: Q4484507
cites work: Q4536615
cites work: Q3374905
cites work: FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
cites work: Tree automata with one memory set constraints and cryptographic protocols
cites work: Analysing password protocol security against off-line dictionary attacks
cites work: Termination of rewriting
cites work: On the security of public key protocols
cites work: Q4418589
cites work: Probabilistic encryption
cites work: Q3149675
cites work: Automatic recognition of tractability in inference relations
cites work: Protocol insecurity with a finite number of sessions and composed keys is NP-complete.
DOI: 10.1007/S10817-005-9017-7
description: scientific article; zbMATH DE number 5119734