Computationally Sound Symbolic Analysis of Probabilistic Protocols with Ideal Setups
From MaRDI portal
Recommendations
Cites work
- A Probabilistic Applied Pi–Calculus
- Advances in Cryptology - CRYPTO 2003
- Deciding knowledge in security protocols under equational theories
- FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
- How to prove security of communication protocols? A discussion on the soundness of formal models w.r.t. computational ones.
- scientific article; zbMATH DE number 2242582 (Why is no real title available?)
- Mobile values, new names, and secure communication
- Programming Languages and Systems
- Theory of Cryptography
- Theory of Cryptography
Cited in
(6)- Explicit randomness is not necessary when modeling probabilistic encryption
- How to prove security of communication protocols? A discussion on the soundness of formal models w.r.t. computational ones.
- Computationally Sound Analysis of a Probabilistic Contract Signing Protocol
- Symbolic Verification of Communicating Systems with Probabilistic Message Losses: Liveness and Fairness
- Computational Semantics for First-Order Logical Analysis of Cryptographic Protocols
- A survey of symbolic methods in computational analysis of cryptographic systems
This page was built for publication: Computationally Sound Symbolic Analysis of Probabilistic Protocols with Ideal Setups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5505468)