COMPGA17 - Privacy Enhancing Technologies
This database contains the 2017-18 versions of syllabuses.
Note: Whilst every effort is made to keep the syllabus and assessment records correct, the precise details must be checked with the lecturer(s).
|Code||COMPGA17 (Also taught as COMPM067)|
|Prerequisites||No (COMPGA01 - Computer Security 1 recommended)|
|Taught By||George Danezis (100%)|
|Aims||Upon completion of the course the students are expected to be |
|Learning Outcomes||Key knowledge: |
The course covers in depth major issues in computer security related to protecting privacy as well as threats to the privacy of computer users. In particular is covers the theory and practice of:
(1) Private communications, anonymous communications, censorship circumvention and traffic analysis.
(2) Private authentication, selective disclosure credentials for identify management, and zero-knowledge proof techniques.
(3) Private statistics and computations through homomorphic encryption and secure multi-party computation and differential privacy.
Students are introduced to both privacy threats such as pervasive surveillance, profiling, location analysis, and traffic analysis, as well as the technical mitigation techniques relying on modern cryptography and differential privacy.
The course starts with an introduction to the social, economic and legal context of privacy protection, privacy policies and standard privacy practices. At the same time standard threats to on-line privacy such as profiling, and location analysis are discussed.
The course then covers in depth techniques to achieve strong private communications that hide both content and the meta-data associated with whom is talking to who (anonymous communications). These are studied in the context of private polling and elections.
The students are then introduced to techniques to mitigate abuses arising from anonymous communication, while preserving privacy, through the use of private authentication, and selective disclosure credentials that can be used to build digital cash systems. The engineering of zero-knowledge proofs and their use as building blocks of privacy enhancing technologies will be studied in detail.
Finally, students are introduced to the problem of computing on private data using simple homomorphic encryption schemes as well as modern secure multi-party computation techniques. Statistical disclosure control is discussed, ad-hoc techniques are analyzed and defeated, and techniques based on differential privacy discussed.
Method of Instruction
The course is delivered in 30 hours split between 20 hours of lectures and 10 hours of supervised labs to support programming exercises. For the labs and programming exercises students, will be expected to run a pre-configured virtual machine using “VirtualBox” and be familiar with basic programming in C or Python.
This module has the following assessments:
- Written Examination (2.5 hours) (50%)
- Lab Work (30%)
- Course Work (20%)
To pass this module, students must:
- Obtain an overall pass mark of 50% for the module overall.
Reading list available via the UCL Library catalogue.