Model Checking Security Protocols (Q3176380)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Model Checking Security Protocols	scientific article

Statements

scholarly article

0 references

Model Checking Security Protocols (English)

0 references

Handbook of Model Checking

0 references

publication date

20 July 2018

0 references

0 references

C. J. F. Cremers

0 references

Catherine A. Meadows

0 references

describes a project that uses

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-319-10575-8_22

0 references

Deciding knowledge in security protocols under equational theories

0 references

Mobile values, new names, and secure communication

0 references

A framework for compositional verification of security protocols

0 references

Computer Aided Verification

0 references

Term Rewriting and All That

0 references

Unification in the union of disjoint equational theories: Combining decision procedures

0 references

Limits of the Cryptographic Realization of Dolev-Yao-Style XOR

0 references

Limits of the BRSIM/UC Soundness of Dolev-Yao Models with Hashes

0 references

The reactive simulatability (RSIM) framework for asynchronous systems

0 references

Model Checking Probabilistic Systems

0 references

Degrees of Security: Protocol Guarantees in the Face of Compromising Adversaries

0 references

Provably Repairing the ISO/IEC 9798 Standard for Entity Authentication

0 references

Automated complexity analysis based on ordered resolution

0 references

Algebraic Intruder Deductions

0 references

Let’s Get Physical: Models and Methods for Real-World Security Protocols

0 references

YAPA: A Generic Tool for Computing Intruder Knowledge

0 references

Computationally sound implementations of equational theories against passive adversaries

0 references

Foundations of Software Science and Computation Structures

0 references

Automated verification of selected equivalences for security protocols

0 references

0 references

0 references

Computing Knowledge in Security Protocols under Convergent Equational Theories

0 references

All about Maude -- a high-performance logical framework. How to specify, program and verify systems in rewriting logic. With CD-ROM.

0 references

Term Rewriting and Applications

0 references

Verification: Theory and Practice

0 references

0 references

A survey of symbolic methods in computational analysis of cryptographic systems

0 references

On the security of ping-pong protocols

0 references

On the security of public key protocols

0 references

0 references

Maude-NPA: Cryptographic Protocol Analysis Modulo Equational Properties

0 references

Variant Narrowing and Equational Unification

0 references

0 references

0 references

0 references

Propositional SAT Solving

0 references

The NRL Protocol Analyzer: An Overview

0 references

0 references

On the freedom of decryption

0 references

Using encryption for authentication in large networks of computers

0 references

Partial-Order Reduction

0 references

Protocol insecurity with a finite number of sessions and composed keys is NP-complete.

0 references

Unification in permutative equational theories is undecidable

0 references

Programming Languages and Systems

0 references

A formal language for cryptographic protocol requirements

0 references

The CL-Atse Protocol Analyser

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-319-10575-8_22

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:3176380

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3176380&oldid=36410149"