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
102 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
88 2019 Homomorphic secret sharing from lattices without FHE E Boyle, L Kohl, P Scholl
Annual International Conference on the Theory and Applications of …, 2019
43 2019 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
39 2020 Kurosawa-Desmedt meets tight security R Gay, D Hofheinz, L Kohl
Annual International Cryptology Conference, 133-160, 2017
35 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
31 2018 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
24 2020 A Compressed T Attema, R Cramer, L Kohl
Annual International Cryptology Conference, 549-579, 2021
20 2021 On tightly secure non-interactive key exchange J Hesse, D Hofheinz, L Kohl
Annual International Cryptology Conference, 65-94, 2018
17 2018 Hunting and gathering–verifiable random functions from standard assumptions with short proofs L Kohl
IACR International Workshop on Public Key Cryptography, 408-437, 2019
10 2019 Towards tight adaptive security of non-interactive key exchange J Hesse, D Hofheinz, L Kohl, R Langrehr
Theory of Cryptography Conference, 286-316, 2021
1 2021 Low-Complexity Weak Pseudorandom Functions in E Boyle, G Couteau, N Gilboa, Y Ishai, L Kohl, P Scholl
Annual International Cryptology Conference, 487-516, 2021
1 2021 New Tools for Multi-Party Computation L Kohl
Cryptology ePrint Archive, 2016
1 2016 Low-Complexity Weak Pseudorandom Functions in G Couteau, E Boyle, N Gilboa, Y Ishai, L Kohl, P Scholl
CRYPTO 2021-Annual International Cryptology Conference 12828, 487-516, 2021
2021 Low-complexity weak pseudorandom functions in AC0 [MOD2] G Couteau, N Gilboa, Y Ishai, LM Kohl, P Scholl
2021 Tortoise and Hares Consensus: The Meshcash Framework for Incentive-compatible, Scalable Cryptocurrencies M Ball, E Boyle, R Cohen, L Kohl, T Malkin, P Meyer, T Moran, T Moran, ...
CSCML 2021 11240, 3-35, 2021
2021 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 Verbesserte Kommunikationskomplexität in der Kryptographie L Kohl
Ausgezeichnete Informatikdissertationen 2019, 2020
2020 On Improving Communication Complexity in Cryptography LM Kohl
KIT-Bibliothek, 2019
2019 Low-Complexity Weak Pseudorandom Functions E Boyle, G Couteau, N Gilboa, Y Ishai, L Kohl, P Scholl
Elette BoyleAdresse e-mail validée de mit.edu
