default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLisa Kohl
Person information
- affiliation: CWI Amsterdam, The Netherlands
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j3]Thomas Attema, Aron van Baarsen, Stefan van den Berg, Pedro Capitão, Vincent Dunning, Lisa Kohl:
Communication-Efficient Multi-Party Computation for RMS Programs. IACR Commun. Cryptol. 1(2): 10 (2024)- [j2]Bart Veldhuizen, Gabriele Spini, Thijs Veugen, Lisa Kohl:
Extending the Security of SPDZ with Fairness. Proc. Priv. Enhancing Technol. 2024(2): 330-350 (2024) - [i19]Elette Boyle, Lisa Kohl, Zhe Li, Peter Scholl:
Direct FSS Constructions for Branching Programs and More from PRGs with Encoded-Output Homomorphism. IACR Cryptol. ePrint Arch. 2024: 192 (2024) - [i18]Thomas Attema, Aron van Baarsen, Stefan van den Berg, Pedro Capitão, Vincent Dunning, Lisa Kohl:
Communication-Efficient Multi-Party Computation for RMS Programs. IACR Cryptol. ePrint Arch. 2024: 568 (2024) - 2023
- [j1]Marshall Ball
, Elette Boyle, Ran Cohen, Lisa Kohl, Tal Malkin, Pierre Meyer, Tal Moran:
Topology-Hiding Communication from Minimal Assumptions. J. Cryptol. 36(4): 39 (2023) - [c17]Elette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai, Lisa Kohl, Nicolas Resch, Peter Scholl:
Oblivious Transfer with Constant Computational Overhead. EUROCRYPT (1) 2023: 271-302 - [c16]Thomas Attema, Pedro Capitão, Lisa Kohl:
On Homomorphic Secret Sharing from Polynomial-Modulus LWE. Public Key Cryptography (2) 2023: 3-32 - [c15]Marshall Ball, Alexander Bienstock, Lisa Kohl, Pierre Meyer:
Towards Topology-Hiding Computation from Oblivious Transfer. TCC (1) 2023: 349-379 - [i17]Thomas Attema, Pedro Capitão, Lisa Kohl:
On Homomorphic Secret Sharing from Polynomial-Modulus LWE. IACR Cryptol. ePrint Arch. 2023: 382 (2023) - [i16]Elette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai, Lisa Kohl, Nicolas Resch, Peter Scholl:
Oblivious Transfer with Constant Computational Overhead. IACR Cryptol. ePrint Arch. 2023: 817 (2023) - [i15]Marshall Ball, Alexander Bienstock, Lisa Kohl, Pierre Meyer:
Towards Topology-Hiding Computation from Oblivious Transfer. IACR Cryptol. ePrint Arch. 2023: 849 (2023) - 2022
- [c14]Elette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai, Lisa Kohl, Nicolas Resch, Peter Scholl:
Correlated Pseudorandomness from Expand-Accumulate Codes. CRYPTO (2) 2022: 603-633 - [i14]Elette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai, Lisa Kohl, Nicolas Resch, Peter Scholl:
Correlated Pseudorandomness from Expand-Accumulate Codes. IACR Cryptol. ePrint Arch. 2022: 1014 (2022) - [i13]Elette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai, Lisa Kohl, Peter Scholl:
Efficient Pseudorandom Correlation Generators from Ring-LPN. IACR Cryptol. ePrint Arch. 2022: 1035 (2022) - 2021
- [c13]Elette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai, Lisa Kohl, Peter Scholl:
Low-Complexity Weak Pseudorandom Functions in $\mathtt {AC}0[\mathtt {MOD}2]$. CRYPTO (4) 2021: 487-516 - [c12]Thomas Attema, Ronald Cramer, Lisa Kohl:
A Compressed $\varSigma $-Protocol Theory for Lattices. CRYPTO (2) 2021: 549-579 - [c11]Julia Hesse, Dennis Hofheinz, Lisa Kohl, Roman Langrehr:
Towards Tight Adaptive Security of Non-interactive Key Exchange. TCC (3) 2021: 286-316 - [i12]Thomas Attema, Ronald Cramer, Lisa Kohl:
A Compressed Σ-Protocol Theory for Lattices. IACR Cryptol. ePrint Arch. 2021: 307 (2021) - [i11]Marshall Ball, Elette Boyle, Ran Cohen, Lisa Kohl, Tal Malkin, Pierre Meyer, Tal Moran:
Topology-Hiding Communication from Minimal Assumptions. IACR Cryptol. ePrint Arch. 2021: 388 (2021) - [i10]Julia Hesse, Dennis Hofheinz, Lisa Kohl, Roman Langrehr:
Towards Tight Adaptive Security of Non-Interactive Key Exchange. IACR Cryptol. ePrint Arch. 2021: 1219 (2021) - 2020
- [c10]Elette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai, Lisa Kohl, Peter Scholl:
Efficient Pseudorandom Correlation Generators from Ring-LPN. CRYPTO (2) 2020: 387-416 - [c9]Elette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai, Lisa Kohl, Peter Scholl:
Correlated Pseudorandom Functions from Variable-Density LPN. FOCS 2020: 1069-1080 - [c8]Marshall Ball, Elette Boyle, Ran Cohen, Lisa Kohl, Tal Malkin, Pierre Meyer, Tal Moran:
Topology-Hiding Communication from Minimal Assumptions. TCC (2) 2020: 473-501 - [i9]Elette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai, Lisa Kohl, Peter Scholl:
Correlated Pseudorandom Functions from Variable-Density LPN. IACR Cryptol. ePrint Arch. 2020: 1417 (2020)
2010 – 2019
- 2019
- [b1]Lisa Kohl:
On Improving Communication Complexity in Cryptography. Karlsruhe Institute of Technology, Germany, 2019 - [c7]Elette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai, Lisa Kohl, Peter Rindal, Peter Scholl:
Efficient Two-Round OT Extension and Silent Non-Interactive Secure Computation. CCS 2019: 291-308 - [c6]Elette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai, Lisa Kohl, Peter Scholl:
Efficient Pseudorandom Correlation Generators: Silent OT Extension and More. CRYPTO (3) 2019: 489-518 - [c5]Elette Boyle, Lisa Kohl, Peter Scholl:
Homomorphic Secret Sharing from Lattices Without FHE. EUROCRYPT (2) 2019: 3-33 - [c4]Lisa Kohl:
Hunting and Gathering - Verifiable Random Functions from Standard Assumptions with Short Proofs. Public Key Cryptography (2) 2019: 408-437 - [p1]Lisa Kohl:
Verbesserte Kommunikationskomplexität in der Kryptographie. Ausgezeichnete Informatikdissertationen 2019: 139-148 - [i8]Lisa Kohl:
Hunting and Gathering - Verifiable Random Functions from Standard Assumptions with Short Proofs. IACR Cryptol. ePrint Arch. 2019: 42 (2019) - [i7]Elette Boyle, Lisa Kohl, Peter Scholl:
Homomorphic Secret Sharing from Lattices Without FHE. IACR Cryptol. ePrint Arch. 2019: 129 (2019) - [i6]Elette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai, Lisa Kohl, Peter Scholl:
Efficient Pseudorandom Correlation Generators: Silent OT Extension and More. IACR Cryptol. ePrint Arch. 2019: 448 (2019) - [i5]Elette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai, Lisa Kohl, Peter Rindal, Peter Scholl:
Efficient Two-Round OT Extension and Silent Non-Interactive Secure Computation. IACR Cryptol. ePrint Arch. 2019: 1159 (2019) - 2018
- [c3]Julia Hesse, Dennis Hofheinz, Lisa Kohl:
On Tightly Secure Non-Interactive Key Exchange. CRYPTO (2) 2018: 65-94 - [c2]Romain Gay, Dennis Hofheinz, Lisa Kohl, Jiaxin Pan:
More Efficient (Almost) Tightly Secure Structure-Preserving Signatures. EUROCRYPT (2) 2018: 230-258 - [i4]Romain Gay, Dennis Hofheinz, Lisa Kohl, Jiaxin Pan:
More Efficient (Almost) Tightly Secure Structure-Preserving Signatures. IACR Cryptol. ePrint Arch. 2018: 54 (2018) - [i3]Julia Hesse, Dennis Hofheinz, Lisa Kohl:
On Tightly Secure Non-Interactive Key Exchange. IACR Cryptol. ePrint Arch. 2018: 237 (2018) - 2017
- [c1]Romain Gay, Dennis Hofheinz, Lisa Kohl:
Kurosawa-Desmedt Meets Tight Security. CRYPTO (3) 2017: 133-160 - [i2]Romain Gay, Dennis Hofheinz, Lisa Kohl:
Kurosawa-Desmedt Meets Tight Security. IACR Cryptol. ePrint Arch. 2017: 525 (2017) - 2016
- [i1]Lisa Kohl:
New Tools for Multi-Party Computation. IACR Cryptol. ePrint Arch. 2016: 417 (2016)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:13 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
