default search action
Ohad Klein
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j3]Itai Dinur
, Nathan Keller
Fine-grained Cryptanalysis: Tight Conditional Bounds for Dense k-SUM and k-XOR. J. ACM 71(3): 23 (2024) - [c9]Shai Evra, Shay Gadot, Ohad Klein, Ilan Komargodski:
Verifying Groups in Linear Time. FOCS 2024: 2131-2147 - [c8]Ohad Klein, Joseph Slote, Alexander Volberg, Haonan Zhang:
Quantum and Classical Low-Degree Learning via a Dimension-Free Remez Inequality. ITCS 2024: 69:1-69:22 - [c7]Ohad Klein
On the (Im)possibility of Game-Theoretically Fair Leader Election Protocols. TCC (1) 2024: 383-412 - [i10]Ohad Klein, Ilan Komargodski, Chenzhi Zhu:
On the (Im)possibility of Game-Theoretically Fair Leader Election Protocols. IACR Cryptol. ePrint Arch. 2024: 1961 (2024) - 2023
- [c6]Ohad Klein
New Bounds on the Local Leakage Resilience of Shamir's Secret Sharing Scheme. CRYPTO (1) 2023: 139-170 - [c5]Ohad Klein:
Slicing all Edges of an n-cube Requires n2/3 Hyperplanes. FOCS 2023: 1931-1936 - [i9]Shai Evra, Shay Gadot, Ohad Klein, Ilan Komargodski:
Verifying Groups in Linear Time. Electron. Colloquium Comput. Complex. TR23 (2023) - [i8]Ohad Klein, Ilan Komargodski:
New Bounds on the Local Leakage Resilience of Shamir's Secret Sharing Scheme. IACR Cryptol. ePrint Arch. 2023: 805 (2023) - 2022
- [j2]Vojtech Dvorak, Ohad Klein:
Probability Mass of Rademacher Sums Beyond One Standard Deviation. SIAM J. Discret. Math. 36(3): 2393-2410 (2022) - [c4]Elette Boyle, Itai Dinur, Niv Gilboa, Yuval Ishai, Nathan Keller, Ohad Klein:
Locality-Preserving Hashing for Shifts with Connections to Cryptography. ITCS 2022: 27:1-27:24 - [i7]Elette Boyle, Itai Dinur, Niv Gilboa, Yuval Ishai, Nathan Keller, Ohad Klein:
Locality-Preserving Hashing for Shifts with Connections to Cryptography. CoRR abs/2201.03041 (2022) - [i6]Elette Boyle, Itai Dinur, Niv Gilboa, Yuval Ishai, Nathan Keller, Ohad Klein:
Locality-Preserving Hashing for Shifts with Connections to Cryptography. IACR Cryptol. ePrint Arch. 2022: 28 (2022) - 2021
- [c3]Itai Dinur, Nathan Keller, Ohad Klein:
Fine-Grained Cryptanalysis: Tight Conditional Bounds for Dense k-SUM and k-XOR. FOCS 2021: 80-91 - [c2]Nathan Keller, Ohad Klein:
Local concentration inequalities and Tomaszewski's conjecture. STOC 2021: 1656-1669 - [i5]Itai Dinur, Nathan Keller, Ohad Klein:
Fine-Grained Cryptanalysis: Tight Conditional Bounds for Dense k-SUM and k-XOR. CoRR abs/2111.00486 (2021) - [i4]Itai Dinur, Nathan Keller, Ohad Klein:
Fine-Grained Cryptanalysis: Tight Conditional Bounds for Dense k-SUM and k-XOR. IACR Cryptol. ePrint Arch. 2021: 1460 (2021) - 2020
- [j1]Itai Dinur, Nathan Keller, Ohad Klein:
An Optimal Distributed Discrete Log Protocol with Applications to Homomorphic Secret Sharing. J. Cryptol. 33(3): 824-873 (2020)
2010 – 2019
- 2019
- [i3]Nathan Keller, Ohad Klein:
A structure theorem for almost low-degree functions on the slice. CoRR abs/1901.08839 (2019) - 2018
- [c1]Itai Dinur, Nathan Keller, Ohad Klein:
An Optimal Distributed Discrete Log Protocol with Applications to Homomorphic Secret Sharing. CRYPTO (3) 2018: 213-242 - [i2]Itai Dinur, Nathan Keller, Ohad Klein:
An Optimal Distributed Discrete Log Protocol with Applications to Homomorphic Secret Sharing. IACR Cryptol. ePrint Arch. 2018: 731 (2018) - 2017
- [i1]Nathan Keller, Ohad Klein:
Biased halfspaces, noise sensitivity, and relative Chernoff inequalities (extended version). CoRR abs/1710.07429 (2017)
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 2025-01-13 01:04 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: