Pages that link to "Item:Q3323837"
From MaRDI portal
The following pages link to On the security of ping-pong protocols (Q3323837):
Displaying 16 items.
- A general scheme for information interception in the ping-pong protocol (Q310429) (← links)
- Revisiting the security of secure direct communication based on ping-pong protocol (Q544828) (← links)
- On the complexity of some extended word problems defined by cancellation rules (Q578921) (← links)
- Ping-pong protocols as prefix grammars: modelling and verification via program transformation (Q739638) (← links)
- Decidability issues for extended ping-pong protocols (Q861694) (← links)
- On the security of name-stamp protocols (Q1071729) (← links)
- On the verifiability of two-party algebraic protocols (Q1083426) (← links)
- On the security of p-party protocols (Q1102922) (← links)
- A collusion problem and its solution (Q1383158) (← links)
- Interconvertibility of a class of set constraints and context-free-language reachability (Q1583350) (← links)
- Tree automata with one memory set constraints and cryptographic protocols (Q1770429) (← links)
- On the symbolic reduction of processes with cryptographic functions. (Q1853612) (← links)
- Cancellation rules and extended word problems (Q2266586) (← links)
- A sufflcient condition for secure ping-pong protocols (Q2844117) (← links)
- Model Checking Security Protocols (Q3176380) (← links)
- Chasing Diagrams in Cryptography (Q5414973) (← links)