Lior Rotem

According to our database, Lior Rotem authored at least 23 papers between 2018 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2024

Tighter Security for Schnorr Identification and Signatures: A High-Moment Forking Lemma for $\varvec{\Sigma }$-Protocols.

Lior Rotem, Gil Segev

J. Cryptol., September, 2024

Straight-Line Knowledge Extraction for Multi-Round Protocols.

Lior Rotem, Stefano Tessaro

IACR Cryptol. ePrint Arch., 2024

From One-Time to Two-Round Reusable Multi-Signatures without Nested Forking.

Lior Rotem, Gil Segev, Eylon Yogev

IACR Cryptol. ePrint Arch., 2024

Traceable Secret Sharing: Strong Security and Efficient Constructions.

Dan Boneh, Aditi Partap, Lior Rotem

IACR Cryptol. ePrint Arch., 2024

Accountability for Misbehavior in Threshold Decryption via Threshold Traitor Tracing.

Dan Boneh, Aditi Partap, Lior Rotem

Proceedings of the Advances in Cryptology - CRYPTO 2024, 2024

2023

Non-malleable Vector Commitments via Local Equivocability.

Lior Rotem, Gil Segev

J. Cryptol., October, 2023

Traitor Tracing for Threshold Decryption.

Dan Boneh, Aditi Partap, Lior Rotem

IACR Cryptol. ePrint Arch., 2023

Post-Quantum Single Secret Leader Election (SSLE) From Publicly Re-randomizable Commitments.

Dan Boneh, Aditi Partap, Lior Rotem

IACR Cryptol. ePrint Arch., 2023

2022

From Fairness to Full Security in Multiparty Computation.

Ran Cohen, Iftach Haitner, Eran Omri, Lior Rotem

J. Cryptol., 2022

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

Lior Rotem, Gil Segev

IACR Cryptol. ePrint Arch., 2022

Revisiting the Uber Assumption in the Algebraic Group Model: Fine-Grained Bounds in Hidden-Order Groups and Improved Reductions in Bilinear Groups.

Lior Rotem

IACR Cryptol. ePrint Arch., 2022

Accountable Threshold Signatures with Proactive Refresh.

Dan Boneh, Aditi Partap, Lior Rotem

IACR Cryptol. ePrint Arch., 2022

2021

Injective Trapdoor Functions via Derandomization: How Strong is Rudich's Black-Box Barrier?

Lior Rotem, Gil Segev

J. Cryptol., 2021

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

Lior Rotem, Gil Segev

IACR Cryptol. ePrint Arch., 2021

Simple and Efficient Batch Verification Techniques for Verifiable Delay Functions.

Lior Rotem

IACR Cryptol. ePrint Arch., 2021

Tighter Security for Schnorr Identification and Signatures: A High-Moment Forking Lemma for ${\varSigma }$-Protocols.

Lior Rotem, Gil Segev

Proceedings of the Advances in Cryptology - CRYPTO 2021, 2021

2020

The Security of Lazy Users in Out-of-Band Authentication.

Moni Naor, Lior Rotem, Gil Segev

ACM Trans. Priv. Secur., 2020

Generic-Group Delay Functions Require Hidden-Order Groups.

Lior Rotem, Gil Segev, Ido Shahaf

IACR Cryptol. ePrint Arch., 2020

Algebraic Distinguishers: From Discrete Logarithms to Decisional Uber Assumptions.

Lior Rotem, Gil Segev

IACR Cryptol. ePrint Arch., 2020

Generically Speeding-Up Repeated Squaring is Equivalent to Factoring: Sharp Thresholds for All Generic-Ring Delay Functions.

Lior Rotem, Gil Segev

IACR Cryptol. ePrint Arch., 2020

2019

Out-of-Band Authenticated Group Key Exchange: From Strong Authentication to Immediate Key Delivery.

Moni Naor, Lior Rotem, Gil Segev

IACR Cryptol. ePrint Arch., 2019

2018

Characterization of Secure Multiparty Computation Without Broadcast.

Ran Cohen, Iftach Haitner, Eran Omri, Lior Rotem

J. Cryptol., 2018

Out-of-Band Authentication in Group Messaging: Computational, Statistical, Optimal.

Lior Rotem, Gil Segev

IACR Cryptol. ePrint Arch., 2018