Lisa Kohl

Lisa Kohl

Since October 2020, I am a researcher in the Cryptology Group at CWI Amsterdam headed by Ronald Cramer. My main field of interests are cryptography, coding theory and complexity theory. 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 wrote my master’s thesis as a visiting student in the Cryptology Group at CWI Amsterdam.

Lisa.Kohl(at)cwi.nl

Publications:

  • Marshall Ball, Elette Boyle, Ran Cohen, Lisa Kohl, Tal Malkin, Pierre Meyer and Tal Moran. Topology Hiding Communication from Minimal Assumptions. To appear in: TCC 2020.
  • Elette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai, Lisa Kohl, and Peter Scholl. Correlated Pseudorandom Functions from Variable-Density LPN. To appear in: FOCS 2020.
  • Elette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai, Lisa Kohl, and Peter Scholl. Efficient Pseudorandom Correlation Generators from Ring Learning Parity with Noise. In: CRYPTO 2020- International Conference on Cryptology.
  • Elette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai, Lisa Kohl, Peter Rindal, and Peter Scholl. Efficient Two-Round OT Extension and Silent Non-Interactive Secure Computation. In: CCS 2019 – ACM Conference on Computer and Communications Security. (PDF)
  • Elette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai, Lisa Kohl, and Peter Scholl. Efficient Pseudorandom Correlation Generators: Silent OT Extension and More. In: CRYPTO 2019 – International Conference on Cryptology. (PDF)
  • Elette Boyle, Lisa Kohl, and Peter Scholl. Homomorphic Secret Sharing from Lattices Without FHE. In: Advances in Cryptology – EUROCRYPT 2019. (PDF)
  • Lisa Kohl. Hunting and Gathering – Verifiable Random Functions from Standard Assumptions with Short Proofs. In: Public-Key Cryptography – PKC 2019. (PDF)
  • Julia Hesse, Dennis Hofheinz, Lisa Kohl. On Tightly Secure Non-Interactive Key Exchange. In: CRYPTO 2018 – International Conference on Cryptology. (PDF)
  • Romain Gay, Dennis Hofheinz, Lisa Kohl, Jiaxin Pan. More Efficient (Almost) Tightly Secure Structure-Preserving Signatures. In: Advances in Cryptology – EUROCRYPT 2018. (PDF)
  • Romain Gay, Dennis Hofheinz, Lisa Kohl. Kurosawa-Desmedt Meets Tight Security. In: CRYPTO 2017 – International Conference on Cryptology. (PDF)