Lior Rotem

Publication Activity (10 Years)

Years Active: 2015-2024
Publications (10 Years): 43

Top Topics

Straight Forward

Secure Multiparty Computation

Top Venues

IACR Cryptol. ePrint Arch.

Publications

Dan Boneh, Aditi Partap, Lior Rotem
Traceable Secret Sharing: Strong Security and Efficient Constructions. IACR Cryptol. ePrint Arch. 2024 (2024)
Dan Boneh, Aditi Partap, Lior Rotem
Traceable Secret Sharing: Strong Security and Efficient Constructions. CRYPTO (5) (2024)
Lior Rotem, Gil Segev
Tighter Security for Schnorr Identification and Signatures: A High-Moment Forking Lemma for $\varvec{\Sigma }$-Protocols. J. Cryptol. 37 (3) (2024)
Dan Boneh, Aditi Partap, Lior Rotem
Accountability for Misbehavior in Threshold Decryption via Threshold Traitor Tracing. CRYPTO (7) (2024)
Dan Boneh, Aditi Partap, Lior Rotem
Traitor Tracing for Threshold Decryption. IACR Cryptol. ePrint Arch. 2023 (2023)
Dan Boneh, Aditi Partap, Lior Rotem
Post-Quantum Single Secret Leader Election (SSLE) From Publicly Re-randomizable Commitments. IACR Cryptol. ePrint Arch. 2023 (2023)
Lior Rotem, Gil Segev
Non-malleable Vector Commitments via Local Equivocability. J. Cryptol. 36 (4) (2023)
Dan Boneh, Aditi Partap, Lior Rotem
Post-Quantum Single Secret Leader Election (SSLE) from Publicly Re-Randomizable Commitments. AFT (2023)
Lior Rotem, Gil Segev
A Fully-Constructive Discrete-Logarithm Preprocessing Algorithm with an Optimal Time-Space Tradeoff. ITC (2022)
Lior Rotem, Gil Segev
A Fully-Constructive Discrete-Logarithm Preprocessing Algorithm with an Optimal Time-Space Tradeoff. IACR Cryptol. ePrint Arch. 2022 (2022)
Lior Rotem
Revisiting the Uber Assumption in the Algebraic Group Model: Fine-Grained Bounds in Hidden-Order Groups and Improved Reductions in Bilinear Groups. IACR Cryptol. ePrint Arch. 2022 (2022)
Ran Cohen, Iftach Haitner, Eran Omri, Lior Rotem
From Fairness to Full Security in Multiparty Computation. J. Cryptol. 35 (1) (2022)
Dan Boneh, Aditi Partap, Lior Rotem
Accountable Threshold Signatures with Proactive Refresh. IACR Cryptol. ePrint Arch. 2022 (2022)
Lior Rotem
Revisiting the Uber Assumption in the Algebraic Group Model: Fine-Grained Bounds in Hidden-Order Groups and Improved Reductions in Bilinear Groups. ITC (2022)
Lior Rotem, Gil Segev
Tighter Security for Schnorr Identification and Signatures: A High-Moment Forking Lemma for ${\varSigma }$-Protocols. CRYPTO (1) (2021)
Ran Cohen, Iftach Haitner, Eran Omri, Lior Rotem
Characterization of Secure Multiparty Computation Without Broadcast. CoRR (2021)
Lior Rotem, Gil Segev
Non-Malleable Vector Commitments via Local Equivocability. IACR Cryptol. ePrint Arch. 2021 (2021)
Lior Rotem
Simple and Efficient Batch Verification Techniques for Verifiable Delay Functions. TCC (3) (2021)
Lior Rotem, Gil Segev
Injective Trapdoor Functions via Derandomization: How Strong is Rudich's Black-Box Barrier? J. Cryptol. 34 (4) (2021)
Ran Cohen, Iftach Haitner, Eran Omri, Lior Rotem
From Fairness to Full Security in Multiparty Computation. CoRR (2021)
Lior Rotem
Simple and Efficient Batch Verification Techniques for Verifiable Delay Functions. IACR Cryptol. ePrint Arch. 2021 (2021)
Lior Rotem, Gil Segev
Tighter Security for Schnorr Identification and Signatures: A High-Moment Forking Lemma for Σ-Protocols. IACR Cryptol. ePrint Arch. 2021 (2021)
Lior Rotem, Gil Segev
Non-malleable Vector Commitments via Local Equivocability. TCC (3) (2021)
Lior Rotem, Gil Segev
Algebraic Distinguishers: From Discrete Logarithms to Decisional Uber Assumptions. TCC (3) (2020)
Lior Rotem, Gil Segev
Algebraic Distinguishers: From Discrete Logarithms to Decisional Uber Assumptions. IACR Cryptol. ePrint Arch. 2020 (2020)
Lior Rotem, Gil Segev, Ido Shahaf
Generic-Group Delay Functions Require Hidden-Order Groups. EUROCRYPT (3) (2020)
Lior Rotem, Gil Segev, Ido Shahaf
Generic-Group Delay Functions Require Hidden-Order Groups. IACR Cryptol. ePrint Arch. 2020 (2020)
Lior Rotem, Gil Segev
Generically Speeding-Up Repeated Squaring is Equivalent to Factoring: Sharp Thresholds for All Generic-Ring Delay Functions. IACR Cryptol. ePrint Arch. 2020 (2020)
Lior Rotem, Gil Segev
Generically Speeding-Up Repeated Squaring Is Equivalent to Factoring: Sharp Thresholds for All Generic-Ring Delay Functions. CRYPTO (3) (2020)
Moni Naor, Lior Rotem, Gil Segev
The Security of Lazy Users in Out-of-Band Authentication. ACM Trans. Priv. Secur. 23 (2) (2020)
Moni Naor, Lior Rotem, Gil Segev
Out-Of-Band Authenticated Group Key Exchange: From Strong Authentication to Immediate Key Delivery. ITC (2020)
Ran Cohen, Iftach Haitner, Eran Omri, Lior Rotem
From Fairness to Full Security in Multiparty Computation. IACR Cryptol. ePrint Arch. 2019 (2019)
Moni Naor, Lior Rotem, Gil Segev
Out-of-Band Authenticated Group Key Exchange: From Strong Authentication to Immediate Key Delivery. IACR Cryptol. ePrint Arch. 2019 (2019)
Lior Rotem, Gil Segev
Out-of-Band Authentication in Group Messaging: Computational, Statistical, Optimal. IACR Cryptol. ePrint Arch. 2018 (2018)
Ran Cohen, Iftach Haitner, Eran Omri, Lior Rotem
Characterization of Secure Multiparty Computation Without Broadcast. J. Cryptol. 31 (2) (2018)
Moni Naor, Lior Rotem, Gil Segev
The Security of Lazy Users in Out-of-Band Authentication. IACR Cryptol. ePrint Arch. 2018 (2018)
Lior Rotem, Gil Segev
Injective Trapdoor Functions via Derandomization: How Strong is Rudich's Black-Box Barrier? IACR Cryptol. ePrint Arch. 2018 (2018)
Moni Naor, Lior Rotem, Gil Segev
The Security of Lazy Users in Out-of-Band Authentication. TCC (2) (2018)
Lior Rotem, Gil Segev
Out-of-Band Authentication in Group Messaging: Computational, Statistical, Optimal. CRYPTO (1) (2018)
Ran Cohen, Iftach Haitner, Eran Omri, Lior Rotem
From Fairness to Full Security in Multiparty Computation. SCN (2018)
Lior Rotem, Gil Segev
Injective Trapdoor Functions via Derandomization: How Strong is Rudich's Black-Box Barrier? TCC (1) (2018)
Ran Cohen, Iftach Haitner, Eran Omri, Lior Rotem
Characterization of Secure Multiparty Computation Without Broadcast. TCC (A1) (2016)
Ran Cohen, Iftach Haitner, Eran Omri, Lior Rotem
Characterization of Secure Multiparty Computation Without Broadcast. IACR Cryptol. ePrint Arch. 2015 (2015)