Protocol insecurity with a finite number of sessions and composed keys is NP-complete.
type: Item
instance of: scholarly article
title: Protocol insecurity with a finite number of sessions and composed keys is NP-complete.
zbMATH Open document ID: 1042.68009
DOI: 10.1016/S0304-3975(02)00490-5
author: Michaël Rusinowitch
author: Mathieu Turuani
published in: Theoretical Computer Science
publication date: 2003-05-25T00:00:00Z
Mathematics Subject Classification ID: 68M12
zbMATH DE Number: 1915580
zbMATH Keywords: Verification
zbMATH Keywords: Security
zbMATH Keywords: Protocols
zbMATH Keywords: Rewriting
zbMATH Keywords: Complexity
describes a project that uses: Casper
MaRDI profile type: Publication
cites work: Q4536615
cites work: Secure networking - CQRE [Secure] '99. International exhibition and congress. Düsseldorf, Germany, November 30--December 2, 1999. Proceedings
cites work: Q4418589
cites work: Q4535056
cites work: On the security of public key protocols
cites work: Q2767013
cites work: The NRL Protocol Analyzer: An Overview
description: scientific article; zbMATH DE number 1915580