University of Cambridge > Talks.cam > Logic and Semantics Seminar (Computer Laboratory) > Bounds on proof size and distributive encryption

  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 and distributive encryption

Download to your calendar using vCal

If you have a question about this talk, please contact Bjarki Holm .

Note that this talk will be in FW26 rather than the usual room.

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 (subject to some equations). This is typically in polynomial time but when encryption is distributive over one of the other operators, it gets difficult: we show that the problem is DEXPTIME -complete by obtaining bounds on proof size. This is to be contrasted with distributive encryption in the presence of an abelian group operator where only a non-elementary upper bound is known.

This talk is part of the Logic and Semantics Seminar (Computer Laboratory) series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Old Combination Room, Wolfson College Meeting the Challenge of Healthy Ageing in the 21st Century MR5, Centre for Mathematical Sciences, Wilberforce Road, Cambridge

Other talks

Organiser Welcome Group Work The Importance of Teaching about Science and Religion in a Time of Global Uncertainty Cambridge RNA Club - IN PERSON Morning Break Feedback and the circumgalactic medium
 

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