Lisa Kohl

Lisa Kohl

I am a tenured researcher in the Cryptology Group at CWI Amsterdam headed by Ronald Cramer, where I started working in October 2020. A special focus of my work lies in exploring new directions in secure computation with the goal of developing practical post-quantum secure protocols.

Before coming to CWI, I worked as a postdoctoral researcher with Yuval Ishai at Technion. In 2019, I completed my PhD at Karlsruhe Institute of Technology under the supervision of Dennis Hofheinz. During my PhD, I spent eight months in the FACT center at IDC Herzliya for a research visit with Elette Boyle. I got to know the CWI Cryptology Group already back in 2015, when I wrote my master’s thesis there as a visiting student.

Lisa.Kohl(at)cwi.nl

Publications:

  • Scalable and Fine-Tuned Privacy Pass from Group Verifiable Random Functions. Dennis Faut, Julia Hesse, Lisa Kohl, Andy Rupp. To appear in: EURO S&P 2025. (Full version)
  • Direct FSS constructions for branching programs and more from PRGs with encoded-output homomorphism. Elette Boyle, Lisa Kohl, Zhe Li, Peter Scholl. In: ASIACRYPT 2024. (Full version)
  • Communication-Efficient Multi-Party Computation for RMS Programs. Thomas Attema, Aron van Baarsen, Stefan van den Berg, Pedro Capitão, Vincent Dunning, Lisa Kohl. In: IACR Communications in Cryptology – CiC 2024. (Full version)
  • Extending the Security of SPDZ with Fairness. Bart Veldhuizen, Gabriele Spini, Thijs Veugen, Lisa Kohl. In: Proceedings on Privacy Enhancing Technologies – PETS 2024. (Proceedings version)
  • Towards topology-hiding computation from oblivious transfer. Marshall Ball, Alexander Bienstock, Lisa Kohl, Pierre Meyer. Theory of Cryptography Conference – TCC 2023. (Full version)
  • Oblivious Transfer with Constant Computational Overhead. Elette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai, Lisa Kohl, Nicolas Resch, and Peter Scholl. In: Advances in Cryptology – EUROCRYPT 2023. (Full version)
  • On Homomorphic Secret Sharing from Polynomial-Modulus LWE. Thomas Attema, Pedro Capitão, Lisa Kohl. In: Public-Key Cryptography – PKC 2023. (Full version)
  • Correlated Pseudorandomness from Expand-Accumulate Codes. Elette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai, Lisa Kohl, Nicolas Resch, and Peter Scholl. In: International Conference on Cryptology – CRYPTO 2022. (Full version)
  • Towards Tight Adaptive Security of Non-interactive Key Exchange. Julia Hesse, Dennis Hofheinz, Lisa Kohl, and Roman Langrehr. In: Theory of Cryptography Conference – TCC 2021. (Full version).
  • A Compressed Σ-Protocol Theory for Lattices. Thomas Attema, Ronald Cramer, and Lisa Kohl. In: International Conference on Cryptology – CRYPTO 2021. (Full version)
  • Low-Complexity Weak Pseudorandom Functions in AC0[MOD2]. Elette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai, Lisa Kohl, and Peter Scholl. In: International Conference on Cryptology – CRYPTO 2021. (Proceedings Version)
  • Correlated Pseudorandom Functions from Variable-Density LPN. Elette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai, Lisa Kohl, and Peter Scholl. In: IEEE Symposium on Foundations of Computer Science – FOCS 2020. (Full version)
  • Topology Hiding Communication from Minimal Assumptions. Marshall Ball, Elette Boyle, Ran Cohen, Lisa Kohl, Tal Malkin, Pierre Meyer and Tal Moran. In: Theory of Cryptography Conference – TCC 2020. (Full version)
  • Efficient Pseudorandom Correlation Generators from Ring Learning Parity with Noise. Elette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai, Lisa Kohl, and Peter Scholl. In: International Conference on Cryptology – CRYPTO 2020. (Full version)
  • Efficient Two-Round OT Extension and Silent Non-Interactive Secure Computation. Elette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai, Lisa Kohl, Peter Rindal, and Peter Scholl. In: ACM Conference on Computer and Communications Security – CCS 2019. (Full version)
  • Efficient Pseudorandom Correlation Generators: Silent OT Extension and More. Elette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai, Lisa Kohl, and Peter Scholl. In: International Conference on Cryptology – CRYPTO 2019. (Full version)
  • Homomorphic Secret Sharing from Lattices Without FHE. Elette Boyle, Lisa Kohl, and Peter Scholl. In: Advances in Cryptology – EUROCRYPT 2019. (Full version)
  • Hunting and Gathering – Verifiable Random Functions from Standard Assumptions with Short Proofs. Lisa Kohl. In: Public-Key Cryptography – PKC 2019. (Proceedings version)
  • On Tightly Secure Non-Interactive Key Exchange. Julia Hesse, Dennis Hofheinz, Lisa Kohl. In: International Conference on Cryptology – CRYPTO 2018. (Full version)
  • More Efficient (Almost) Tightly Secure Structure-Preserving Signatures. Romain Gay, Dennis Hofheinz, Lisa Kohl, Jiaxin Pan. In: Advances in Cryptology – EUROCRYPT 2018. (Full version)
  • Kurosawa-Desmedt Meets Tight Security. Romain Gay, Dennis Hofheinz, Lisa Kohl. In: CRYPTO 2017 – International Conference on Cryptology. (Full version)