COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. |

University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > Bounds on proof size in security verification

## Bounds on proof size in security verificationAdd to your list(s) Download to your calendar using vCal - Ramanujam, R (Institute of Mathematical Sciences, Chennai)
- Thursday 31 May 2012, 16:00-16:30
- Seminar Room 1, Newton Institute.
If you have a question about this talk, please contact Mustapha Amrani. Semantics and Syntax: A Legacy of Alan Turing 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). This talk is part of the Isaac Newton Institute Seminar Series series. ## This talk is included in these lists:- All CMS events
- Featured lists
- INI info aggregator
- Isaac Newton Institute Seminar Series
- School of Physical Sciences
- Seminar Room 1, Newton Institute
- bld31
Note that ex-directory lists are not shown. |
## Other listsDPMMS Lists Rethinking Life Type the title of a new list here## Other talksElizabeth Bowen's Writings of the Second World War HE@Cam Seminar: Anna Heath - Value of Sample Information as a Tool for Clinical Trial Design Making a Crowdsourced Task Attractive: Measuring Workers Pre-task Interactions Faster C++ |