| Generic-group delay functions require hidden-order groups L Rotem, G Segev, I Shahaf Annual International Conference on the Theory and Applications of …, 2020 | 42 | 2020 |
| Generically speeding-up repeated squaring is equivalent to factoring: Sharp thresholds for all generic-ring delay functions L Rotem, G Segev Annual International Cryptology Conference, 481-509, 2020 | 37 | 2020 |
| Characterization of secure multiparty computation without broadcast R Cohen, I Haitner, E Omri, L Rotem Theory of Cryptography Conference, 596-616, 2016 | 33 | 2016 |
| From fairness to full security in multiparty computation R Cohen, I Haitner, E Omri, L Rotem Journal of Cryptology 35 (1), 4, 2022 | 25* | 2022 |
| Algebraic distinguishers: From discrete logarithms to decisional uber assumptions L Rotem, G Segev Theory of Cryptography Conference, 366-389, 2020 | 25 | 2020 |
| Traceable secret sharing: Strong security and efficient constructions D Boneh, A Partap, L Rotem Annual International Cryptology Conference, 221-256, 2024 | 24 | 2024 |
| Tighter Security for Schnorr Identification and Signatures: A High-Moment Forking Lemma for -Protocols L Rotem, G Segev Journal of Cryptology 37 (3), 26, 2024 | 22 | 2024 |
| Accountability for misbehavior in threshold decryption via threshold traitor tracing D Boneh, A Partap, L Rotem Annual International Cryptology Conference, 317-351, 2024 | 21 | 2024 |
| Simple and efficient batch verification techniques for verifiable delay functions L Rotem Theory of Cryptography Conference, 382-414, 2021 | 19 | 2021 |
| Proactive refresh for accountable threshold signatures D Boneh, A Partap, L Rotem International Conference on Financial Cryptography and Data Security, 140-159, 2024 | 16* | 2024 |
| The security of lazy users in out-of-band authentication M Naor, L Rotem, G Segev ACM Transactions on Privacy and Security (TOPS) 23 (2), 1-32, 2020 | 12 | 2020 |
| Revisiting the uber assumption in the algebraic group model: Fine-grained bounds in hidden-order groups and improved reductions in bilinear groups L Rotem Cryptology ePrint Archive, 2022 | 11 | 2022 |
| Segev G Micciancio D and Ristenpart T Generically speeding-up repeated squaring is equivalent to factoring: sharp thresholds for all generic-ring delay functions L Rotem Advances in Cryptology–CRYPTO 2020, 481-509, 2020 | 11 | 2020 |
| Post-quantum single secret leader election (ssle) from publicly re-randomizable commitments D Boneh, A Partap, L Rotem Cryptology ePrint Archive, 2023 | 10 | 2023 |
| Out-of-band authentication in group messaging: Computational, statistical, optimal L Rotem, G Segev Annual International Cryptology Conference, 63-89, 2018 | 7 | 2018 |
| Traceable verifiable random functions D Boneh, A Partap, L Rotem Annual International Cryptology Conference, 203-234, 2025 | 6 | 2025 |
| Straight-line knowledge extraction for multi-round protocols L Rotem, S Tessaro Annual International Cryptology Conference, 95-127, 2025 | 6 | 2025 |
| Context-dependent threshold decryption and its applications D Boneh, B Bünz, K Nayak, L Rotem, V Shoup International Conference on the Theory and Application of Cryptology and …, 2025 | 4 | 2025 |
| Robust Steganography from Large Language Models N Perry, S Gupte, N Pitta, L Rotem arXiv preprint arXiv:2504.08977, 2025 | 4 | 2025 |
| Non-malleable vector commitments via local equivocability L Rotem, G Segev Theory of Cryptography Conference, 415-446, 2021 | 4 | 2021 |
