Bounding messages for free in security protocols -- extension to various security properties
type: Item
instance of: scholarly article
title: Bounding messages for free in security protocols -- extension to various security properties
zbMATH Open document ID: 1309.68059
author: Myrto Arapinis
author: Marie Duflot
published in: Information and Computation
publication date: 2014-11-28T00:00:00Z
Mathematics Subject Classification ID: 68P25
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 94A62
zbMATH DE Number: 6375063
zbMATH Keywords: cryptographic protocols
zbMATH Keywords: formal methods
zbMATH Keywords: verification
zbMATH Keywords: secrecy
zbMATH Keywords: authentication
describes a project that uses: NRL
MaRDI profile type: Publication
full work available at URL: j.ic.2014.09.003
OpenAlex ID: W2033327323
cites work: Q4804908
cites work: Bounding Messages for Free in Security Protocols
cites work: Verification of cryptographic protocols: tagging enforces termination
cites work: Tree automata with one memory set constraints and cryptographic protocols
cites work: Q4447230
cites work: Safely Composing Security Protocols
cites work: Computer Science Logic
cites work: Deciding Key Cycles for Security Protocols
cites work: The NRL Protocol Analyzer: An Overview
cites work: An Efficient Unification Algorithm
cites work: Information based reasoning about security protocols
cites work: FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
cites work: Protocol insecurity with a finite number of sessions and composed keys is NP-complete.
DOI: 10.1016/J.IC.2014.09.003
description: scientific article; zbMATH DE number 6375063