Lior Rotem

IACR Cryptol. ePrint Arch., 2025

Context-Dependent Threshold Decryption and its Applications.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2025

Goldreich-Krawczyk Revisited: A Note on the Zero Knowledge of Proofs of Knowledge.

[BibT_eX]

[DOI]

IACR Commun. Cryptol., 2025

2024

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

[BibT_eX]

[DOI]

J. Cryptol., September, 2024

Straight-Line Knowledge Extraction for Multi-Round Protocols.

[BibT_eX]

[DOI]

Stefano Tessaro

IACR Cryptol. ePrint Arch., 2024

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

[BibT_eX]

[DOI]

Eylon Yogev

IACR Cryptol. ePrint Arch., 2024

Traceable Secret Sharing: Strong Security and Efficient Constructions.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2024

Proactive Refresh for Accountable Threshold Signatures.

[BibT_eX]

[DOI]

Proceedings of the Financial Cryptography and Data Security, 2024

Accountability for Misbehavior in Threshold Decryption via Threshold Traitor Tracing.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2024, 2024

2023

Non-malleable Vector Commitments via Local Equivocability.

[BibT_eX]

[DOI]

J. Cryptol., October, 2023

Traitor Tracing for Threshold Decryption.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2023

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

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2023

2022

From Fairness to Full Security in Multiparty Computation.

[BibT_eX]

[DOI]

J. Cryptol., 2022

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

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2022

Accountable Threshold Signatures with Proactive Refresh.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2022

2021

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

[BibT_eX]

[DOI]

J. Cryptol., 2021

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

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2021

Simple and Efficient Batch Verification Techniques for Verifiable Delay Functions.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2021

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

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2021, 2021

2020

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

[BibT_eX]

[DOI]

Moni Naor

ACM Trans. Priv. Secur., 2020

Generic-Group Delay Functions Require Hidden-Order Groups.

[BibT_eX]

[DOI]

Ido Shahaf

IACR Cryptol. ePrint Arch., 2020

Algebraic Distinguishers: From Discrete Logarithms to Decisional Uber Assumptions.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2020

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

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2020

2019

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

[BibT_eX]

[DOI]

Moni Naor

IACR Cryptol. ePrint Arch., 2019

2018

Characterization of Secure Multiparty Computation Without Broadcast.

[BibT_eX]

[DOI]

J. Cryptol., 2018

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

[BibT_eX]

[DOI]