A survey of symbolic methods in computational analysis of cryptographic systems
From MaRDI portal
Publication:540683
DOI10.1007/s10817-010-9187-9zbMath1213.94093OpenAlexW2091877728MaRDI QIDQ540683
Steve Kremer, Véronique Cortier, Bogdan Warinschi
Publication date: 3 June 2011
Published in: Journal of Automated Reasoning (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/inria-00379776/file/RR-6912.pdf
Related Items
Model Checking Security Protocols, Bayesian Authentication: Quantifying Security of the Hancke-Kuhn Protocol, An Equation-Based Classical Logic, Probabilistic logic over equations and domain restrictions, A survey of symbolic methods for establishing equivalence-based properties in cryptographic protocols, Computationally sound symbolic security reduction analysis of the group key exchange protocols using bilinear pairings, A procedure for deciding symbolic equivalence between sets of constraint systems, Probabilistic Functions and Cryptographic Oracles in Higher Order Logic, Logical Formalisation and Analysis of the Mifare Classic Card in PVS, Certified Security Proofs of Cryptographic Protocols in the Computational Model: An Application to Intrusion Resilience
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A computational interpretation of Dolev-Yao adversaries
- Computationally sound implementations of equational theories against passive adversaries
- On the relationships between notions of simulation-based security
- Reconciling two views of cryptography (The computational soundness of formal encryption)
- A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols
- The reactive simulatability (RSIM) framework for asynchronous systems
- Sound and complete computational interpretation of symbolic hashes in the standard model
- Protocol Composition Logic (PCL)
- Explicit Randomness is not Necessary when Modeling Probabilistic Encryption
- Computational Soundness of Symbolic Analysis for Protocols Using Hash Functions
- Cryptographically sound implementations for typed information-flow security
- On the computational soundness of cryptographically masked flows
- Time-Bounded Task-PIOAs: A Framework for Analyzing Security Protocols
- Security analysis of cryptographically controlled access to XML documents
- Cryptographically Sound Implementations for Communicating Processes
- Circular-Secure Encryption from Decision Diffie-Hellman
- Cryptography in the Multi-string Model
- A Generalization of DDH with Applications to Protocol Analysis and Computational Soundness
- Cryptographically-Masked Flows
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
- A Probabilistic Polynomial-time Calculus For Analysis of Cryptographic Protocols
- FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
- Automated Reasoning
- Foundations of Software Science and Computation Structures
- Programming Languages and Systems
- Programming Languages and Systems
- Computational Secrecy by Typing for the Pi Calculus
- Computationally Sound Symbolic Secrecy in the Presence of Hash Functions
- Deciding Key Cycles for Security Protocols
- Advances in Cryptology - CRYPTO 2003
- On Simulatability Soundness and Mapping Soundness of Symbolic Cryptography
- Computationally Sound Typing for Non-interference: The Case of Deterministic Encryption
- Fundamentals of Computation Theory
- Theory of Cryptography
- Information Security and Cryptology - ICISC 2003
- Automata, Languages and Programming
- Automata, Languages and Programming
- Automata, Languages and Programming
- Automated Security Proofs with Sequences of Games
- Theory of Cryptography
- Foundations of Software Science and Computation Structures
- Foundations of Software Science and Computation Structures
- Theory of Cryptography
