Automata, Languages and Programming
From MaRDI portal
Publication:5716777
DOI10.1007/11523468zbMath1082.68571WikidataQ56656999 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
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, A survey of symbolic methods in computational analysis of cryptographic systems, Compositional analysis of contract-signing protocols, An anytime deduction algorithm for the probabilistic logic and entailment problems, Computationally sound implementations of equational theories against passive adversaries, The reactive simulatability (RSIM) framework for asynchronous systems, Protocol Composition Logic (PCL), Bayesian Authentication: Quantifying Security of the Hancke-Kuhn Protocol, Unnamed Item, Computational Semantics for First-Order Logical Analysis of Cryptographic Protocols