Computationally sound implementations of equational theories against passive adversaries

DOI10.1016/J.IC.2008.12.005MaRDI QIDQ1013091zbMATH OpenOpenAlexFDO

Authors Mathieu Baudet, Véronique Cortier, Steve Kremer

Publication date 16 April 2009

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ic.2008.12.005

zbMATH Keywords

cryptographic models for security protocols

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• Automata, Languages and Programming
• Programming Languages and Systems
• Foundations of Software Science and Computation Structures
• Theory of Cryptography
• scientific article; zbMATH DE number 2242582

Cites work

• scientific article; zbMATH DE number 1692935 (Why is no real title available?)
• scientific article; zbMATH DE number 1759457 (Why is no real title available?)
• scientific article; zbMATH DE number 1418256 (Why is no real title available?)
• Analysing password protocol security against off-line dictionary attacks
• Automata, Languages and Programming
• Automata, Languages and Programming
• Automata, Languages and Programming
• Automata, Languages and Programming
• Foundations of Software Science and Computation Structures
• Information Security and Cryptology - ICISC 2003
• Invertible Universal Hashing and the TET Encryption Mode
• Mobile values, new names, and secure communication
• On the security of public key protocols
• Probabilistic encryption
• Programming Languages and Systems
• Programming Languages and Systems
• Quantifying probabilistic information flow in computational reactive systems
• Soundness of Formal Encryption in the Presence of Key-Cycles
• Symmetric authentication within a simulatable cryptographic library
• The RSA Group is Pseudo-Free
• Theory of Cryptography
• Theory of Cryptography

Cited in

(6)

• Reducing equational theories for the decision of static equivalence
• Foundations of Software Science and Computation Structures
• Reducing equational theories for the decision of static equivalence
• Model Checking Security Protocols
• A survey of symbolic methods in computational analysis of cryptographic systems
• Automata, Languages and Programming

Describes a project that uses

Uses Software

• CiME

This page was built for publication: Computationally sound implementations of equational theories against passive adversaries

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1013091)