Lena Heimberger
Dipl.-Ing. BScCryptology & Privacy, PhD Student
- 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.
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)
- Mathematical Foundations of Cryptography (WS 2022/2023)
Publications
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)
BISON: Blind Identification with Stateless scOped pseudoNyms
Heher J., More S., Heimberger L.
Proceedings of the 2025 ACM Asia Conference on Computer and Communications Security, 20th ACM ASIA Conference on Computer and Communications Security
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