| Efficient pseudorandom correlation generators: Silent OT extension and more E Boyle, G Couteau, N Gilboa, Y Ishai, L Kohl, P Scholl Advances in Cryptology–CRYPTO 2019: 39th Annual International Cryptology …, 2019 | 221 | 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 | 198 | 2019 |
| A Compressed -Protocol Theory for Lattices T Attema, R Cramer, L Kohl Annual International Cryptology Conference, 549-579, 2021 | 87 | 2021 |
| Efficient pseudorandom correlation generators from ring-LPN E Boyle, G Couteau, N Gilboa, Y Ishai, L Kohl, P Scholl Advances in Cryptology–CRYPTO 2020: 40th Annual International Cryptology …, 2020 | 83 | 2020 |
| Homomorphic secret sharing from lattices without FHE E Boyle, L Kohl, P Scholl Annual International Conference on the Theory and Applications of …, 2019 | 70 | 2019 |
| 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 | 63 | 2020 |
| More efficient (almost) tightly secure structure-preserving signatures R Gay, D Hofheinz, L Kohl, J Pan Advances in Cryptology–EUROCRYPT 2018: 37th Annual International Conference …, 2018 | 49 | 2018 |
| Kurosawa-Desmedt meets tight security R Gay, D Hofheinz, L Kohl Annual International Cryptology Conference, 133-160, 2017 | 46 | 2017 |
| Correlated pseudorandomness from expand-accumulate codes E Boyle, G Couteau, N Gilboa, Y Ishai, L Kohl, N Resch, P Scholl Annual International Cryptology Conference, 603-633, 2022 | 36 | 2022 |
| On tightly secure non-interactive key exchange J Hesse, D Hofheinz, L Kohl Annual International Cryptology Conference, 65-94, 2018 | 28 | 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 | 18 | 2019 |
| Topology-hiding communication from minimal assumptions M Ball, E Boyle, R Cohen, L Kohl, T Malkin, P Meyer, T Moran Journal of Cryptology 36 (4), 39, 2023 | 7 | 2023 |
| Towards tight adaptive security of non-interactive key exchange J Hesse, D Hofheinz, L Kohl, R Langrehr Theory of Cryptography: 19th International Conference, TCC 2021, Raleigh, NC …, 2021 | 6 | 2021 |
| Oblivious transfer with constant computational overhead E Boyle, G Couteau, N Gilboa, Y Ishai, L Kohl, N Resch, P Scholl Annual International Conference on the Theory and Applications of …, 2023 | 5 | 2023 |
| Low-Complexity Weak Pseudorandom Functions in E Boyle, G Couteau, N Gilboa, Y Ishai, L Kohl, P Scholl Advances in Cryptology–CRYPTO 2021: 41st Annual International Cryptology …, 2021 | 4 | 2021 |
| Towards topology-hiding computation from oblivious transfer M Ball, A Bienstock, L Kohl, P Meyer Theory of Cryptography Conference, 349-379, 2023 | 3 | 2023 |
| Direct FSS Constructions for Branching Programs and More from PRGs with Encoded-Output Homomorphism E Boyle, L Kohl, Z Li, P Scholl Cryptology ePrint Archive, 2024 | 1 | 2024 |
| On Homomorphic Secret Sharing from Polynomial-Modulus LWE T Attema, P Capitão, L Kohl IACR International Conference on Public-Key Cryptography, 3-32, 2023 | 1 | 2023 |
| New Tools for Multi-Party Computation L Kohl Cryptology ePrint Archive, 2016 | 1 | 2016 |
| Communication-Efficient Multi-Party Computation for RMS Programs T Attema, A van Baarsen, S van den Berg, P Capitão, V Dunning, L Kohl Cryptology ePrint Archive, 2024 | | 2024 |
Elette Boyle在 mit.edu 的电子邮件经过验证
