Bounding Messages for Free in Security Protocols (Q5458850): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-540-77050-3_31
+Normal rank
@@ Property / OpenAlex ID @@
+W1501813649
@@ Property / OpenAlex ID: W1501813649 / rank @@
+Normal rank
@@ Property / cites work @@
+Bounding Messages for Free in Security Protocols
@@ Property / cites work: Bounding Messages for Free in Security Protocols / rank @@
+Normal rank
@@ Property / cites work @@
+Verification of cryptographic protocols: tagging enforces termination
+Normal rank
@@ Property / cites work @@
+Tree automata with one memory set constraints and cryptographic protocols
+Normal rank
@@ Property / cites work @@
+Safely Composing Security Protocols
@@ Property / cites work: Safely Composing Security Protocols / rank @@
+Normal rank
@@ Property / cites work @@
+Computer Science Logic
@@ Property / cites work: Computer Science Logic / rank @@
+Normal rank
@@ Property / cites work @@
+Deciding Key Cycles for Security Protocols
@@ Property / cites work: Deciding Key Cycles for Security Protocols / rank @@
+Normal rank
@@ Property / cites work @@
+Q4418589
@@ Property / cites work: Q4418589 / rank @@
+Normal rank
@@ Property / cites work @@
+FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:5458850