Out-of-Band Authentication in Group Messaging: Computational, Statistical, Optimal. - Lior Rotem; Gil Segev 001 (IACR Cryptol. ePrint Arch., 2018)

Characterization of Secure Multiparty Computation Without Broadcast. - Ran Cohen; Iftach Haitner; Eran Omri; Lior Rotem (J. Cryptol., 2018)

Out-of-Band Authenticated Group Key Exchange: From Strong Authentication to Immediate Key Delivery. - Moni Naor; Lior Rotem; Gil Segev 001 (IACR Cryptol. ePrint Arch., 2019)

Generically Speeding-Up Repeated Squaring is Equivalent to Factoring: Sharp Thresholds for All Generic-Ring Delay Functions. - Lior Rotem; Gil Segev 001 (IACR Cryptol. ePrint Arch., 2020)

Algebraic Distinguishers: From Discrete Logarithms to Decisional Uber Assumptions. - Lior Rotem; Gil Segev 001 (IACR Cryptol. ePrint Arch., 2020)

Generic-Group Delay Functions Require Hidden-Order Groups. - Lior Rotem; Gil Segev 001; Ido Shahaf (IACR Cryptol. ePrint Arch., 2020)

The Security of Lazy Users in Out-of-Band Authentication. - Moni Naor; Lior Rotem; Gil Segev 001 (ACM Trans. Priv. Secur., 2020)

Tighter Security for Schnorr Identification and Signatures: A High-Moment Forking Lemma for ${ varSigma }$-Protocols. - Lior Rotem; Gil Segev 001 (CRYPTO (1), 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 Σ-Protocols. - Lior Rotem; Gil Segev 001 (IACR Cryptol. ePrint Arch., 2021)

Injective Trapdoor Functions via Derandomization: How Strong is Rudich's Black-Box Barrier? - Lior Rotem; Gil Segev 001 (J. Cryptol., 2021)

Accountable Threshold Signatures with Proactive Refresh. - Dan Boneh; Aditi Partap; Lior Rotem (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)

A Fully-Constructive Discrete-Logarithm Preprocessing Algorithm with an Optimal Time-Space Tradeoff. - Lior Rotem; Gil Segev 001 (IACR Cryptol. ePrint Arch., 2022)

From Fairness to Full Security in Multiparty Computation. - Ran Cohen; Iftach Haitner; Eran Omri; Lior Rotem (J. Cryptol., 2022)

Post-Quantum Single Secret Leader Election (SSLE) From Publicly Re-randomizable Commitments. - Dan Boneh; Aditi Partap; Lior Rotem (IACR Cryptol. ePrint Arch., 2023)

Traitor Tracing for Threshold Decryption. - Dan Boneh; Aditi Partap; Lior Rotem (IACR Cryptol. ePrint Arch., 2023)

Non-malleable Vector Commitments via Local Equivocability. - Lior Rotem; Gil Segev 001 (J. Cryptol., 2023)

Accountability for Misbehavior in Threshold Decryption via Threshold Traitor Tracing. - Dan Boneh; Aditi Partap; Lior Rotem (CRYPTO (7), 2024)

Proactive Refresh for Accountable Threshold Signatures. - Dan Boneh; Aditi Partap; Lior Rotem (FC (2), 2024)

Traceable Secret Sharing: Strong Security and Efficient Constructions. - Dan Boneh; Aditi Partap; Lior Rotem (IACR Cryptol. ePrint Arch., 2024)

From One-Time to Two-Round Reusable Multi-Signatures without Nested Forking. - Lior Rotem; Gil Segev 001; Eylon Yogev (IACR Cryptol. ePrint Arch., 2024)

Straight-Line Knowledge Extraction for Multi-Round Protocols. - Lior Rotem; Stefano Tessaro (IACR Cryptol. ePrint Arch., 2024)

Tighter Security for Schnorr Identification and Signatures: A High-Moment Forking Lemma for $ varvec{ Sigma }$-Protocols. - Lior Rotem; Gil Segev 001 (J. Cryptol., 2024)

Goldreich-Krawczyk Revisited: A Note on the Zero Knowledge of Proofs of Knowledge. - Lior Rotem (IACR Commun. Cryptol., 2025)

Context-Dependent Threshold Decryption and its Applications. - Dan Boneh; Benedikt Bünz; Kartik Nayak; Lior Rotem; Victor Shoup (IACR Cryptol. ePrint Arch., 2025)

Traceable Verifiable Random Functions. - Dan Boneh; Aditi Partap; Lior Rotem (IACR Cryptol. ePrint Arch., 2025)

Robust Steganography from Large Language Models. - Neil Perry; Sanket Gupte; Nishant Pitta; Lior Rotem (CoRR, 2025)