Computationally sound implementations of equational theories against passive adversaries

DOI10.1016/j.ic.2008.12.005zbMath1170.68016OpenAlexW2141219978MaRDI QIDQ1013091

Steve Kremer, Mathieu Baudet, Véronique Cortier

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

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

Related Items (3)

Model Checking Security Protocols ⋮ Reducing equational theories for the decision of static equivalence ⋮ A survey of symbolic methods in computational analysis of cryptographic systems

Uses Software

• CiME

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Probabilistic encryption
• Invertible Universal Hashing and the TET Encryption Mode
• On the security of public key protocols
• Symmetric Authentication within a Simulatable Cryptographic Library
• Mobile values, new names, and secure communication
• Programming Languages and Systems
• Programming Languages and Systems
• The RSA Group is Pseudo-Free
• Automata, Languages and Programming
• Information Security and Cryptology - ICISC 2003
• Automata, Languages and Programming
• Automata, Languages and Programming
• Automata, Languages and Programming
• Quantifying Probabilistic Information Flow in Computational Reactive Systems
• Soundness of Formal Encryption in the Presence of Key-Cycles
• Theory of Cryptography
• Foundations of Software Science and Computation Structures
• Theory of Cryptography

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