Proving Group Protocols Secure Against Eavesdroppers (Q3541693): Difference between revisions

@@ Property / cites work @@
+Round-Optimal Contributory Conference Key Agreement
+Normal rank
@@ Property / cites work @@
+Tree Automata with Memory, Visibility and Structural Constraints
+Normal rank
@@ Property / cites work @@
+Visibly Tree Automata with Memory and Constraints
@@ Property / cites work: Visibly Tree Automata with Memory and Constraints / rank @@
+Normal rank
@@ Property / cites work @@
+Termination of rewriting
@@ Property / cites work: Termination of rewriting / rank @@
+Normal rank
@@ Property / cites work @@
+On the security of public key protocols
@@ Property / cites work: On the security of public key protocols / rank @@
+Normal rank
@@ Property / cites work @@
+Advances in Cryptology - CRYPTO 2003
@@ Property / cites work: Advances in Cryptology - CRYPTO 2003 / rank @@
+Normal rank
@@ Property / cites work @@
+Proving Group Protocols Secure Against Eavesdroppers
+Normal rank
@@ Property / cites work @@
+On the Automatic Analysis of Recursive Security Protocols with XOR
+Normal rank
@@ Property / cites work @@
+Attacking group protocols by refuting incorrect inductive conjectures
+Normal rank
@@ Property / cites work @@
+CONCUR 2005 – Concurrency Theory
@@ Property / cites work: CONCUR 2005 – Concurrency Theory / rank @@
+Normal rank