Hardness Preserving Reductions via Cuckoo Hashing. - Itay Berman; Iftach Haitner; Ilan Komargodski; Moni Naor (Electron. Colloquium Comput. Complex., 2012)

Coin Flipping of Any Constant Bias Implies One-Way Functions. - Itay Berman; Iftach Haitner; Aris Tentes (Electron. Colloquium Comput. Complex., 2015)

From Non-adaptive to Adaptive Pseudorandom Functions. - Itay Berman; Iftach Haitner (J. Cryptol., 2015)

Multi Collision Resistant Hash Functions and their Applications. - Itay Berman; Akshay Degwekar; Ron Rothblum; Prashant Nalini Vasudevan (Electron. Colloquium Comput. Complex., 2017)

From Laconic Zero-Knowledge to Public-Key Cryptography. - Itay Berman; Akshay Degwekar; Ron Rothblum; Prashant Nalini Vasudevan (Electron. Colloquium Comput. Complex., 2017)

Zero-Knowledge Proofs of Proximity. - Itay Berman; Ron D. Rothblum; Vinod Vaikuntanathan (IACR Cryptol. ePrint Arch., 2017)

From Laconic Zero-Knowledge to Public-Key Cryptography - Extended Abstract. - Itay Berman; Akshay Degwekar; Ron D. Rothblum; Prashant Nalini Vasudevan (CRYPTO (3), 2018)

Coin Flipping of Any Constant Bias Implies One-Way Functions. - Itay Berman; Iftach Haitner; Aris Tentes (J. ACM, 2018)

Statistical Difference Beyond the Polarizing Regime. - Itay Berman; Akshay Degwekar; Ron D. Rothblum; Prashant Nalini Vasudevan (Electron. Colloquium Comput. Complex., 2019)

A Tight Parallel-Repetition Theorem for Random-Terminating Interactive Arguments. - Itay Berman; Iftach Haitner; Eliad Tsfadia (Electron. Colloquium Comput. Complex., 2019)

Information theoretic advances in zero-knowledge. - Itay Berman (2019)

A Tight Parallel Repetition Theorem for Partially Simulatable Interactive Arguments via Smooth KL-Divergence. - Itay Berman; Iftach Haitner; Eliad Tsfadia (CRYPTO (3), 2020)

Coin Flipping of emph{Any} Constant Bias Implies One-Way Functions. - Itay Berman; Iftach Haitner; Aris Tentes (CoRR, 2021)