Information, Anonymity, and Proof

Add to your list(s) Download to your calendar using vCal

• Aaron Coble (University of Cambridge)
• Tuesday 06 May 2008, 13:00-14:00
• Computer Laboratory, William Gates Building, Room SS03.

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:

• All Talks (aka the CURE list)
• Cambridge talks
• Computer Laboratory Automated Reasoning Group Lunches
• Computer Laboratory, William Gates Building, Room SS03
• Department of Computer Science and Technology talks and seminars
• Interested Talks
• School of Technology
• Trust & Technology Initiative - interesting events
• bld31
• yk373's list

Note that ex-directory lists are not shown.