CUFinder

Lior Rotem

About Lior Rotem

Lior Rotem, With an exceptional h-index of 8 and a recent h-index of 8 (since 2020), a distinguished researcher at Hebrew University of Jerusalem, specializes in the field of Cryptography, Computer Security, Theoretical Computer Science.

His recent articles reflect a diverse array of research interests and contributions to the field:

Traceable Secret Sharing: Strong Security and Efficient Constructions

Non-malleable vector commitments via local equivocability

Accountability for Misbehavior in Threshold Decryption via Threshold Traitor Tracing

Post-Quantum Single Secret Leader Election (SSLE) from Publicly Re-Randomizable Commitments

Proactive refresh for accountable threshold signatures

Revisiting the uber assumption in the algebraic group model: fine-grained bounds in hidden-order groups and improved reductions in bilinear groups

A Fully-Constructive Discrete-Logarithm Preprocessing Algorithm with an Optimal Time-Space Tradeoff

From fairness to full security in multiparty computation

Lior Rotem Information

University

Position

___

Citations(all)

153

Citations(since 2020)

142

Cited By

52

hIndex(all)

8

hIndex(since 2020)

8

i10Index(all)

8

i10Index(since 2020)

8

Email

University Profile Page

Google Scholar

Lior Rotem Skills & Research Interests

Cryptography

Computer Security

Theoretical Computer Science

Top articles of Lior Rotem

Traceable Secret Sharing: Strong Security and Efficient Constructions

Cryptology ePrint Archive

2024

Dan Boneh
Dan Boneh

H-Index: 87

Lior Rotem
Lior Rotem

H-Index: 4

Non-malleable vector commitments via local equivocability

Journal of Cryptology

2023/10

Lior Rotem
Lior Rotem

H-Index: 4

Accountability for Misbehavior in Threshold Decryption via Threshold Traitor Tracing

Cryptology ePrint Archive

2023

Dan Boneh
Dan Boneh

H-Index: 87

Lior Rotem
Lior Rotem

H-Index: 4

Post-Quantum Single Secret Leader Election (SSLE) from Publicly Re-Randomizable Commitments

Cryptology ePrint Archive

2023

Dan Boneh
Dan Boneh

H-Index: 87

Lior Rotem
Lior Rotem

H-Index: 4

Proactive refresh for accountable threshold signatures

Cryptology ePrint Archive

2022

Dan Boneh
Dan Boneh

H-Index: 87

Lior Rotem
Lior Rotem

H-Index: 4

Revisiting the uber assumption in the algebraic group model: fine-grained bounds in hidden-order groups and improved reductions in bilinear groups

Cryptology ePrint Archive

2022

Lior Rotem
Lior Rotem

H-Index: 4

A Fully-Constructive Discrete-Logarithm Preprocessing Algorithm with an Optimal Time-Space Tradeoff

2022

Lior Rotem
Lior Rotem

H-Index: 4

From fairness to full security in multiparty computation

Journal of Cryptology

2022/1

Ran Cohen
Ran Cohen

H-Index: 7

Iftach Haitner
Iftach Haitner

H-Index: 17

Lior Rotem
Lior Rotem

H-Index: 4

Injective trapdoor functions via derandomization: how strong is Rudich’s black-box barrier?

Journal of Cryptology

2021/10

Lior Rotem
Lior Rotem

H-Index: 4

Out-of-band authentication in group communications

2021/8/17

Simple and efficient batch verification techniques for verifiable delay functions

2021

Lior Rotem
Lior Rotem

H-Index: 4

Tighter Security for Schnorr Identification and Signatures: A High-Moment Forking Lemma for -Protocols

2021

Lior Rotem
Lior Rotem

H-Index: 4

Generically speeding-up repeated squaring is equivalent to factoring: Sharp thresholds for all generic-ring delay functions

2020/8/10

Lior Rotem
Lior Rotem

H-Index: 4

Generic-group delay functions require hidden-order groups

2020/5/1

Lior Rotem
Lior Rotem

H-Index: 4

The security of lazy users in out-of-band authentication

ACM Transactions on Privacy and Security (TOPS)

2020/4/13

Moni Naor
Moni Naor

H-Index: 59

Lior Rotem
Lior Rotem

H-Index: 4

Algebraic distinguishers: from discrete logarithms to decisional uber assumptions

2020

Lior Rotem
Lior Rotem

H-Index: 4

See List of Professors in Lior Rotem University(Hebrew University of Jerusalem)