Automata, Languages and Programming
From MaRDI portal
Publication:5716777
DOI10.1007/11523468zbMath1082.68571OpenAlexW2940595899WikidataQ56656999 ScholiaQ56656999MaRDI QIDQ5716777
Vitaly Shmatikov, Mathieu Turuani, Anupam Datta, John C. Mitchell, Ante Derek
Publication date: 10 January 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11523468
Related Items (12)
Bayesian Authentication: Quantifying Security of the Hancke-Kuhn Protocol ⋮ Compositional analysis of contract-signing protocols ⋮ Unnamed Item ⋮ The reactive simulatability (RSIM) framework for asynchronous systems ⋮ An anytime deduction algorithm for the probabilistic logic and entailment problems ⋮ A survey of symbolic methods in computational analysis of cryptographic systems ⋮ Computationally sound implementations of equational theories against passive adversaries ⋮ Computational Semantics for First-Order Logical Analysis of Cryptographic Protocols ⋮ Protocol Composition Logic (PCL) ⋮ Cryptographically Sound Security Proofs for Basic and Public-Key Kerberos ⋮ Limits of the BRSIM/UC Soundness of Dolev-Yao Models with Hashes ⋮ Soundness of Formal Encryption in the Presence of Key-Cycles
This page was built for publication: Automata, Languages and Programming