Computationally sound implementations of equational theories against passive adversaries

DOI10.1016/J.IC.2008.12.005zbMATH Open1170.68016OpenAlexW2141219978MaRDI QIDQ1013091FDOQ1013091

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

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

zbMATH Keywords

cryptographic models for security protocols

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (6)

• Foundations of Software Science and Computation Structures
• Reducing equational theories for the decision of static equivalence
• 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

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)