Itay Berman

According to our database1, Itay Berman authored at least 13 papers between 2012 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2021
Coin Flipping of \emph{Any} Constant Bias Implies One-Way Functions.
CoRR, 2021

2020
A Tight Parallel Repetition Theorem for Partially Simulatable Interactive Arguments via Smooth KL-Divergence.
Proceedings of the Advances in Cryptology - CRYPTO 2020, 2020

2019
Information theoretic advances in zero-knowledge.
PhD thesis, 2019

A Tight Parallel-Repetition Theorem for Random-Terminating Interactive Arguments.
Electron. Colloquium Comput. Complex., 2019

Statistical Difference Beyond the Polarizing Regime.
Proceedings of the Theory of Cryptography - 17th International Conference, 2019

2018
Zero-Knowledge Proofs of Proximity.
Proceedings of the 9th Innovations in Theoretical Computer Science Conference, 2018

Multi-Collision Resistant Hash Functions and Their Applications.
Proceedings of the Advances in Cryptology - EUROCRYPT 2018 - 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tel Aviv, Israel, April 29, 2018

From Laconic Zero-Knowledge to Public-Key Cryptography - Extended Abstract.
Proceedings of the Advances in Cryptology - CRYPTO 2018, 2018

2017
From Laconic Zero-Knowledge to Public-Key Cryptography.
Electron. Colloquium Comput. Complex., 2017

2015
Coin Flipping of Any Constant Bias Implies One-Way Functions.
Electron. Colloquium Comput. Complex., 2015

2014
Coin flipping of <i>any</i> constant bias implies one-way functions.
Proceedings of the Symposium on Theory of Computing, 2014

2013
Hardness Preserving Reductions via Cuckoo Hashing.
Proceedings of the Theory of Cryptography - 10th Theory of Cryptography Conference, 2013

2012
From Non-adaptive to Adaptive Pseudorandom Functions.
Proceedings of the Theory of Cryptography - 9th Theory of Cryptography Conference, 2012


  Loading...