Update 2017-06-13-cade.md

_posts/2017-06-13-cade.md → _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.