Probabilistic polynomial-time semantics for a protocol security logic

DOI10.1007/11523468_2MaRDI QIDQ5716777zbMATH OpenOpenAlexFDO

Authors Anupam Datta, Ante Derek, John Mitchell, Vitaly Shmatikov, Mathieu Turuani

Publication date 10 January 2006

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

Full work available at URL https://doi.org/10.1007/11523468

Mathematics Subject Classification ID

Network protocols (68M12) Data encryption (aspects in computer science) (68P25)

Recommendations

• Probabilistic polynomial-time process calculus and security protocol analysis
• Computational Semantics for First-Order Logical Analysis of Cryptographic Protocols
• A probabilistic polynomial-time calculus for analysis of cryptographic protocols (preliminary report)
• A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols
• Probabilistic annotations for protocol models. Dedicated to Joshua Guttman

Cited in

(20)

• Computationally sound implementations of equational theories against passive adversaries
• Probabilistic annotations for protocol models. Dedicated to Joshua Guttman
• A framework for analyzing probabilistic protocols and its application to the partial secrets exchange
• The reactive simulatability (RSIM) framework for asynchronous systems
• Probabilistic Termination and Composability of Cryptographic Protocols
• Protocol composition logic (PCL)
• Exogenous probabilistic computation tree logic
• Bayesian authentication: quantifying security of the Hancke-Kuhn protocol
• An epistemic foundation for authentication logics (extended abstract)
• Computational Semantics for First-Order Logical Analysis of Cryptographic Protocols
• Probabilistic polynomial-time equivalence and security analysis
• A logical approach to multilevel security of probabilistic systems
• Foundations of Software Science and Computation Structures
• A survey of symbolic methods in computational analysis of cryptographic systems
• Unwinding Possibilistic Security Properties
• Cryptographically sound security proofs for basic and public-key Kerberos
• Limits of the BRSIM/UC soundness of Dolev-Yao models with hashes
• Soundness of Formal Encryption in the Presence of Key-Cycles
• Compositional analysis of contract-signing protocols
• An anytime deduction algorithm for the probabilistic logic and entailment problems

This page was built for publication: Probabilistic polynomial-time semantics for a protocol security logic

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