Lena Heimberger

Dipl.-Ing. BSc

Cryptology & Privacy, PhD Student

Lena Heimberger is a PhD Student at Graz University of Technology, advised by Prof. Christian Rechberger. Her main research interests are designing and implementing low-level privacy-preserving primitives, especially OPRFs, and on how to translate them to a post-quantum setting. Her research interests include

mathematical cryptography, namely cool cryptography built from algebra
scalable and privacy-preserving cryptography, especially considering tradeoffs like bandwidth and parallelization. I currently work on both Private Information Retrieval and Oblivoius Pseudorandom Functions.
distributed computing, especially large-scale networks and federation, as well as messaging
as well as the legal aspects of the above, it would be nice to have a legislative ground to enforce privacy.

If you are a student looking for a thesis, project, or internship. I usually have some topic ideas that are in an early stage of development. If you are curious about any of the topics above, I'm happy to hear from you! Independently, I am always happy to hear from students regardless. If you think I can help you with something, you would like to discuss a topic further or just want to go to lunch and talk about university things, do write me.

+43 316 873 - 5509
lena.heimberger@tugraz.at
https://www.heimberger.xyz/
IF01010
TUGRAZ online

Teaching

I teach cryptography as a part of:

Privacy Enhancing Technologies (WS2023/24)
Modern Public Key Cryptography (SS 2023, SS 2024)
Secure Application Design (SS 2024)

I used to teach cryptography as a part of:

Mathematical Foundations of Cryptography (WS 2022/2023)

I do not have fixed office hours, but I am available if you have questions, concerns, or if you just want to talk about course material or cryptography in general. Should you want to write a thesis in my general area of research, I'm happy to explore potential topics. Please just send me an E-Mail so we can schedule an appointment!

Publications

BISON: Blind Identification with Stateless scOped pseudoNyms

Heher J., More S., Heimberger L.
ACM ASIA CCS 2025 - Proceedings of the 20th ACM ASIA Conference on Computer and Communications Security, 20th ACM ASIA Conference on Computer and Communications Security, AsiaCCS 2025, 1355-1371, (Proceedings of the ACM Conference on Computer and Communications Security)

LEAP: A Fast, Lattice-based OPRF with Application to Private Set Intersection

Heimberger L., Kales D., Lolato R., Mir O., Ramacher S., Rechberger C.
Advances in Cryptology – EUROCRYPT 2025 - 44th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings, Eurocrypt 2025, 254-283, (Lecture Notes in Computer Science; vol. 15607 LNCS)

OPRFs from Isogenies

Heimberger L., Hennerbichler T., Meisingseth F., Ramacher S., Rechberger C.
ACM AsiaCCS 2024 - Proceedings of the 19th ACM Asia Conference on Computer and Communications Security, 19th ACM ASIA Conference on Computer and Communications Security, 575-588

More Publications