A probabilistic polynomial-time calculus for analysis of cryptographic protocols (preliminary report)
DOI10.1016/S1571-0661(04)80968-XzbMATH Open1260.68109OpenAlexW1976791634MaRDI QIDQ4917062FDOQ4917062
Authors: John Mitchell, Ajith Ramanathan, Andre Scedrov, Vanessa Teague 
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
Recommendations
- A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols
- scientific article; zbMATH DE number 1692932
- scientific article; zbMATH DE number 1487486
- Composition of cryptographic protocols in a probabilistic polynomial-time process calculus.
- A calculus for cryptographic protocols: The spi calculus
Cryptography (94A60) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- A public key cryptosystem and a signature scheme based on discrete logarithms
- Title not available (Why is that?)
- Bisimulation through probabilistic testing
- A calculus for cryptographic protocols: The spi calculus
- Mobile values, new names, and secure communication
- Reactive, generative, and stratified models of probabilistic processes
- Using encryption for authentication in large networks of computers
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Modern cryptography, probabilistic proofs and pseudo-randomness
- Title not available (Why is that?)
- Title not available (Why is that?)
- Three systems for cryptographic protocol analysis
Cited In (29)
- On using probabilistic Turing machines to model participants in cryptographic protocols
- A calculus for secure channel establishment in open networks
- A cryptographically sound Dolev-Yao style security proof of the Otway-Rees protocol
- Cryptographically sound security proofs for basic and public-key Kerberos
- A computational interpretation of Dolev-Yao adversaries
- Title not available (Why is that?)
- Title not available (Why is that?)
- Foundations of Software Science and Computation Structures
- On equivalences, metrics, and polynomial time
- On the relationships between notions of simulation-based security
- A process algebra for reasoning about quantum security
- Limits of the BRSIM/UC soundness of Dolev-Yao models with hashes
- Trustworthy Global Computing
- Logics for reasoning about cryptographic constructions
- Conditional automata: a tool for safe removal of negligible events
- Composition of cryptographic protocols in a probabilistic polynomial-time process calculus.
- A denotational approach to the static analysis of cryptographic processes
- A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols
- The reactive simulatability (RSIM) framework for asynchronous systems
- On quantitative analysis of probabilistic protocols
- Machine-checked security proofs of cryptographic signature schemes
- Automata, Languages and Programming
- Title not available (Why is that?)
- Computational Semantics for First-Order Logical Analysis of Cryptographic Protocols
- A framework for analyzing probabilistic protocols and its application to the partial secrets exchange
- A survey of symbolic methods in computational analysis of cryptographic systems
- Unifying simulatability definitions in cryptographic systems under different timing assumptions
- Title not available (Why is that?)
- Mathematical Foundations of Computer Science 2003
This page was built for publication: A probabilistic polynomial-time calculus for analysis of cryptographic protocols (preliminary report)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4917062)
