I'll introduce you to logics, and more precisely to proof theory -- starting with a short explaination of how this is different from all the domains that one might call "logic". We focus on the structure of formal deduction systems, around the cut-elimination theorem. Along this line we present three systems featuring more and more symmetries: natural deduction for intuitionistic logic, sequent calculus for classical logic and finally linear logic. We shall explain what are the advantages from the point of view of proof-search, and relate that to the research topics of my team, Parsifal.
Anonymity is a particular kind of security property where we're not interested in hiding the data itself but the link between the data and the person who sent or received it. This difference, with respect to "traditional" security protocols, creates the need for specialized protocols where probabilistic choices play an important role. In this talk I will make a high-level presentation of this area: I will discuss about the main types of anonymity protocols that are found in the literature, the anonymity guarantees that each of them provides and some attacks that one should be aware of when designing such protocols. I will finally talk briefly about some recent work on a framework for analyzing such protocols.
I will try to keep the talk at an abstract level: the goal will be to present the area and its challenges, instead of technical details, so no use of "greek letter"-calculi will be made.