On the security of ping-pong protocols
From MaRDI portal
Recommendations
Cited in
(25)- On the security of name-stamp protocols
- On the verifiability of two-party algebraic protocols
- On the security of p-party protocols
- A collusion problem and its solution
- Interconvertibility of a class of set constraints and context-free-language reachability
- Tree automata with one memory set constraints and cryptographic protocols
- On the symbolic reduction of processes with cryptographic functions.
- Game-theoretic perspective of Ping-Pong protocol
- Cancellation rules and extended word problems
- A sufflcient condition for secure ping-pong protocols
- A general scheme for information interception in the ping-pong protocol
- Model Checking Security Protocols
- AN INTELLIGENT SECURITY AGENT FOR A RELIABLE CIPHER SYSTEM USING PINGPONG
- Monotonic Set-Extended Prefix Rewriting and Verification of Recursive Ping-Pong Protocols
- On the Security of Ping-Pong Protocols
- scientific article; zbMATH DE number 3920370 (Why is no real title available?)
- scientific article; zbMATH DE number 3963720 (Why is no real title available?)
- scientific article; zbMATH DE number 2036574 (Why is no real title available?)
- Chasing diagrams in cryptography
- Revisiting the security of secure direct communication based on ping-pong protocol
- On the complexity of some extended word problems defined by cancellation rules
- On the security of the ping-pong protocol
- Automata equipped with auxiliary data structures and regular realizability problems
- Ping-pong protocols as prefix grammars: modelling and verification via program transformation
- Decidability issues for extended ping-pong protocols
This page was built for publication: On the security of ping-pong protocols
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3323837)