From 34f1d293e3e02ae7ca2370be17e4a13f15eac71c Mon Sep 17 00:00:00 2001
From: Teresa Carbajo-Garcia <t.carbajo-garcia@imperial.ac.uk>
Date: Tue, 17 Apr 2018 16:08:01 +0100
Subject: [PATCH] Add new file, experiment with post pre dated to see if it
 will upload

---
 _posts/2018-04-23- felix-stutz.md | 26 ++++++++++++++++++++++++++
 1 file changed, 26 insertions(+)
 create mode 100644 _posts/2018-04-23- felix-stutz.md

diff --git a/_posts/2018-04-23- felix-stutz.md b/_posts/2018-04-23- felix-stutz.md
new file mode 100644
index 0000000..b4cb18a
--- /dev/null
+++ b/_posts/2018-04-23- felix-stutz.md	
@@ -0,0 +1,26 @@
+---
+title: Welcome to Felix Stutz
+---
+
+We are very pleased to welcome Felix Stutz, an MSc student at the [International 
+Max Planck Research School for Computer Science](http://www.imprs-cs.de/index.html), 
+who is due to spend five months with the group, working with Emanuele D'Osualdo 
+on Ideal completions for Verification of Cryptographic Protocols. 
+
+
+These protocols are distributed programs that are designed to achieve secure 
+communications using cryptography; they are notoriously very tricky to design 
+and reasoning about the security properties of these protocols requires proving 
+that no malicious intruder can hack the protocol to gain sensitive information, 
+e.g. your emails.
+
+In fact, every time you log in to your email account, make an online payment or 
+connect to a secure Wi-Fi (and in many other scenarios!) the communication is 
+made secure under the hood by the use of such cryptographic protocols. 
+The project's goal is to develop new algorithms to verify that a protocol does 
+not leak any secret.
+
+For the theoretical basis for the project please see 
+[this paper](http://www.emanueledosualdo.com/research/papers/2017/csf-decidable-secrecy.html) 
+by D'Osualdo and others, which proposes a new approach for model checking 
+cryptographic protocols.
\ No newline at end of file
-- 
GitLab