A survey of symbolic methods in computational analysis of cryptographic systems
From MaRDI portal
Publication:540683
DOI10.1007/S10817-010-9187-9zbMATH Open1213.94093OpenAlexW2091877728MaRDI QIDQ540683FDOQ540683
Authors: Véronique Cortier, Steve Kremer, 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
Recommendations
- Programming Languages and Systems
- Computationally Sound Symbolic Analysis of Probabilistic Protocols with Ideal Setups
- Universally composable symbolic security analysis
- Security protocol verification: symbolic and computational models
- Computational soundness of symbolic analysis for protocols using hash functions
Cites Work
- A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
- Computationally Sound Typing for Non-interference: The Case of Deterministic Encryption
- Automated Security Proofs with Sequences of Games
- Circular-Secure Encryption from Decision Diffie-Hellman
- Title not available (Why is that?)
- Computationally sound implementations of equational theories against passive adversaries
- Automata, Languages and Programming
- Foundations of Software Science and Computation Structures
- Fundamentals of Computation Theory
- Reconciling two views of cryptography (The computational soundness of formal encryption)
- Deciding Key Cycles for Security Protocols
- Advances in Cryptology - CRYPTO 2003
- Title not available (Why is that?)
- Theory of Cryptography
- On the relationships between notions of simulation-based security
- The reactive simulatability (RSIM) framework for asynchronous systems
- Sound and complete computational interpretation of symbolic hashes in the standard model
- Title not available (Why is that?)
- Protocol composition logic (PCL)
- Explicit randomness is not necessary when modeling probabilistic encryption
- Computational soundness of symbolic analysis for protocols using hash functions
- Title not available (Why is that?)
- 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
- Cryptography in the Multi-string Model
- A Generalization of DDH with Applications to Protocol Analysis and Computational Soundness
- Cryptographically-Masked Flows
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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
- On Simulatability Soundness and Mapping Soundness of Symbolic Cryptography
- A computational interpretation of Dolev-Yao adversaries
- Theory of Cryptography
- Information Security and Cryptology - ICISC 2003
- Automata, Languages and Programming
- Automata, Languages and Programming
- Foundations of Software Science and Computation Structures
- Theory of Cryptography
Cited In (17)
- Certified Security Proofs of Cryptographic Protocols in the Computational Model: An Application to Intrusion Resilience
- Probabilistic Functions and Cryptographic Oracles in Higher Order Logic
- Theory of Cryptography
- Computational Science and Its Applications – ICCSA 2004
- Logical Formalisation and Analysis of the Mifare Classic Card in PVS
- Computationally Sound Symbolic Analysis of Probabilistic Protocols with Ideal Setups
- Computationally sound symbolic security reduction analysis of the group key exchange protocols using bilinear pairings
- Out of oddity -- new cryptanalytic techniques against symmetric primitives optimized for integrity proof systems
- An Equation-Based Classical Logic
- A procedure for deciding symbolic equivalence between sets of constraint systems
- Probabilistic logic over equations and domain restrictions
- Universally composable symbolic security analysis
- Model Checking Security Protocols
- Bayesian Authentication: Quantifying Security of the Hancke-Kuhn Protocol
- Theory of Cryptography
- Formalization and analysis of the post-quantum signature scheme FALCON with Maude
- A survey of symbolic methods for establishing equivalence-based properties in cryptographic protocols
This page was built for publication: A survey of symbolic methods in computational analysis of cryptographic systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q540683)
