Lior Rotem

54 papers A 3B 1Misc 1Journal 32Unranked 17
YearRankTypeTitle / Venue / Authors
2025 — conf
Context-Dependent Threshold Decryption and Its Applications.
ASIACRYPT (6)
Dan Boneh, Benedikt Bünz, Kartik Nayak, Lior Rotem, Victor Shoup
2025 J jnl
Context-Dependent Threshold Decryption and its Applications.
IACR Cryptol. ePrint Arch.
Dan Boneh, Benedikt Bünz, Kartik Nayak, Lior Rotem, Victor Shoup
2025 J jnl
Goldreich-Krawczyk Revisited: A Note on the Zero Knowledge of Proofs of Knowledge.
IACR Commun. Cryptol.
Lior Rotem
2025 J jnl
Robust Steganography from Large Language Models.
CoRR
Neil Perry, Sanket Gupte, Nishant Pitta, Lior Rotem
2025 — conf
Straight-Line Knowledge Extraction for Multi-Round Protocols.
CRYPTO (7)
Lior Rotem, Stefano Tessaro
2025 — conf
Traceable Verifiable Random Functions.
CRYPTO (2)
Dan Boneh, Aditi Partap, Lior Rotem
2025 J jnl
Traceable Verifiable Random Functions.
IACR Cryptol. ePrint Arch.
Dan Boneh, Aditi Partap, Lior Rotem
2024 — conf
Accountability for Misbehavior in Threshold Decryption via Threshold Traitor Tracing.
CRYPTO (7)
Dan Boneh, Aditi Partap, Lior Rotem
2024 J jnl
From One-Time to Two-Round Reusable Multi-Signatures without Nested Forking.
IACR Cryptol. ePrint Arch.
Lior Rotem, Gil Segev, Eylon Yogev
2024 — conf
From One-Time to Two-Round Reusable Multi-signatures Without Nested Forking.
TCC (3)
Lior Rotem, Gil Segev, Eylon Yogev
2024 — conf
Proactive Refresh for Accountable Threshold Signatures.
FC (2)
Dan Boneh, Aditi Partap, Lior Rotem
2024 J jnl
Straight-Line Knowledge Extraction for Multi-Round Protocols.
IACR Cryptol. ePrint Arch.
Lior Rotem, Stefano Tessaro
2024 J jnl
Tighter Security for Schnorr Identification and Signatures: A High-Moment Forking Lemma for $\varvec{\Sigma }$-Protocols.
J. Cryptol.
Lior Rotem, Gil Segev
2024 — conf
Traceable Secret Sharing: Strong Security and Efficient Constructions.
CRYPTO (5)
Dan Boneh, Aditi Partap, Lior Rotem
2024 J jnl
Traceable Secret Sharing: Strong Security and Efficient Constructions.
IACR Cryptol. ePrint Arch.
Dan Boneh, Aditi Partap, Lior Rotem
2023 J jnl
Non-malleable Vector Commitments via Local Equivocability.
J. Cryptol.
Lior Rotem, Gil Segev
2023 J jnl
Post-Quantum Single Secret Leader Election (SSLE) From Publicly Re-randomizable Commitments.
IACR Cryptol. ePrint Arch.
Dan Boneh, Aditi Partap, Lior Rotem
2023 B conf
Post-Quantum Single Secret Leader Election (SSLE) from Publicly Re-Randomizable Commitments.
AFT
Dan Boneh, Aditi Partap, Lior Rotem
2023 J jnl
Traitor Tracing for Threshold Decryption.
IACR Cryptol. ePrint Arch.
Dan Boneh, Aditi Partap, Lior Rotem
2022 A conf
A Fully-Constructive Discrete-Logarithm Preprocessing Algorithm with an Optimal Time-Space Tradeoff.
ITC
Lior Rotem, Gil Segev
2022 J jnl
A Fully-Constructive Discrete-Logarithm Preprocessing Algorithm with an Optimal Time-Space Tradeoff.
IACR Cryptol. ePrint Arch.
Lior Rotem, Gil Segev
2022 J jnl
Accountable Threshold Signatures with Proactive Refresh.
IACR Cryptol. ePrint Arch.
Dan Boneh, Aditi Partap, Lior Rotem
2022 J jnl
From Fairness to Full Security in Multiparty Computation.
J. Cryptol.
Ran Cohen, Iftach Haitner, Eran Omri, Lior Rotem
2022 A conf
Revisiting the Uber Assumption in the Algebraic Group Model: Fine-Grained Bounds in Hidden-Order Groups and Improved Reductions in Bilinear Groups.
ITC
Lior Rotem
2022 J jnl
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.
Lior Rotem
2021 J jnl
Characterization of Secure Multiparty Computation Without Broadcast.
CoRR
Ran Cohen, Iftach Haitner, Eran Omri, Lior Rotem
2021 J jnl
From Fairness to Full Security in Multiparty Computation.
CoRR
Ran Cohen, Iftach Haitner, Eran Omri, Lior Rotem
2021 J jnl
Injective Trapdoor Functions via Derandomization: How Strong is Rudich's Black-Box Barrier?
J. Cryptol.
Lior Rotem, Gil Segev
2021 J jnl
Non-Malleable Vector Commitments via Local Equivocability.
IACR Cryptol. ePrint Arch.
Lior Rotem, Gil Segev
2021 — conf
Non-malleable Vector Commitments via Local Equivocability.
TCC (3)
Lior Rotem, Gil Segev
2021 — conf
Simple and Efficient Batch Verification Techniques for Verifiable Delay Functions.
TCC (3)
Lior Rotem
2021 J jnl
Simple and Efficient Batch Verification Techniques for Verifiable Delay Functions.
IACR Cryptol. ePrint Arch.
Lior Rotem
2021 — conf
Tighter Security for Schnorr Identification and Signatures: A High-Moment Forking Lemma for ${\varSigma }$-Protocols.
CRYPTO (1)
Lior Rotem, Gil Segev
2021 J jnl
Tighter Security for Schnorr Identification and Signatures: A High-Moment Forking Lemma for Σ-Protocols.
IACR Cryptol. ePrint Arch.
Lior Rotem, Gil Segev
2020 — conf
Algebraic Distinguishers: From Discrete Logarithms to Decisional Uber Assumptions.
TCC (3)
Lior Rotem, Gil Segev
2020 J jnl
Algebraic Distinguishers: From Discrete Logarithms to Decisional Uber Assumptions.
IACR Cryptol. ePrint Arch.
Lior Rotem, Gil Segev
2020 — conf
Generic-Group Delay Functions Require Hidden-Order Groups.
EUROCRYPT (3)
Lior Rotem, Gil Segev, Ido Shahaf
2020 J jnl
Generic-Group Delay Functions Require Hidden-Order Groups.
IACR Cryptol. ePrint Arch.
Lior Rotem, Gil Segev, Ido Shahaf
2020 — conf
Generically Speeding-Up Repeated Squaring Is Equivalent to Factoring: Sharp Thresholds for All Generic-Ring Delay Functions.
CRYPTO (3)
Lior Rotem, Gil Segev
2020 J jnl
Generically Speeding-Up Repeated Squaring is Equivalent to Factoring: Sharp Thresholds for All Generic-Ring Delay Functions.
IACR Cryptol. ePrint Arch.
Lior Rotem, Gil Segev
2020 A conf
Out-Of-Band Authenticated Group Key Exchange: From Strong Authentication to Immediate Key Delivery.
ITC
Moni Naor, Lior Rotem, Gil Segev
2020 J jnl
The Security of Lazy Users in Out-of-Band Authentication.
ACM Trans. Priv. Secur.
Moni Naor, Lior Rotem, Gil Segev
2019 J jnl
From Fairness to Full Security in Multiparty Computation.
IACR Cryptol. ePrint Arch.
Ran Cohen, Iftach Haitner, Eran Omri, Lior Rotem
2019 J jnl
Out-of-Band Authenticated Group Key Exchange: From Strong Authentication to Immediate Key Delivery.
IACR Cryptol. ePrint Arch.
Moni Naor, Lior Rotem, Gil Segev
2018 J jnl
Characterization of Secure Multiparty Computation Without Broadcast.
J. Cryptol.
Ran Cohen, Iftach Haitner, Eran Omri, Lior Rotem
2018 Misc conf
From Fairness to Full Security in Multiparty Computation.
SCN
Ran Cohen, Iftach Haitner, Eran Omri, Lior Rotem
2018 — conf
Injective Trapdoor Functions via Derandomization: How Strong is Rudich's Black-Box Barrier?
TCC (1)
Lior Rotem, Gil Segev
2018 J jnl
Injective Trapdoor Functions via Derandomization: How Strong is Rudich's Black-Box Barrier?
IACR Cryptol. ePrint Arch.
Lior Rotem, Gil Segev
2018 — conf
Out-of-Band Authentication in Group Messaging: Computational, Statistical, Optimal.
CRYPTO (1)
Lior Rotem, Gil Segev
2018 J jnl
Out-of-Band Authentication in Group Messaging: Computational, Statistical, Optimal.
IACR Cryptol. ePrint Arch.
Lior Rotem, Gil Segev
2018 — conf
The Security of Lazy Users in Out-of-Band Authentication.
TCC (2)
Moni Naor, Lior Rotem, Gil Segev
2018 J jnl
The Security of Lazy Users in Out-of-Band Authentication.
IACR Cryptol. ePrint Arch.
Moni Naor, Lior Rotem, Gil Segev
2016 — conf
Characterization of Secure Multiparty Computation Without Broadcast.
TCC (A1)
Ran Cohen, Iftach Haitner, Eran Omri, Lior Rotem
2015 J jnl
Characterization of Secure Multiparty Computation Without Broadcast.
IACR Cryptol. ePrint Arch.
Ran Cohen, Iftach Haitner, Eran Omri, Lior Rotem