Automata, Languages and Programming

DOI10.1007/11523468zbMath1084.94510OpenAlexW2940595899WikidataQ56656999 ScholiaQ56656999MaRDI QIDQ5716816

Mathieu Baudet, Véronique Cortier, Steve Kremer

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

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (13)

Moving the bar on computationally sound exclusive-or ⋮ Deciding knowledge in security protocols under equational theories ⋮ Emerging Issues and Trends in Formal Methods in Cryptographic Protocol Analysis: Twelve Years Later ⋮ Deciding Knowledge in Security Protocols for Monoidal Equational Theories ⋮ Decidability and combination results for two notions of knowledge in security protocols ⋮ Unnamed Item ⋮ Sound and complete computational interpretation of symbolic hashes in the standard model ⋮ 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 ⋮ YAPA: A Generic Tool for Computing Intruder Knowledge ⋮ Limits of the Cryptographic Realization of Dolev-Yao-Style XOR ⋮ Soundness of Formal Encryption in the Presence of Key-Cycles

This page was built for publication: Automata, Languages and Programming