Instructor : Prof. Guillaume Scerri
Class 1
Kerckhoff's principle
The system should be, if not mathematically unbreakable, then unbreakable in practise
In this course we assume cryptography is secure.
Process algebra
Running example sign sign
syntax
(infinite) set of variables infinite set of names set of function symbols set of indices
Defintion
The terms built on is defined as
Elementary Processes
if then P if
Composition of Elementary Protocols
where second one denotes parallel, and third one is replication
We consider protocols up to commutativity and associativity of parallel and replication.
We need some renaming now.
Definition : for P in which every instance of i is replaced by k
Channels used in P names used in P free variables used in P
semantics
what do we mean by computation and messages?
term semantics
Domain of messages , for example, in Turing Machines, it would be strings of bits.
def : is an interpretation of messages for is substitution of terms when if , otherwise Satisfied if
Attacker
An attacker is a function
Traces
A protocol state is a triple with p protocol, We assume the free variables of the protocol are distinct from the bound variables.
ded here