skip to content
 

Bounds on proof size in security verification

Presented by: 
R Ramanujam Institute of Mathematical Sciences, Chennai
Date: 
Thursday 31st May 2012 - 16:00 to 16:30
Venue: 
INI Seminar Room 1
Abstract: 
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. Thus verification amounts (essentially) to studying bounds on proof size. We use this technique in the context of distributive encryption to show that the verification problem is DEXPTIME-complete. The work reported is joint with A. Baskar (Darmstadt) and S.P.Suresh (Chennai).
The video for this talk should appear here if JavaScript is enabled.
If it doesn't, something may have gone wrong with our embedded player.
We'll get it fixed as soon as possible.
Presentation Material: 
University of Cambridge Research Councils UK
    Clay Mathematics Institute London Mathematical Society NM Rothschild and Sons