Lisa Kohl

Affiliations:
  • CWI Amsterdam, The Netherlands


According to our database1, Lisa Kohl authored at least 25 papers between 2016 and 2025.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Scalable and Fine-Tuned Privacy Pass from Group Verifiable Random Functions.
Proceedings of the 10th IEEE European Symposium on Security and Privacy, 2025

2024
Extending the Security of SPDZ with Fairness.
Proc. Priv. Enhancing Technol., 2024

Communication-Efficient Multi-Party Computation for RMS Programs.
IACR Commun. Cryptol., 2024

Direct FSS Constructions for Branching Programs and More from PRGs with Encoded-Output Homomorphism.
Proceedings of the Advances in Cryptology - ASIACRYPT 2024, 2024

2023
Towards Topology-Hiding Computation from Oblivious Transfer.
Proceedings of the Theory of Cryptography - 21st International Conference, 2023

On Homomorphic Secret Sharing from Polynomial-Modulus LWE.
Proceedings of the Public-Key Cryptography - PKC 2023, 2023

Oblivious Transfer with Constant Computational Overhead.
Proceedings of the Advances in Cryptology - EUROCRYPT 2023, 2023

2022
Correlated Pseudorandomness from Expand-Accumulate Codes.
Proceedings of the Advances in Cryptology - CRYPTO 2022, 2022

2021
A Compressed Σ-Protocol Theory for Lattices.
IACR Cryptol. ePrint Arch., 2021

Towards Tight Adaptive Security of Non-interactive Key Exchange.
Proceedings of the Theory of Cryptography - 19th International Conference, 2021

Low-Complexity Weak Pseudorandom Functions in $\mathtt {AC}0[\mathtt {MOD}2]$.
Proceedings of the Advances in Cryptology - CRYPTO 2021, 2021

A Compressed $\varSigma $-Protocol Theory for Lattices.
Proceedings of the Advances in Cryptology - CRYPTO 2021, 2021

2020
Topology-Hiding Communication from Minimal Assumptions.
Proceedings of the Theory of Cryptography - 18th International Conference, 2020

Correlated Pseudorandom Functions from Variable-Density LPN.
Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020

Efficient Pseudorandom Correlation Generators from Ring-LPN.
Proceedings of the Advances in Cryptology - CRYPTO 2020, 2020

2019
Verbesserte Kommunikationskomplexität in der Kryptographie.
Proceedings of the Ausgezeichnete Informatikdissertationen 2019., 2019

On Improving Communication Complexity in Cryptography.
PhD thesis, 2019

Hunting and Gathering - Verifiable Random Functions from Standard Assumptions with Short Proofs.
Proceedings of the Public-Key Cryptography - PKC 2019, 2019

Homomorphic Secret Sharing from Lattices Without FHE.
Proceedings of the Advances in Cryptology - EUROCRYPT 2019, 2019

Efficient Pseudorandom Correlation Generators: Silent OT Extension and More.
Proceedings of the Advances in Cryptology - CRYPTO 2019, 2019

Efficient Two-Round OT Extension and Silent Non-Interactive Secure Computation.
Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, 2019

2018
More Efficient (Almost) Tightly Secure Structure-Preserving Signatures.
Proceedings of the Advances in Cryptology - EUROCRYPT 2018 - 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tel Aviv, Israel, April 29, 2018

On Tightly Secure Non-Interactive Key Exchange.
Proceedings of the Advances in Cryptology - CRYPTO 2018, 2018

2017
Kurosawa-Desmedt Meets Tight Security.
Proceedings of the Advances in Cryptology - CRYPTO 2017, 2017

2016
New Tools for Multi-Party Computation.
IACR Cryptol. ePrint Arch., 2016


  Loading...