Programming Languages and Systems
From MaRDI portal
Publication:5316564
DOI10.1007/b107380zbMath1108.68462OpenAlexW4232919104MaRDI QIDQ5316564
Publication date: 13 September 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b107380
Data encryption (aspects in computer science) (68P25) Specification and verification (program logics, model checking, etc.) (68Q60)
Related Items
Compositional analysis of protocol equivalence in the applied \(\pi \)-calculus using quasi-open bisimilarity ⋮ Probabilistic and nondeterministic aspects of anonymity ⋮ Deciding knowledge in security protocols under equational theories ⋮ Post-quantum online voting scheme ⋮ Privacy and verifiability in voting systems: methods, developments and trends ⋮ When privacy fails, a formula describes an attack: a complete and compositional verification method for the applied \(\pi\)-calculus ⋮ A pure labeled transition semantics for the applied pi calculus ⋮ Computing knowledge in security protocols under convergent equational theories ⋮ Decidability and combination results for two notions of knowledge in security protocols ⋮ Exploiting re-voting in the Helios election system ⋮ Deducibility constraints and blind signatures ⋮ A survey of symbolic methods for establishing equivalence-based properties in cryptographic protocols ⋮ A Framework for Automatically Checking Anonymity with μCRL ⋮ Analysing the MUTE Anonymous File-Sharing System Using the Pi-Calculus ⋮ Bisimulation for Demonic Schedulers ⋮ Symbolic Bisimulation for the Applied Pi Calculus ⋮ Automated Verification of Equivalence Properties of Cryptographic Protocols ⋮ A Proof Theoretic Analysis of Intruder Theories ⋮ Automatic Verification of Security Protocols in the Symbolic Model: The Verifier ProVerif ⋮ Formalizing provable anonymity in Isabelle/HOL
Uses Software
