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

Information, Anonymity, and Proof

Add to your list(s) 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.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2024, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity