BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Bounds on proof size in security verification - Ramanujam\, R (Ins
 titute of Mathematical Sciences\, Chennai)
DTSTART:20120531T150000Z
DTEND:20120531T153000Z
UID:TALK38375@talks.cam.ac.uk
CONTACT:Mustapha Amrani
DESCRIPTION:In the formal analysis of security protocols\, what the intrud
 er infers from messages travelling on the network can be abstracted into c
 hecking whether a term is derivable in an inference system from a given fi
 nite set of terms. Thus verification amounts (essentially) to studying bou
 nds on proof size. We use this technique in the context of distributive en
 cryption to show that the verification problem is DEXPTIME-complete. The w
 ork reported is joint with A. Baskar (Darmstadt) and S.P.Suresh (Chennai).
 \n
LOCATION:Seminar Room 1\, Newton Institute
END:VEVENT
END:VCALENDAR