New Tools for Multi-Party Computation. - Lisa Kohl (IACR Cryptol. ePrint Arch., 2016)

Kurosawa-Desmedt Meets Tight Security. - Romain Gay; Dennis Hofheinz; Lisa Kohl (IACR Cryptol. ePrint Arch., 2017)

More Efficient (Almost) Tightly Secure Structure-Preserving Signatures. - Romain Gay; Dennis Hofheinz; Lisa Kohl; Jiaxin Pan 001 (IACR Cryptol. ePrint Arch., 2018)

On Tightly Secure Non-Interactive Key Exchange. - Julia Hesse; Dennis Hofheinz; Lisa Kohl (IACR Cryptol. ePrint Arch., 2018)

Efficient Two-Round OT Extension and Silent Non-Interactive Secure Computation. - Elette Boyle; Geoffroy Couteau; Niv Gilboa; Yuval Ishai; Lisa Kohl; Peter Rindal; Peter Scholl (IACR Cryptol. ePrint Arch., 2019)

Efficient Pseudorandom Correlation Generators: Silent OT Extension and More. - Elette Boyle; Geoffroy Couteau; Niv Gilboa; Yuval Ishai; Lisa Kohl; Peter Scholl (IACR Cryptol. ePrint Arch., 2019)

Homomorphic Secret Sharing from Lattices Without FHE. - Elette Boyle; Lisa Kohl; Peter Scholl (IACR Cryptol. ePrint Arch., 2019)

Hunting and Gathering - Verifiable Random Functions from Standard Assumptions with Short Proofs. - Lisa Kohl (IACR Cryptol. ePrint Arch., 2019)

On Improving Communication Complexity in Cryptography. - Lisa Kohl (2019)

Verbesserte Kommunikationskomplexität in der Kryptographie. - Lisa Kohl (Ausgezeichnete Informatikdissertationen, 2019)

Correlated Pseudorandom Functions from Variable-Density LPN. - Elette Boyle; Geoffroy Couteau; Niv Gilboa; Yuval Ishai; Lisa Kohl; Peter Scholl (IACR Cryptol. ePrint Arch., 2020)

A Compressed $ varSigma $-Protocol Theory for Lattices. - Thomas Attema; Ronald Cramer; Lisa Kohl (CRYPTO (2), 2021)

Low-Complexity Weak Pseudorandom Functions in $ mathtt {AC}0[ mathtt {MOD}2]$. - Elette Boyle; Geoffroy Couteau; Niv Gilboa; Yuval Ishai; Lisa Kohl; Peter Scholl (CRYPTO (4), 2021)

A Compressed Σ-Protocol Theory for Lattices. - Thomas Attema; Ronald Cramer; Lisa Kohl (IACR Cryptol. ePrint Arch., 2021)

Towards Tight Adaptive Security of Non-Interactive Key Exchange. - Julia Hesse; Dennis Hofheinz; Lisa Kohl; Roman Langrehr (IACR Cryptol. ePrint Arch., 2021)

Correlated Pseudorandomness from Expand-Accumulate Codes. - Elette Boyle; Geoffroy Couteau; Niv Gilboa; Yuval Ishai; Lisa Kohl; Nicolas Resch; Peter Scholl (IACR Cryptol. ePrint Arch., 2022)

Efficient Pseudorandom Correlation Generators from Ring-LPN. - Elette Boyle; Geoffroy Couteau; Niv Gilboa; Yuval Ishai; Lisa Kohl; Peter Scholl (IACR Cryptol. ePrint Arch., 2022)

On Homomorphic Secret Sharing from Polynomial-Modulus LWE. - Thomas Attema; Pedro Capitão; Lisa Kohl (IACR Cryptol. ePrint Arch., 2023)

Towards Topology-Hiding Computation from Oblivious Transfer. - Marshall Ball; Alexander Bienstock; Lisa Kohl; Pierre Meyer (IACR Cryptol. ePrint Arch., 2023)

Oblivious Transfer with Constant Computational Overhead. - Elette Boyle; Geoffroy Couteau; Niv Gilboa; Yuval Ishai; Lisa Kohl; Nicolas Resch; Peter Scholl (IACR Cryptol. ePrint Arch., 2023)

Topology-Hiding Communication from Minimal Assumptions. - Marshall Ball; Elette Boyle; Ran Cohen; Lisa Kohl; Tal Malkin; Pierre Meyer; Tal Moran (J. Cryptol., 2023)

Communication-Efficient Multi-Party Computation for RMS Programs. - Thomas Attema; Aron van Baarsen; Stefan van den Berg; Pedro Capitão; Vincent Dunning; Lisa Kohl (IACR Commun. Cryptol., 2024)

Direct FSS Constructions for Branching Programs and More from PRGs with Encoded-Output Homomorphism. - Elette Boyle; Lisa Kohl; Zhe Li; Peter Scholl (IACR Cryptol. ePrint Arch., 2024)

Extending the Security of SPDZ with Fairness. - Bart Veldhuizen; Gabriele Spini; Thijs Veugen; Lisa Kohl (Proc. Priv. Enhancing Technol., 2024)

Scalable and Fine-Tuned Privacy Pass from Group Verifiable Random Functions. - Dennis Faut; Julia Hesse; Lisa Kohl; Andy Rupp (IACR Cryptol. ePrint Arch., 2025)