A probabilistic polynomial-time calculus for analysis of cryptographic protocols (preliminary report)

DOI10.1016/S1571-0661(04)80968-XMaRDI QIDQ4917062zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

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)

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

Cites work

• scientific article; zbMATH DE number 42752 (Why is no real title available?)
• scientific article; zbMATH DE number 1251177 (Why is no real title available?)
• scientific article; zbMATH DE number 1962758 (Why is no real title available?)
• scientific article; zbMATH DE number 1487486 (Why is no real title available?)
• scientific article; zbMATH DE number 1759457 (Why is no real title available?)
• scientific article; zbMATH DE number 1759796 (Why is no real title available?)
• scientific article; zbMATH DE number 861531 (Why is no real title available?)
• scientific article; zbMATH DE number 2242582 (Why is no real title available?)
• A calculus for cryptographic protocols: The spi calculus
• A public key cryptosystem and a signature scheme based on discrete logarithms
• Bisimulation through probabilistic testing
• Mobile values, new names, and secure communication
• Modern cryptography, probabilistic proofs and pseudo-randomness
• Reactive, generative, and stratified models of probabilistic processes
• Three systems for cryptographic protocol analysis
• Using encryption for authentication in large networks of computers

Cited in

(29)

• On using probabilistic Turing machines to model participants in cryptographic protocols
• A calculus for secure channel establishment in open networks
• A computational interpretation of Dolev-Yao adversaries
• A cryptographically sound Dolev-Yao style security proof of the Otway-Rees protocol
• Cryptographically sound security proofs for basic and public-key Kerberos
• scientific article; zbMATH DE number 697830 (Why is no real title available?)
• scientific article; zbMATH DE number 1487486 (Why is no real title available?)
• 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
• A denotational approach to the static analysis of cryptographic processes
• Composition of cryptographic protocols in a probabilistic polynomial-time process calculus.
• 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
• scientific article; zbMATH DE number 1692932 (Why is no real title available?)
• Automata, Languages and Programming
• 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
• scientific article; zbMATH DE number 1956549 (Why is no real title available?)
• 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)