Weakening the perfect encryption assumption in Dolev-Yao adversaries
type: Item
instance of: scholarly article
title: Weakening the perfect encryption assumption in Dolev-Yao adversaries
zbMATH Open document ID: 1068.94023
author: Roberto Zunino
author: Pierpaolo Degano
published in: Theoretical Computer Science
publication date: 2005-06-30T00:00:00Z
Mathematics Subject Classification ID: 94A62
Mathematics Subject Classification ID: 68M12
Mathematics Subject Classification ID: 68P25
Mathematics Subject Classification ID: 68Q60
zbMATH DE Number: 2184096
zbMATH Keywords: Security
zbMATH Keywords: Formal methods
zbMATH Keywords: Computational approach
zbMATH Keywords: Probabilistic model
zbMATH Keywords: Secrecy
zbMATH Keywords: Authentication
describes a project that uses: Interrogator
MaRDI profile type: Publication
full work available at URL: j.tcs.2005.03.006
OpenAlex ID: W2036385788
cites work: Secrecy by typing in security protocols
cites work: A calculus for cryptographic protocols: The spi calculus
cites work: Q5714435
cites work: Q4536407
cites work: Q4418691
cites work: Symmetric Authentication within a Simulatable Cryptographic Library
cites work: Q4341751
cites work: Static analysis for the \(\pi\)-calculus with applications to security
cites work: Q4737255
cites work: Q2754157
cites work: The knowledge complexity of interactive proof-systems
cites work: Bisimulation through probabilistic testing
cites work: Q4248252
cites work: Q4411968
cites work: Foundations of Software Science and Computation Structures
DOI: 10.1016/J.TCS.2005.03.006
description: scientific article; zbMATH DE number 2184096