Biased halfspaces, noise sensitivity, and relative Chernoff inequalities (extended version). - Nathan Keller; Ohad Klein (CoRR, 2017)

A structure theorem for almost low-degree functions on the slice. - Nathan Keller; Ohad Klein (CoRR, 2019)

An Optimal Distributed Discrete Log Protocol with Applications to Homomorphic Secret Sharing. - Itai Dinur; Nathan Keller; Ohad Klein (J. Cryptol., 2020)

Local concentration inequalities and Tomaszewski's conjecture. - Nathan Keller; Ohad Klein (STOC, 2021)

Fine-Grained Cryptanalysis: Tight Conditional Bounds for Dense k-SUM and k-XOR. - Itai Dinur; Nathan Keller; Ohad Klein (IACR Cryptol. ePrint Arch., 2021)

Locality-Preserving Hashing for Shifts with Connections to Cryptography. - Elette Boyle; Itai Dinur; Niv Gilboa; Yuval Ishai; Nathan Keller; Ohad Klein (IACR Cryptol. ePrint Arch., 2022)

Probability Mass of Rademacher Sums Beyond One Standard Deviation. - Vojtech Dvorak; Ohad Klein (SIAM J. Discret. Math., 2022)

Slicing all Edges of an n-cube Requires n2/3 Hyperplanes. - Ohad Klein (FOCS, 2023)

Verifying Groups in Linear Time. - Shai Evra; Shay Gadot; Ohad Klein; Ilan Komargodski (Electron. Colloquium Comput. Complex., 2023)

New Bounds on the Local Leakage Resilience of Shamir's Secret Sharing Scheme. - Ohad Klein; Ilan Komargodski (IACR Cryptol. ePrint Arch., 2023)

Quantum and Classical Low-Degree Learning via a Dimension-Free Remez Inequality. - Ohad Klein; Joseph Slote; Alexander Volberg; Haonan Zhang (ITCS, 2024)

On the (Im)possibility of Game-Theoretically Fair Leader Election Protocols. - Ohad Klein; Ilan Komargodski; Chenzhi Zhu (IACR Cryptol. ePrint Arch., 2024)

Fine-grained Cryptanalysis: Tight Conditional Bounds for Dense k-SUM and k-XOR. - Itai Dinur; Nathan Keller; Ohad Klein (J. ACM, 2024)