Lisa Kohl

Affiliations:
  • CWI Amsterdam, The Netherlands


According to our database1, Lisa Kohl authored at least 23 papers between 2016 and 2024.

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

2024
Direct FSS Constructions for Branching Programs and More from PRGs with Encoded-Output Homomorphism.
IACR Cryptol. ePrint Arch., 2024

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

2023
Topology-Hiding Communication from Minimal Assumptions.
J. Cryptol., October, 2023

Oblivious Transfer with Constant Computational Overhead.
IACR Cryptol. ePrint Arch., 2023

Towards Topology-Hiding Computation from Oblivious Transfer.
IACR Cryptol. ePrint Arch., 2023

On Homomorphic Secret Sharing from Polynomial-Modulus LWE.
IACR Cryptol. ePrint Arch., 2023

2022
Efficient Pseudorandom Correlation Generators from Ring-LPN.
IACR Cryptol. ePrint Arch., 2022

Correlated Pseudorandomness from Expand-Accumulate Codes.
IACR Cryptol. ePrint Arch., 2022

2021
Towards Tight Adaptive Security of Non-Interactive Key Exchange.
IACR Cryptol. ePrint Arch., 2021

A Compressed Σ-Protocol Theory for Lattices.
IACR Cryptol. ePrint Arch., 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
Correlated Pseudorandom Functions from Variable-Density LPN.
IACR Cryptol. ePrint Arch., 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.
IACR Cryptol. ePrint Arch., 2019

Homomorphic Secret Sharing from Lattices Without FHE.
IACR Cryptol. ePrint Arch., 2019

Efficient Pseudorandom Correlation Generators: Silent OT Extension and More.
IACR Cryptol. ePrint Arch., 2019

Efficient Two-Round OT Extension and Silent Non-Interactive Secure Computation.
IACR Cryptol. ePrint Arch., 2019

2018
On Tightly Secure Non-Interactive Key Exchange.
IACR Cryptol. ePrint Arch., 2018

More Efficient (Almost) Tightly Secure Structure-Preserving Signatures.
IACR Cryptol. ePrint Arch., 2018

2017
Kurosawa-Desmedt Meets Tight Security.
IACR Cryptol. ePrint Arch., 2017

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


  Loading...