Probabilistic polynomial-time process calculus and security protocol analysis

DOI10.1007/3-540-45309-1_2MaRDI QIDQ2763664zbMATH OpenFDO

Authors John Mitchell

Publication date 21 January 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2028/20280023

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Data encryption (aspects in computer science) (68P25)

Recommendations

• A probabilistic polynomial-time calculus for analysis of cryptographic protocols (preliminary report)
• A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols
• Composition of cryptographic protocols in a probabilistic polynomial-time process calculus.
• Probabilistic polynomial-time equivalence and security analysis
• Foundations of Software Science and Computation Structures

Cited in

(19)

• Probabilistic annotations for protocol models. Dedicated to Joshua Guttman
• Using probabilistic automata for security protocols verification
• A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols
• A framework for analyzing probabilistic protocols and its application to the partial secrets exchange
• Probabilistic Termination and Composability of Cryptographic Protocols
• On quantitative analysis of probabilistic protocols
• Calculus of cooperation and game-based reasoning about protocol privacy
• Process algebra contexts and security properties
• Time-Bounded Task-PIOAs: A Framework for Analyzing Security Protocols
• scientific article; zbMATH DE number 697830 (Why is no real title available?)
• Probabilistic polynomial-time equivalence and security analysis
• A probabilistic polynomial-time calculus for analysis of cryptographic protocols (preliminary report)
• Foundations of Software Science and Computation Structures
• Trustworthy Global Computing
• A Declarative Framework for Security: Secure Concurrent Constraint Programming
• Logic Programming
• Automata, Languages and Programming
• Composition of cryptographic protocols in a probabilistic polynomial-time process calculus.
• Cryptographically-masked flows

This page was built for publication: Probabilistic polynomial-time process calculus and security protocol analysis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2763664)