BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Privacy preserving censorship - Yvo Desmedt\, Department of Comput
 er Science\, University College London
DTSTART:20070123T161500Z
DTEND:20070123T171500Z
UID:TALK6044@talks.cam.ac.uk
CONTACT:Saar Drimer
DESCRIPTION:In many Western countries information is being censored or pla
 ns are being made. In Australia\, the Australian Communications Minister H
 elen Coonan has suggested to censor the internet TV program Big Brother.  
 Moreover two books are censored.  In Belgium the Information Minister Pete
 r Vanvelthoven is looking into "censoring websites with illegal content or
  with illegal services" (translated from the official Belgian memorandum) 
 or at least to "inform customers that they entered a black listed site".  
 Critics remember that before 1966 it was hard in small Belgian villages to
  buy books that were on the Vatican "Index Librorum Prohibitorum" blacklis
 t. Other examples of censorship in the West include the censorship: by the
  church of ``non-traditional'' gospels\, Hitler's ``Mein Kampf'' in countr
 ies as France and Germany\, and the Rolling Stones performance during the 
 2006 superbowl on 5 February 2006 in the US. Texts describing in details t
 he construction of atomic bombs\, or other classified information\, are al
 so censored.\n\nWhether censorship is a benefit to mankind or not\, is a n
 on-scientific topic\, and therefore not the focus of the presentation. In 
 this talk we discuss methods that can be used to censor networks. A proble
 m with a straightforward solution is that censorship techniques might be u
 sed by terrorist or hackers who want to perform a denial of service attack
 . We therefore analyze how telecommunication providers can guarantee priva
 cy on how to censor (i.e. protecting against hackers with limited resource
 s using it to perform a denial of service) while at the same time being ab
 le to demonstrate to the authorities the capability to censor. Above is im
 possible when using traditional models to describe network reliability. We
  discuss an alternative model in which it can be achieved. We propose a ze
 ro-knowledge interactive proof for this problem.\n\nNo background informat
 ion is required to be able to understand most of the lecture. This present
 ation is based on joint work with Yongge Wang and Mike Burmester and prese
 nted at the First International Workshop on Critical Information Infrastru
 ctures Security.\n\nSHORT BIO:\n\nYvo Desmedt received his Ph.D. (Summa cu
 m Laude) from the University of Leuven\, Belgium (1984).  He is presently 
 the BT Chair of Information Security at University College London\, UK. He
  is also a courtesy professor at Florida State University. His interests i
 nclude cryptography\, network security and computer security. He is progra
 m chair of the Workshop on Information Theoretic Security 2007\, was co-pr
 ogram chair of CANS 2005\, program chair of PKC 2003\, the 2002 ACM Worksh
 op on Scientific Aspects of Cyber Terrorism and Crypto '94. He is editor-i
 n-chief of the IEE Proceedings of Information Security\, editor of the Jou
 rnal of Computer Security\, of Information Processing Letters and of Advan
 ces in Mathematics of Communications.  He has given invited lectures at se
 veral conferences and workshop in 5 different continents.\n\n
LOCATION:Lecture Theatre 2\, Computer Laboratory\, William Gates Building
END:VEVENT
END:VCALENDAR