Lisa Kohl

Cited by

	All	Since 2016
Citations	196	196
h-index	7	7
i10-index	7	7

201720182019202020211 10 41 76 68

Public access

View all

9 articles

1 article

available

not available

Based on funding mandates

Co-authors

Elette BoyleVerified email at mit.edu
Peter SchollAarhus UniversityVerified email at cs.au.dk
Yuval IshaiTechnionVerified email at cs.technion.ac.il
Niv GilboaCommunication Systems Engineering, Ben-Gurion UniversityVerified email at bgu.ac.il
Geoffroy CouteauCNRS Researcher in Theoretical Computer Science, IRIF, Université de ParisVerified email at irif.fr
Dennis HofheinzDepartment of Computer Science, ETH ZürichVerified email at inf.ethz.ch
Romain GayIBM ZurichVerified email at di.ens.fr
Jiaxin PanNTNU – Norwegian University of Science and TechnologyVerified email at ntnu.no
Julia HesseIBM Research - ZurichVerified email at zurich.ibm.com
Thomas AttemaResearcher, TNOVerified email at tno.nl
Tal MalkinProfessor of Computer Science, Columbia UniversityVerified email at columbia.edu
Marshall BallUniversity of WashingtonVerified email at cs.columbia.edu
Ran CohenNortheastern UniversityVerified email at ccs.neu.edu
Pierre MeyerIDC HerzliyaVerified email at ens-lyon.fr
Tal MoranIDC HerzliyaVerified email at idc.ac.il

Lisa Kohl

Researcher at CWI Amsterdam

Verified email at cwi.nl - Homepage

Cryptography


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
Efficient pseudorandom correlation generators: Silent OT extension and more E Boyle, G Couteau, N Gilboa, Y Ishai, L Kohl, P Scholl Annual International Cryptology Conference, 489-518, 2019	42	2019
Efficient two-round OT extension and silent non-interactive secure computation E Boyle, G Couteau, N Gilboa, Y Ishai, L Kohl, P Rindal, P Scholl Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications …, 2019	38	2019
Kurosawa-Desmedt meets tight security R Gay, D Hofheinz, L Kohl Annual International Cryptology Conference, 133-160, 2017	30	2017
More efficient (almost) tightly secure structure-preserving signatures R Gay, D Hofheinz, L Kohl, J Pan Annual International Conference on the Theory and Applications of …, 2018	25	2018
Homomorphic secret sharing from lattices without FHE E Boyle, L Kohl, P Scholl Annual International Conference on the Theory and Applications of …, 2019	23	2019
On tightly secure non-interactive key exchange J Hesse, D Hofheinz, L Kohl Annual International Cryptology Conference, 65-94, 2018	12	2018
Efficient pseudorandom correlation generators from ring-LPN E Boyle, G Couteau, N Gilboa, Y Ishai, L Kohl, P Scholl Annual International Cryptology Conference, 387-416, 2020	10	2020
Correlated pseudorandom functions from variable-density LPN E Boyle, G Couteau, N Gilboa, Y Ishai, L Kohl, P Scholl 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS …, 2020	6	2020
Hunting and gathering–verifiable random functions from standard assumptions with short proofs L Kohl IACR International Workshop on Public Key Cryptography, 408-437, 2019	5	2019
A Compressed Σ-Protocol Theory for Lattices. T Attema, R Cramer, L Kohl IACR Cryptol. ePrint Arch. 2021, 307, 2021	4	2021
New Tools for Multi-Party Computation. L Kohl IACR Cryptol. ePrint Arch. 2016, 417, 2016	1	2016
Topology-Hiding Communication from Minimal Assumptions M Ball, E Boyle, R Cohen, L Kohl, T Malkin, P Meyer, T Moran Theory of Cryptography Conference, 473-501, 2020		2020
On Improving Communication Complexity in Cryptography LM Kohl Karlsruhe Institute of Technology, Germany, 2019		2019

The system can't perform the operation now. Try again later.

Articles 1–13

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow this author

Cited by

Co-authors