default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDItay Berman
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2019
[b1]Itay Berman:
Information theoretic advances in zero-knowledge. Massachusetts Institute of Technology, Cambridge, USA, 2019
Journal Articles
- 2019
- [j3]Itay Berman, Iftach Haitner, Ilan Komargodski, Moni Naor:
Hardness-Preserving Reductions via Cuckoo Hashing. J. Cryptol. 32(2): 361-392 (2019) - 2018
- [j2]Itay Berman, Iftach Haitner, Aris Tentes:
Coin Flipping of Any Constant Bias Implies One-Way Functions. J. ACM 65(3): 14:1-14:95 (2018) - 2015
- [j1]Itay Berman, Iftach Haitner:
From Non-adaptive to Adaptive Pseudorandom Functions. J. Cryptol. 28(2): 297-311 (2015)
Conference and Workshop Papers
- 2020
- [c8]Itay Berman, Iftach Haitner, Eliad Tsfadia:
A Tight Parallel Repetition Theorem for Partially Simulatable Interactive Arguments via Smooth KL-Divergence. CRYPTO (3) 2020: 544-573 - 2019
- [c7]Itay Berman, Akshay Degwekar, Ron D. Rothblum, Prashant Nalini Vasudevan:
Statistical Difference Beyond the Polarizing Regime. TCC (2) 2019: 311-332 - 2018
- [c6]Itay Berman, Akshay Degwekar, Ron D. Rothblum, Prashant Nalini Vasudevan:
From Laconic Zero-Knowledge to Public-Key Cryptography - Extended Abstract. CRYPTO (3) 2018: 674-697 - [c5]Itay Berman, Akshay Degwekar, Ron D. Rothblum, Prashant Nalini Vasudevan:
Multi-Collision Resistant Hash Functions and Their Applications. EUROCRYPT (2) 2018: 133-161 - [c4]Itay Berman, Ron D. Rothblum, Vinod Vaikuntanathan:
Zero-Knowledge Proofs of Proximity. ITCS 2018: 19:1-19:20 - 2014
- [c3]Itay Berman, Iftach Haitner, Aris Tentes:
Coin flipping of any constant bias implies one-way functions. STOC 2014: 398-407 - 2013
- [c2]Itay Berman, Iftach Haitner, Ilan Komargodski, Moni Naor:
Hardness Preserving Reductions via Cuckoo Hashing. TCC 2013: 40-59 - 2012
- [c1]Itay Berman, Iftach Haitner:
From Non-adaptive to Adaptive Pseudorandom Functions. TCC 2012: 357-368
Informal and Other Publications
- 2021
- [i15]Itay Berman, Iftach Haitner, Eliad Tsfadia:
A Tight Parallel Repetition Theorem for Partially Simulatable Interactive Arguments via Smooth KL-Divergence. CoRR abs/2105.00801 (2021) - [i14]Itay Berman, Iftach Haitner, Aris Tentes:
Coin Flipping of \emph{Any} Constant Bias Implies One-Way Functions. CoRR abs/2105.01400 (2021) - [i13]Itay Berman, Iftach Haitner, Ilan Komargodski, Moni Naor:
Hardness-Preserving Reductions via Cuckoo Hashing. CoRR abs/2105.01409 (2021) - 2019
- [i12]Itay Berman, Akshay Degwekar, Ron D. Rothblum, Prashant Nalini Vasudevan:
Statistical Difference Beyond the Polarizing Regime. Electron. Colloquium Comput. Complex. TR19 (2019) - [i11]Itay Berman, Iftach Haitner, Eliad Tsfadia:
A Tight Parallel-Repetition Theorem for Random-Terminating Interactive Arguments. Electron. Colloquium Comput. Complex. TR19 (2019) - [i10]Itay Berman, Iftach Haitner, Eliad Tsfadia:
A Tight Parallel-Repetition Theorem for Random-Terminating Interactive Arguments. IACR Cryptol. ePrint Arch. 2019: 393 (2019) - 2018
- [i9]Itay Berman, Akshay Degwekar, Ron D. Rothblum, Prashant Nalini Vasudevan:
From Laconic Zero-Knowledge to Public-Key Cryptography. IACR Cryptol. ePrint Arch. 2018: 548 (2018) - 2017
- [i8]Itay Berman, Akshay Degwekar, Ron Rothblum, Prashant Nalini Vasudevan:
Multi Collision Resistant Hash Functions and their Applications. Electron. Colloquium Comput. Complex. TR17 (2017) - [i7]Itay Berman, Akshay Degwekar, Ron Rothblum, Prashant Nalini Vasudevan:
From Laconic Zero-Knowledge to Public-Key Cryptography. Electron. Colloquium Comput. Complex. TR17 (2017) - [i6]Itay Berman, Ron D. Rothblum, Vinod Vaikuntanathan:
Zero-Knowledge Proofs of Proximity. IACR Cryptol. ePrint Arch. 2017: 114 (2017) - [i5]Itay Berman, Akshay Degwekar, Ron D. Rothblum, Prashant Nalini Vasudevan:
Multi Collision Resistant Hash Functions and their Applications. IACR Cryptol. ePrint Arch. 2017: 489 (2017) - 2015
- [i4]Itay Berman, Iftach Haitner, Aris Tentes:
Coin Flipping of Any Constant Bias Implies One-Way Functions. Electron. Colloquium Comput. Complex. TR15 (2015) - 2012
- [i3]Itay Berman, Iftach Haitner, Ilan Komargodski, Moni Naor:
Hardness Preserving Reductions via Cuckoo Hashing. Electron. Colloquium Comput. Complex. TR12 (2012) - [i2]Itay Berman, Iftach Haitner, Ilan Komargodski, Moni Naor:
Hardness Preserving Reductions via Cuckoo Hashing. IACR Cryptol. ePrint Arch. 2012: 722 (2012) - 2011
- [i1]Iftach Haitner, Itay Berman:
From Non-Adaptive to Adaptive Pseudorandom Functions. IACR Cryptol. ePrint Arch. 2011: 504 (2011)
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-20 23:59 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:
