Seminar on Searchable Encryption
|Lecturer:||Dr. Lena Wiese, Daniel Homann|
|ECTS (SWS):||6.00 (4.00)||Date:||block seminar in the summer break, date will be announced|
|Information session:||01.06.2017 at 16:00 in Room 0.101|
|Audience||Applied Computer Science MSc|
Applied Computer Science BSc
Outsourcing data to cloud providers is becoming more and more common. While this offers great advantages in terms of maintenance cost, the confidentiality of the data is in peril. One solution to this problem is the use of encryption. While standard symmetric encryption algorithms like e.g. AES offer good security by encrypting all records, the cloud data store loses any search functionality and degrades to just a bunch of encrypted files. However, among the desirable functionality of a data store is the ability to efficiently perform full-text search. Searchable Encryption offers a solution to this problem.
By allowing a small information leakage to the server, they allow to efficiently search encrypted data. In this seminar, we will look into the key properties of searchable encryption schemes and discuss the trade-offs of proposed schemes.
Each participant will present a current (2000 - 2016) research paper on the topic. Further information will be given in the information session.