A survey of symbolic methods in computational analysis of cryptographic systems
type: Item
instance of: scholarly article
title: A survey of symbolic methods in computational analysis of cryptographic systems
zbMATH Open document ID: 1213.94093
author: Véronique Cortier
author: Steve Kremer
author: Bogdan Warinschi
published in: Journal of Automated Reasoning
publication date: 2011-06-03T00:00:00Z
full work available at URL: RR-6912.pdf
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 5903833
zbMATH Keywords: symbolic methods
zbMATH Keywords: computational analysis
zbMATH Keywords: cryptography
zbMATH Keywords: security protocol
MaRDI profile type: Publication
OpenAlex ID: W2091877728
cites work: Foundations of Software Science and Computation Structures
cites work: Computational Secrecy by Typing for the Pi Calculus
cites work: Cryptographically Sound Implementations for Communicating Processes
cites work: Cryptographically-Masked Flows
cites work: Q4536407
cites work: Reconciling two views of cryptography (The computational soundness of formal encryption)
cites work: Automata, Languages and Programming
cites work: Security analysis of cryptographically controlled access to XML documents
cites work: Computationally sound implementations of equational theories against passive adversaries
cites work: Automated Reasoning
cites work: On Simulatability Soundness and Mapping Soundness of Symbolic Cryptography
cites work: Circular-Secure Encryption from Decision Diffie-Hellman
cites work: Q4808837
cites work: A Generalization of DDH with Applications to Protocol Analysis and Computational Soundness
cites work: FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
cites work: Automated Security Proofs with Sequences of Games
cites work: The reactive simulatability (RSIM) framework for asynchronous systems
cites work: Q4413854
cites work: Time-Bounded Task-PIOAs: A Framework for Analyzing Security Protocols
cites work: Computationally Sound Typing for Non-interference: The Case of Deterministic Encryption
cites work: Theory of Cryptography
cites work: Explicit randomness is not necessary when modeling probabilistic encryption
cites work: Computationally Sound Symbolic Secrecy in the Presence of Hash Functions
cites work: Q3113670
cites work: Programming Languages and Systems
cites work: Deciding Key Cycles for Security Protocols
cites work: Protocol composition logic (PCL)
cites work: Cryptographically sound implementations for typed information-flow security
cites work: A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
cites work: Cryptography in the Multi-string Model
cites work: Sound and complete computational interpretation of symbolic hashes in the standard model
cites work: A computational interpretation of Dolev-Yao adversaries
cites work: Advances in Cryptology - CRYPTO 2003
cites work: Computational soundness of symbolic analysis for protocols using hash functions
cites work: On the relationships between notions of simulation-based security
cites work: Q2763667
cites work: Q4417891
cites work: On the computational soundness of cryptographically masked flows
cites work: Information Security and Cryptology - ICISC 2003
cites work: Fundamentals of Computation Theory
cites work: A Probabilistic Polynomial-time Calculus For Analysis of Cryptographic Protocols
cites work: A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols
DOI: 10.1007/S10817-010-9187-9
description: scientific article; zbMATH DE number 5903833