A probabilistic polynomial-time calculus for analysis of cryptographic protocols (preliminary report)
From MaRDI portal
Publication:4917062
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)- A denotational approach to the static analysis of cryptographic processes
- A survey of symbolic methods in computational analysis of cryptographic systems
- A cryptographically sound Dolev-Yao style security proof of the Otway-Rees protocol
- Cryptographically sound security proofs for basic and public-key Kerberos
- Foundations of Software Science and Computation Structures
- On using probabilistic Turing machines to model participants in cryptographic protocols
- A computational interpretation of Dolev-Yao adversaries
- Automata, Languages and Programming
- Unifying simulatability definitions in cryptographic systems under different timing assumptions
- Logics for reasoning about cryptographic constructions
- A framework for analyzing probabilistic protocols and its application to the partial secrets exchange
- Mathematical Foundations of Computer Science 2003
- Limits of the BRSIM/UC soundness of Dolev-Yao models with hashes
- On the relationships between notions of simulation-based security
- scientific article; zbMATH DE number 697830 (Why is no real title available?)
- scientific article; zbMATH DE number 1487486 (Why is no real title available?)
- A calculus for secure channel establishment in open networks
- On quantitative analysis of probabilistic protocols
- Machine-checked security proofs of cryptographic signature schemes
- scientific article; zbMATH DE number 1956549 (Why is no real title available?)
- scientific article; zbMATH DE number 1692932 (Why is no real title available?)
- Conditional automata: a tool for safe removal of negligible events
- Computational Semantics for First-Order Logical Analysis of Cryptographic Protocols
- A process algebra for reasoning about quantum security
- A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols
- On equivalences, metrics, and polynomial time
- The reactive simulatability (RSIM) framework for asynchronous systems
- Trustworthy Global Computing
- Composition of cryptographic protocols in a probabilistic polynomial-time process calculus.
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)
