M.Sc. Emma Munisamy
Technische Universität München
Professur für Codierung und Kryptographie (Prof. Wachter-Zeh)
Postadresse
Theresienstr. 90
80333 München
- Tel.: +49 (89) 289-25007
- Raum: 0104.03.417
- E-Mail: emma.munisamy@tum.de
Biography
I completed my bachelor's degree in 2020 and my master's degree in 2022 at Ludwig-Maximilians-Universität in computer science. After an inspiring but semi-successful year as co-founder and full-stack developer of a sports community app, I returned to research and started my PhD in the Coding & Cryptography group of Prof. Antonia Wachter-Zeh in July 2024.
Research
My research interests lie in the field of cryptography, especially Lattice-based Cryptography and Homomorphic Encryption. During my masters I worked on lattice-based identity-based signatures with trapdoors.
At the moment I am working on combining homomorphic encryption with error-correcting codes for performance improvements. Also I am working on Single-Server Private Information Retrieval.
Teaching
- Channel Coding (Summer Semester 2025)
- Scientific Seminar on Coding and Cryptography, Optical Communications, Digital Communications (Winter Semester 2025/2026)
Open Theses
Theses in Progress
Homomorphic Encryption
Homomorphic Encryption, GSW13
Description
Homomorphic Encryption (HE) is a type of encryption that allows calculations to be performed on the ciphertexts [1]. If any kind of operation is allowed, it is called Fully Homomorphic Encryption (FHE). This concept offers many opportunities regarding data protection for cloud services. This technology allows users to keep their data secret, while still being able to outsource calculations on this data to a server. For example, in the field of machine learning, the training can be carried out on private data.
The first fully homomorphic encryption scheme was introduced by Gentry in 2009 [2]. Since then, there have been various other schemes and optimizations. For a first overview [3] and [4] are recommended.
The goal of the seminar would be to give an overview of Homomorphic Encryption, including the variants and definitions, and to present a concrete instantiation of some FHE scheme, such as for example the GSW13 [5] or DGHV10 [6] scheme.
[1] Rivest, Ronald L., Len Adleman, and Michael L. Dertouzos. "On data banks and privacy homomorphisms." Foundations of secure computation 4.11 (1978): 169-180.
[2] Gentry, Craig. "Fully homomorphic encryption using ideal lattices." Proceedings of the forty-first annual ACM symposium on Theory of computing. 2009.
[3] Vaikuntanathan, Vinod. "Computing blindfolded: New developments in fully homomorphic encryption." 2011 IEEE 52nd annual symposium on foundations of computer science. IEEE, 2011.
[4] Brakerski, Zvika. "Fundamentals of fully homomorphic encryption-a survey." Electronic Colloquium on Computational Complexity (ECCC). Vol. 25. 2018.
[5] Gentry, Craig, Amit Sahai, and Brent Waters. "Homomorphic encryption from learning with errors: Conceptually-simpler, asymptotically-faster, attribute-based." Advances in Cryptology–CRYPTO 2013: 33rd Annual Cryptology Conference, Santa Barbara, CA, USA, August 18-22, 2013. Proceedings, Part I. Springer Berlin Heidelberg, 2013.
[6] Van Dijk, Marten, et al. "Fully homomorphic encryption over the integers." Advances in Cryptology–EUROCRYPT 2010: 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques, French Riviera, May 30–June 3, 2010. Proceedings 29. Springer Berlin Heidelberg, 2010.