University of Cambridge > Talks.cam > Computer Laboratory Automated Reasoning Group Lunches > Information, Anonymity, and Proof

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

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

ℹī¸ Information

Information, Anonymity, and Proof

Download to your calendar using vCal

If you have a question about this talk, please contact Thomas Tuerk .

This presentation will demonstrate how Shannon’s Information Theory can be used to prove anonymity properties in the HOL4 theorem-prover. The talk will begin by outlining a formalization of Information Theory in HOL4 . Building on this formalization, a method for information-leakage analysis in HOL4 will be presented. As a case study, this method will be used to prove the anonymity of the dining cryptographers protocol.

This presentation will firstly a formalization of Shannon’s Information Theory in HOL4 .

This talk is part of the Computer Laboratory Automated Reasoning Group Lunches series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Faculty of Classics tbc Centre for Mathematical Sciences Location: Your choice! See email reminders or "Attending Lectures" for details of how to join in.

Other talks

Kirk Public Lecture | A proxy window into the beautiful and challenging world of causal attribution The Magic of Magnetism Ensemble inequivalence for systems with long-range interactions Angular analyses of b -> s ee decays at LHCb Atmospheric Methane - rise, surge, and ongoing post-surge growth. Can we mitigate the rise, and can anything be done to reduce emissions? Packing the Border: Quail Crates and the Regulation of Animal Movement on the US-Mexico Border, 1910s-1940s
 

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