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

  Browse A-Z

Log in

Googledetails Microsoftdetails

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

Bounds on proof size in security verification

Download to your calendar using vCal

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:

Note that ex-directory lists are not shown.

Other lists

Pavillion E CRUK CI Lecture Theatre Michaelhouse Cafe, Trinity Street, Cambridge CB2 1SU

Other talks

Afternoon Break C2D3 Computational Biology Annual Symposium 2026 Title to be confirmed Group Work Title to be confirmed Chemical strategies for biomolecule functionalisation, and biomaterial conjugation
 

Š 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity