Bounds on proof size and distributive encryption
Add to your list(s)
Download to your calendar using vCal
If you have a question about this talk, please contact Bjarki Holm.
Note that this talk will be in FW26 rather than the usual room.
In the formal analysis of security protocols, what the intruder infers from messages travelling on the network can be abstracted into checking whether a term is derivable in an inference system from a given finite set of terms (subject to some equations). This is typically in polynomial time but when encryption is distributive over one of the other operators, it gets difficult: we show that the problem is DEXPTIME complete by obtaining bounds on proof size. This is to be contrasted with distributive encryption in the presence of an abelian group operator where only a nonelementary upper bound is known.
This talk is part of the Logic and Semantics Seminar (Computer Laboratory) series.
This talk is included in these lists:
Note that exdirectory lists are not shown.
