A Probabilistic Polynomial-time Calculus For Analysis of Cryptographic Protocols

DOI10.1016/S1571-0661(04)80968-XzbMath1260.68109OpenAlexW1976791634MaRDI QIDQ4917062

John C. Mitchell, Ajith Ramanathan, Vanessa Teague, Andrej Scedrov

Publication date: 26 April 2013

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s1571-0661(04)80968-x

Mathematics Subject Classification ID

Cryptography (94A60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (12)

A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols ⋮ The reactive simulatability (RSIM) framework for asynchronous systems ⋮ Unifying simulatability definitions in cryptographic systems under different timing assumptions ⋮ A survey of symbolic methods in computational analysis of cryptographic systems ⋮ Logics for reasoning about cryptographic constructions ⋮ A computational interpretation of Dolev-Yao adversaries ⋮ On the relationships between notions of simulation-based security ⋮ A Process Algebra for Reasoning About Quantum Security ⋮ A Cryptographically Sound Dolev-Yao Style Security Proof of the Otway-Rees Protocol ⋮ Cryptographically Sound Security Proofs for Basic and Public-Key Kerberos ⋮ Limits of the BRSIM/UC Soundness of Dolev-Yao Models with Hashes ⋮ Machine-Checked Security Proofs of Cryptographic Signature Schemes

Cites Work

• Bisimulation through probabilistic testing
• Modern cryptography, probabilistic proofs and pseudo-randomness
• A calculus for cryptographic protocols: The spi calculus
• Three systems for cryptographic protocol analysis
• Reactive, generative, and stratified models of probabilistic processes
• A public key cryptosystem and a signature scheme based on discrete logarithms
• Using encryption for authentication in large networks of computers
• Mobile values, new names, and secure communication
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A Probabilistic Polynomial-time Calculus For Analysis of Cryptographic Protocols