The INI has a new website!

This is a legacy webpage. Please visit the new site to ensure you are seeing up to date information.

Skip to content



Bounds on proof size in security verification

Ramanujam, R (Institute of Mathematical Sciences, Chennai)
Thursday 31 May 2012, 16:00-16:30

Seminar Room 1, Newton Institute


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).


[pdf ]


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.

Back to top ∧