For your final project, you can do one of the following.
You will need to write a short survey (4-5 pages) due on Dec 12 and give a 15 minute presentation on the same day. For your presentation you can either use slides or the whiteboard.
You are encouraged to work in pairs, but individual projects are also acceptable. Please let me know about your project proposal by email by Mon Nov 19. You can write a paragraph or two about your proposed .
|9.30||Chen Hung Kwan
||Implementation of fully homomorphic encryption|
|10.00||Chan Chun Wing and
Li Yan Kit
|Cryptographic storage systems|
||Privacy-preserving authentication of query processing|
|11.00||Zheng Min and
|Attacking non-atomic decryption in practice|
|11.15||Lee Chin Ho
||Pseudorandomness, pseudoentropy, and one-way functions|
|11.30||Li Runhui and
|Pseudorandomness, pseudoentropy, and one-way functions|
||On the NIST SHA-3 competition|
||Design of a security coprocessor for mobile devices|
||On the security of RSA encryption|
||On the RSA encryption scheme|
Here are some possible choices of projects. Feel also free to propose your own.
The NIST hash function competition was a three-year long competition which ended in a selection of a new hash function standard SHA-3. For this project you can choose some representative entrants to the competition and do a critical examination of their strengths or weaknesses. Instead of relying what was found by other researchers, try to find your own theoretical or experimental attacks and explain why they succeed or fail.
In class we saw how to obtain a pseudorandom generator from a one-way permutation. In principle it is possible to start with any one-way function, although the resulting pseudorandom generator is less efficient. Some recent works make progress on this connection.
Homomorphic encryption allows for meaningful public operations to be performed on encrypted data. In a fully homomorphic scheme, one can obtain an encryption of any function of the messages given only encryptions of those messages. A good starting point are these lecture notes of Shafi Goldwasser and Boaz Barak 1 and 2. See also
The task of obfuscation is to hide the "source code" of a program without changing its functionality.
This project concerns the application of groups defined on elliptic curves in the construction of cryptosystems. To succeed in this project it is not enough to state how elliptic curve based systems are implemented. You will need to clearly explain the advantage of using techniques from this area. For example if you claim a theoretical advantage, you should give an example of a functionality that can be obtained using this technology but is not known without it. If you claim an advantage in efficiency, I expect you to come up with an implementation and data analysis that shows how elliptic curve cryptography gives an improvement. You can start by looking at the treatment and the references in the Katz-Lindell textbook.