Safely composing security protocols
type: Item
instance of: scholarly article
title: Safely composing security protocols
zbMATH Open document ID: 1165.68358
author: Véronique Cortier
author: Stéphanie Delaune
published in: Formal Methods in System Design
publication date: 2009-07-06T00:00:00Z
full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary
Mathematics Subject Classification ID: 68N99
Mathematics Subject Classification ID: 68M10
Mathematics Subject Classification ID: 68P25
zbMATH DE Number: 5576073
zbMATH Keywords: composition
zbMATH Keywords: security protocols
zbMATH Keywords: verification
describes a project that uses: Casper
describes a project that uses: AVISPA
MaRDI profile type: Publication
OpenAlex ID: W2027660602
cites work: Q4536407
cites work: Q4484507
cites work: A framework for compositional verification of security protocols
cites work: From One Session to Many: Dynamic Tags for Security Protocols
cites work: Bounding Messages for Free in Security Protocols
cites work: Computer Aided Verification
cites work: Q4417856
cites work: Universally Composable Security with Global Setup
cites work: Q4418587
cites work: Advances in Cryptology - CRYPTO 2003
cites work: On the Security of PKCS #11
cites work: Q4447230
cites work: Security properties: two agents are sufficient
cites work: Safely Composing Security Protocols
cites work: Deciding Key Cycles for Security Protocols
cites work: Q4418589
cites work: Q4387317
cites work: An Efficient Unification Algorithm
cites work: Using encryption for authentication in large networks of computers
cites work: Protocol insecurity with a finite number of sessions and composed keys is NP-complete.
cites work: Logic for Programming, Artificial Intelligence, and Reasoning
DOI: 10.1007/S10703-008-0059-4
description: scientific article; zbMATH DE number 5576073