A survey of symbolic methods in computational analysis of cryptographic systems
From MaRDI portal
(Redirected from Publication:540683)
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
- scientific article; zbMATH DE number 1692935 (Why is no real title available?)
- scientific article; zbMATH DE number 1951605 (Why is no real title available?)
- scientific article; zbMATH DE number 1956552 (Why is no real title available?)
- scientific article; zbMATH DE number 1759457 (Why is no real title available?)
- scientific article; zbMATH DE number 2090144 (Why is no real title available?)
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
- A Generalization of DDH with Applications to Protocol Analysis and Computational Soundness
- A computational interpretation of Dolev-Yao adversaries
- A probabilistic polynomial-time calculus for analysis of cryptographic protocols (preliminary report)
- A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols
- Advances in Cryptology - CRYPTO 2003
- Automata, Languages and Programming
- Automata, Languages and Programming
- Automata, Languages and Programming
- Automated Reasoning
- Automated Security Proofs with Sequences of Games
- Circular-Secure Encryption from Decision Diffie-Hellman
- Computational Secrecy by Typing for the Pi Calculus
- Computational soundness of symbolic analysis for protocols using hash functions
- Computationally Sound Symbolic Secrecy in the Presence of Hash Functions
- Computationally Sound Typing for Non-interference: The Case of Deterministic Encryption
- Computationally sound implementations of equational theories against passive adversaries
- Cryptographically Sound Implementations for Communicating Processes
- Cryptographically sound implementations for typed information-flow security
- Cryptographically-Masked Flows
- Cryptography in the Multi-string Model
- Deciding Key Cycles for Security Protocols
- Explicit randomness is not necessary when modeling probabilistic encryption
- FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
- Foundations of Software Science and Computation Structures
- Foundations of Software Science and Computation Structures
- Foundations of Software Science and Computation Structures
- Fundamentals of Computation Theory
- How to prove security of communication protocols? A discussion on the soundness of formal models w.r.t. computational ones.
- Information Security and Cryptology - ICISC 2003
- On Simulatability Soundness and Mapping Soundness of Symbolic Cryptography
- On the computational soundness of cryptographically masked flows
- On the relationships between notions of simulation-based security
- Programming Languages and Systems
- Programming Languages and Systems
- Protocol composition logic (PCL)
- Reconciling two views of cryptography (The computational soundness of formal encryption)
- Security analysis of cryptographically controlled access to XML documents
- Sound and complete computational interpretation of symbolic hashes in the standard model
- The reactive simulatability (RSIM) framework for asynchronous systems
- Theory of Cryptography
- Theory of Cryptography
- Theory of Cryptography
- Time-Bounded Task-PIOAs: A Framework for Analyzing Security Protocols
Cited in
(24)- Formalization and analysis of the post-quantum signature scheme FALCON with Maude
- How to prove security of communication protocols? A discussion on the soundness of formal models w.r.t. computational ones.
- An equation-based classical logic
- Bayesian authentication: quantifying security of the Hancke-Kuhn protocol
- Certified security proofs of cryptographic protocols in the computational model: an application to intrusion resilience
- CryptoSolve: towards a tool for the symbolic analysis of cryptographic algorithms
- Universally composable symbolic security analysis
- Computational soundness of symbolic analysis for protocols using hash functions
- Logical formalisation and analysis of the Mifare Classic card in PVS
- Towards symbolic encryption schemes
- Model Checking Security Protocols
- Probabilistic functions and cryptographic oracles in higher order logic
- Security protocol verification: symbolic and computational models
- 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
- Theory of Cryptography
- Probabilistic logic over equations and domain restrictions
- Computational Science and Its Applications – ICCSA 2004
- Out of oddity -- new cryptanalytic techniques against symmetric primitives optimized for integrity proof systems
- Theory of Cryptography
- Computationally Sound Symbolic Analysis of Probabilistic Protocols with Ideal Setups
- A quantitative study of two attacks
- A survey of symbolic methods for establishing equivalence-based properties in cryptographic protocols
- About models of security 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)
