From 3e085d34172f520a13d96cfdc20c7e8f55dbdb9b Mon Sep 17 00:00:00 2001
From: Teresa Carbajo-Garcia <t.carbajo-garcia@imperial.ac.uk>
Date: Tue, 13 Jun 2017 15:17:37 +0100
Subject: [PATCH] Update 2017-06-13-cade.md
---
_posts/{2017-06-13-cade.md => 2017-06-13-csf.md} | 4 ++--
1 file changed, 2 insertions(+), 2 deletions(-)
rename _posts/{2017-06-13-cade.md => 2017-06-13-csf.md} (89%)
diff --git a/_posts/2017-06-13-cade.md b/_posts/2017-06-13-csf.md
similarity index 89%
rename from _posts/2017-06-13-cade.md
rename to _posts/2017-06-13-csf.md
index 6345cba..6f89b2a 100644
--- a/_posts/2017-06-13-cade.md
+++ b/_posts/2017-06-13-csf.md
@@ -7,8 +7,8 @@ Emanuele's paper, in collaboration with [Luke Ong](http://www.cs.ox.ac.uk/luke.o
Nanyang Technological University, Singapore, is entitled ['Deciding Secrecy of Security Protocols for an Unbounded Number of Sessions: The Case of Depth-bounded Processes'](http://www.emanueledosualdo.com/research/papers/2017/csf-decidable-secrecy.html)
In the paper, the authors introduce a new class of security protocols with an unbounded number of sessions and unlimited fresh data
-for which the problem of secrecy is decidable. The only constraint we place on the class is a notion of depth-boundedness.
-Precisely we prove that, restricted to messages of up to a given size, secrecy is decidable for all depth-bounded processes.
+for which the problem of secrecy is decidable. The only constraint placed on the class is a notion of depth-boundedness.
+They prove that, restricted to messages of up to a given size, secrecy is decidable for all depth-bounded processes.
This decidable fragment of security protocols captures many real-world symmetric key protocols, including Needham-Schroeder Symmetric Key,
Otway-Rees, and Yahalom.
--
GitLab