default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLior Rotem
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j6]Lior Rotem, Gil Segev:
Tighter Security for Schnorr Identification and Signatures: A High-Moment Forking Lemma for $\varvec{\Sigma }$-Protocols. J. Cryptol. 37(3): 26 (2024)- [c17]Dan Boneh, Aditi Partap, Lior Rotem:
Traceable Secret Sharing: Strong Security and Efficient Constructions. CRYPTO (5) 2024: 221-256 - [c16]Dan Boneh, Aditi Partap, Lior Rotem:
Accountability for Misbehavior in Threshold Decryption via Threshold Traitor Tracing. CRYPTO (7) 2024: 317-351 - [i22]Dan Boneh, Aditi Partap, Lior Rotem:
Traceable Secret Sharing: Strong Security and Efficient Constructions. IACR Cryptol. ePrint Arch. 2024: 405 (2024) - [i21]Lior Rotem, Gil Segev, Eylon Yogev:
From One-Time to Two-Round Reusable Multi-Signatures without Nested Forking. IACR Cryptol. ePrint Arch. 2024: 1704 (2024) - [i20]Lior Rotem, Stefano Tessaro:
Straight-Line Knowledge Extraction for Multi-Round Protocols. IACR Cryptol. ePrint Arch. 2024: 1724 (2024) - 2023
- [j5]Lior Rotem, Gil Segev:
Non-malleable Vector Commitments via Local Equivocability. J. Cryptol. 36(4): 40 (2023) - [c15]Dan Boneh, Aditi Partap, Lior Rotem:
Post-Quantum Single Secret Leader Election (SSLE) from Publicly Re-Randomizable Commitments. AFT 2023: 26:1-26:23 - [i19]Dan Boneh, Aditi Partap, Lior Rotem:
Post-Quantum Single Secret Leader Election (SSLE) From Publicly Re-randomizable Commitments. IACR Cryptol. ePrint Arch. 2023: 1241 (2023) - [i18]Dan Boneh, Aditi Partap, Lior Rotem:
Traitor Tracing for Threshold Decryption. IACR Cryptol. ePrint Arch. 2023: 1724 (2023) - 2022
- [j4]Ran Cohen, Iftach Haitner, Eran Omri, Lior Rotem:
From Fairness to Full Security in Multiparty Computation. J. Cryptol. 35(1): 4 (2022) - [c14]Lior Rotem, Gil Segev:
A Fully-Constructive Discrete-Logarithm Preprocessing Algorithm with an Optimal Time-Space Tradeoff. ITC 2022: 12:1-12:16 - [c13]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: 13:1-13:13 - [i17]Lior Rotem, Gil Segev:
A Fully-Constructive Discrete-Logarithm Preprocessing Algorithm with an Optimal Time-Space Tradeoff. IACR Cryptol. ePrint Arch. 2022: 583 (2022) - [i16]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: 584 (2022) - [i15]Dan Boneh, Aditi Partap, Lior Rotem:
Accountable Threshold Signatures with Proactive Refresh. IACR Cryptol. ePrint Arch. 2022: 1656 (2022) - 2021
- [j3]Lior Rotem, Gil Segev:
Injective Trapdoor Functions via Derandomization: How Strong is Rudich's Black-Box Barrier? J. Cryptol. 34(4): 39 (2021) - [c12]Lior Rotem, Gil Segev:
Tighter Security for Schnorr Identification and Signatures: A High-Moment Forking Lemma for ${\varSigma }$-Protocols. CRYPTO (1) 2021: 222-250 - [c11]Lior Rotem:
Simple and Efficient Batch Verification Techniques for Verifiable Delay Functions. TCC (3) 2021: 382-414 - [c10]Lior Rotem, Gil Segev:
Non-malleable Vector Commitments via Local Equivocability. TCC (3) 2021: 415-446 - [i14]Ran Cohen, Iftach Haitner, Eran Omri, Lior Rotem:
Characterization of Secure Multiparty Computation Without Broadcast. CoRR abs/2105.00732 (2021) - [i13]Ran Cohen, Iftach Haitner, Eran Omri, Lior Rotem:
From Fairness to Full Security in Multiparty Computation. CoRR abs/2105.00962 (2021) - [i12]Lior Rotem, Gil Segev:
Tighter Security for Schnorr Identification and Signatures: A High-Moment Forking Lemma for Σ-Protocols. IACR Cryptol. ePrint Arch. 2021: 971 (2021) - [i11]Lior Rotem, Gil Segev:
Non-Malleable Vector Commitments via Local Equivocability. IACR Cryptol. ePrint Arch. 2021: 1207 (2021) - [i10]Lior Rotem:
Simple and Efficient Batch Verification Techniques for Verifiable Delay Functions. IACR Cryptol. ePrint Arch. 2021: 1209 (2021) - 2020
- [j2]Moni Naor, Lior Rotem, Gil Segev:
The Security of Lazy Users in Out-of-Band Authentication. ACM Trans. Priv. Secur. 23(2): 9:1-9:32 (2020) - [c9]Lior Rotem, Gil Segev:
Generically Speeding-Up Repeated Squaring Is Equivalent to Factoring: Sharp Thresholds for All Generic-Ring Delay Functions. CRYPTO (3) 2020: 481-509 - [c8]Lior Rotem, Gil Segev, Ido Shahaf:
Generic-Group Delay Functions Require Hidden-Order Groups. EUROCRYPT (3) 2020: 155-180 - [c7]Moni Naor, Lior Rotem, Gil Segev:
Out-Of-Band Authenticated Group Key Exchange: From Strong Authentication to Immediate Key Delivery. ITC 2020: 9:1-9:25 - [c6]Lior Rotem, Gil Segev:
Algebraic Distinguishers: From Discrete Logarithms to Decisional Uber Assumptions. TCC (3) 2020: 366-389 - [i9]Lior Rotem, Gil Segev, Ido Shahaf:
Generic-Group Delay Functions Require Hidden-Order Groups. IACR Cryptol. ePrint Arch. 2020: 225 (2020) - [i8]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: 812 (2020) - [i7]Lior Rotem, Gil Segev:
Algebraic Distinguishers: From Discrete Logarithms to Decisional Uber Assumptions. IACR Cryptol. ePrint Arch. 2020: 1144 (2020)
2010 – 2019
- 2019
- [i6]Ran Cohen, Iftach Haitner, Eran Omri, Lior Rotem:
From Fairness to Full Security in Multiparty Computation. IACR Cryptol. ePrint Arch. 2019: 1344 (2019) - [i5]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: 1458 (2019) - 2018
- [j1]Ran Cohen
, Iftach Haitner, Eran Omri, Lior Rotem:
Characterization of Secure Multiparty Computation Without Broadcast. J. Cryptol. 31(2): 587-609 (2018) - [c5]Lior Rotem, Gil Segev:
Out-of-Band Authentication in Group Messaging: Computational, Statistical, Optimal. CRYPTO (1) 2018: 63-89 - [c4]Ran Cohen, Iftach Haitner, Eran Omri, Lior Rotem:
From Fairness to Full Security in Multiparty Computation. SCN 2018: 216-234 - [c3]Lior Rotem, Gil Segev:
Injective Trapdoor Functions via Derandomization: How Strong is Rudich's Black-Box Barrier? TCC (1) 2018: 421-447 - [c2]Moni Naor, Lior Rotem, Gil Segev:
The Security of Lazy Users in Out-of-Band Authentication. TCC (2) 2018: 575-599 - [i4]Lior Rotem, Gil Segev:
Out-of-Band Authentication in Group Messaging: Computational, Statistical, Optimal. IACR Cryptol. ePrint Arch. 2018: 493 (2018) - [i3]Lior Rotem, Gil Segev:
Injective Trapdoor Functions via Derandomization: How Strong is Rudich's Black-Box Barrier? IACR Cryptol. ePrint Arch. 2018: 812 (2018) - [i2]Moni Naor, Lior Rotem, Gil Segev:
The Security of Lazy Users in Out-of-Band Authentication. IACR Cryptol. ePrint Arch. 2018: 823 (2018) - 2016
- [c1]Ran Cohen, Iftach Haitner, Eran Omri, Lior Rotem:
Characterization of Secure Multiparty Computation Without Broadcast. TCC (A1) 2016: 596-616 - 2015
- [i1]Ran Cohen, Iftach Haitner, Eran Omri, Lior Rotem:
Characterization of Secure Multiparty Computation Without Broadcast. IACR Cryptol. ePrint Arch. 2015: 846 (2015)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-11 21:30 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
