Follow
Lior Rotem
Title
Cited by
Cited by
Year
Generic-group delay functions require hidden-order groups
L Rotem, G Segev, I Shahaf
Annual International Conference on the Theory and Applications of …, 2020
342020
Characterization of secure multiparty computation without broadcast
R Cohen, I Haitner, E Omri, L Rotem
Theory of Cryptography Conference, 596-616, 2016
302016
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
282020
From fairness to full security in multiparty computation
R Cohen, I Haitner, E Omri, L Rotem
Journal of Cryptology 35 (1), 4, 2022
22*2022
Algebraic distinguishers: From discrete logarithms to decisional uber assumptions
L Rotem, G Segev
Theory of Cryptography: 18th International Conference, TCC 2020, Durham, NC …, 2020
182020
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
172024
Simple and efficient batch verification techniques for verifiable delay functions
L Rotem
Theory of Cryptography: 19th International Conference, TCC 2021, Raleigh, NC …, 2021
162021
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
122020
Proactive refresh for accountable threshold signatures
D Boneh, A Partap, L Rotem
Cryptology ePrint Archive, 2022
8*2022
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
72022
Out-of-band authentication in group messaging: Computational, statistical, optimal
L Rotem, G Segev
Advances in Cryptology–CRYPTO 2018: 38th Annual International Cryptology …, 2018
72018
Accountability for misbehavior in threshold decryption via threshold traitor tracing
D Boneh, A Partap, L Rotem
Annual International Cryptology Conference, 317-351, 2024
42024
Traceable secret sharing: Strong security and efficient constructions
D Boneh, A Partap, L Rotem
Annual International Cryptology Conference, 221-256, 2024
42024
Post-Quantum Single Secret Leader Election (SSLE) from Publicly Re-Randomizable Commitments
D Boneh, A Partap, L Rotem
Cryptology ePrint Archive, 2023
42023
Injective trapdoor functions via derandomization: how strong is Rudich’s black-box barrier?
L Rotem, G Segev
Journal of Cryptology 34 (4), 39, 2021
42021
Non-malleable vector commitments via local equivocability
L Rotem, G Segev
Journal of Cryptology 36 (4), 40, 2023
32023
Out-of-band authenticated group key exchange: From strong authentication to immediate key delivery
M Naor, L Rotem, G Segev
Cryptology ePrint Archive, 2019
32019
A Fully-Constructive Discrete-Logarithm Preprocessing Algorithm with an Optimal Time-Space Tradeoff
L Rotem, G Segev
3rd Conference on Information-Theoretic Cryptography (ITC 2022), 2022
12022
From One-Time to Two-Round Reusable Multi-signatures Without Nested Forking
L Rotem, G Segev, E Yogev
Theory of Cryptography Conference, 371-399, 2024
2024
Straight-Line Knowledge Extraction for Multi-Round Protocols
L Rotem, S Tessaro
Cryptology ePrint Archive, 2024
2024
The system can't perform the operation now. Try again later.
Articles 1–20