default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNoam Mazor
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j1]Noam Mazor, Jiapeng Zhang:
Simple Constructions from (Almost) Regular One-Way Functions. J. Cryptol. 37(3): 25 (2024)- [c15]Noam Mazor, Rafael Pass:
On Black-Box Meta Complexity and Function Inversion. APPROX/RANDOM 2024: 66:1-66:12 - [c14]Noam Mazor, Rafael Pass:
Search-To-Decision Reductions for Kolmogorov Complexity. CCC 2024: 34:1-34:20 - [c13]Noam Mazor, Rafael Pass:
Gap MCSP Is Not (Levin) NP-Complete in Obfustopia. CCC 2024: 36:1-36:21 - [c12]Amos Beimel, Tal Malkin, Noam Mazor:
Structural Lower Bounds on Black-Box Constructions of Pseudorandom Functions. CRYPTO (5) 2024: 459-488 - [c11]Noam Mazor, Rafael Pass:
The Non-Uniform Perebor Conjecture for Time-Bounded Kolmogorov Complexity Is False. ITCS 2024: 80:1-80:20 - [i35]Marshall Ball, Yanyi Liu, Noam Mazor, Rafael Pass:
Kolmogorov Comes to Cryptomania: On Interactive Kolmogorov Complexity and Key-Agreement. Electron. Colloquium Comput. Complex. TR24 (2024) - [i34]Yanyi Liu, Noam Mazor, Rafael Pass:
A Note on Zero-Knowledge for NP and One-Way Functions. Electron. Colloquium Comput. Complex. TR24 (2024) - [i33]Zhenjian Lu, Noam Mazor, Igor C. Oliveira, Rafael Pass:
Lower Bounds on the Overhead of Indistinguishability Obfuscation. Electron. Colloquium Comput. Complex. TR24 (2024) - [i32]Noam Mazor, Rafael Pass:
Search-to-Decision Reductions for Kolmogorov Complexity. Electron. Colloquium Comput. Complex. TR24 (2024) - [i31]Noam Mazor, Rafael Pass:
Gap MCSP is not (Levin) NP-complete in Obfustopia. Electron. Colloquium Comput. Complex. TR24 (2024) - [i30]Noam Mazor, Rafael Pass:
Gap MCSP is not (Levin) NP-complete in Obfustopia. IACR Cryptol. ePrint Arch. 2024: 420 (2024) - [i29]Marshall Ball, Yanyi Liu, Noam Mazor, Rafael Pass:
Kolmogorov Comes to Cryptomania: On Interactive Kolmogorov Complexity and Key-Agreement. IACR Cryptol. ePrint Arch. 2024: 425 (2024) - [i28]Yanyi Liu, Noam Mazor, Rafael Pass:
A Note on Zero-Knowledge for NP and One-Way Functions. IACR Cryptol. ePrint Arch. 2024: 800 (2024) - [i27]Amos Beimel, Tal Malkin, Noam Mazor:
Structural Lower Bounds on Black-Box Constructions of Pseudorandom Functions. IACR Cryptol. ePrint Arch. 2024: 1104 (2024) - [i26]Zhenjian Lu, Noam Mazor, Igor C. Oliveira, Rafael Pass:
Lower Bounds on the Overhead of Indistinguishability Obfuscation. IACR Cryptol. ePrint Arch. 2024: 1524 (2024) - 2023
- [c10]Noam Mazor:
A Lower Bound on the Share Size in Evolving Secret Sharing. ITC 2023: 2:1-2:9 - [c9]Xinyu Mao
, Noam Mazor, Jiapeng Zhang:
Non-adaptive Universal One-Way Hash Functions from Arbitrary One-Way Functions. EUROCRYPT (4) 2023: 502-531 - [c8]Marshall Ball, Yanyi Liu, Noam Mazor, Rafael Pass:
Kolmogorov Comes to Cryptomania: On Interactive Kolmogorov Complexity and Key-Agreement. FOCS 2023: 458-483 - [c7]Iftach Haitner, Noam Mazor, Jad Silbak:
Incompressiblity and Next-Block Pseudoentropy. ITCS 2023: 66:1-66:18 - [c6]Noam Mazor, Rafael Pass:
Counting Unpredictable Bits: A Simple PRG from One-Way Functions. TCC (1) 2023: 191-218 - [i25]Noam Mazor:
A Lower Bound on the Share Size in Evolving Secret Sharing. Electron. Colloquium Comput. Complex. TR23 (2023) - [i24]Noam Mazor:
Key-Agreement with Perfect Completeness from Random Oracles. Electron. Colloquium Comput. Complex. TR23 (2023) - [i23]Noam Mazor, Rafael Pass:
Counting Unpredictable Bits: A Simple PRG from One-way Functions. Electron. Colloquium Comput. Complex. TR23 (2023) - [i22]Noam Mazor, Rafael Pass:
The Non-Uniform Perebor Conjecture for Time-Bounded Kolmogorov Complexity is False. Electron. Colloquium Comput. Complex. TR23 (2023) - [i21]Noam Mazor, Rafael Pass:
A Note On the Universality of Black-box MKtP Solvers. Electron. Colloquium Comput. Complex. TR23 (2023) - [i20]Noam Mazor:
A Lower Bound on the Share Size in Evolving Secret Sharing. IACR Cryptol. ePrint Arch. 2023: 129 (2023) - [i19]Noam Mazor:
Key-Agreement with Perfect Completeness from Random Oracles. IACR Cryptol. ePrint Arch. 2023: 1265 (2023) - [i18]Noam Mazor, Rafael Pass:
Counting Unpredictable Bits: A Simple PRG from One-way Functions. IACR Cryptol. ePrint Arch. 2023: 1451 (2023) - [i17]Noam Mazor, Rafael Pass:
The Non-Uniform Perebor Conjecture for Time-Bounded Kolmogorov Complexity is False. IACR Cryptol. ePrint Arch. 2023: 1765 (2023) - [i16]Noam Mazor, Rafael Pass:
A Note On the Universality of Black-box MKtP Solvers. IACR Cryptol. ePrint Arch. 2023: 1832 (2023) - 2022
- [c5]Iftach Haitner, Noam Mazor, Jad Silbak, Eliad Tsfadia:
On the complexity of two-party differential privacy. STOC 2022: 1392-1405 - [i15]Iftach Haitner, Noam Mazor, Jad Silbak:
Incompressiblity and Next-Block Pseudoentropy. Electron. Colloquium Comput. Complex. TR22 (2022) - [i14]Xinyu Mao, Noam Mazor, Jiapeng Zhang:
Non-Adaptive Universal One-Way Hash Functions from Arbitrary One-Way Functions. Electron. Colloquium Comput. Complex. TR22 (2022) - [i13]Iftach Haitner, Noam Mazor, Jad Silbak:
Incompressiblity and Next-Block Pseudoentropy. IACR Cryptol. ePrint Arch. 2022: 278 (2022) - [i12]Xinyu Mao, Noam Mazor, Jiapeng Zhang:
Non-Adaptive Universal One-Way Hash Functions from Arbitrary One-Way Functions. IACR Cryptol. ePrint Arch. 2022: 431 (2022) - 2021
- [c4]Noam Mazor, Jiapeng Zhang:
Simple Constructions from (Almost) Regular One-Way Functions. TCC (2) 2021: 457-485 - [i11]Dror Chawin, Iftach Haitner, Noam Mazor:
Lower Bounds on the Time/Memory Tradeoff of Function Inversion. CoRR abs/2105.00761 (2021) - [i10]Iftach Haitner, Noam Mazor, Ronen Shaltiel, Jad Silbak:
Channels of Small Log-Ratio Leakage and Characterization of Two-Party Differentially Private Computation. CoRR abs/2105.00770 (2021) - [i9]Iftach Haitner, Noam Mazor, Rotem Oshman, Omer Reingold, Amir Yehudayoff:
On the Communication Complexity of Key-Agreement Protocols. CoRR abs/2105.01958 (2021) - [i8]Iftach Haitner, Noam Mazor, Jad Silbak, Eliad Tsfadia:
On the Complexity of Two-Party Differential Privacy. CoRR abs/2108.07664 (2021) - [i7]Iftach Haitner, Noam Mazor, Jad Silbak, Eliad Tsfadia:
On the Complexity of Two-Party Differential Privacy. Electron. Colloquium Comput. Complex. TR21 (2021) - [i6]Noam Mazor, Jiapeng Zhang:
Simple Constructions from (Almost) Regular One-Way Functions. IACR Cryptol. ePrint Arch. 2021: 1192 (2021) - 2020
- [c3]Dror Chawin, Iftach Haitner, Noam Mazor:
Lower Bounds on the Time/Memory Tradeoff of Function Inversion. TCC (3) 2020: 305-334 - [i5]Dror Chawin, Iftach Haitner, Noam Mazor:
Lower Bounds on the Time/Memory Tradeoff of Function Inversion. Electron. Colloquium Comput. Complex. TR20 (2020) - [i4]Dror Chawin, Iftach Haitner, Noam Mazor:
Lower Bounds on the Time/Memory Tradeoff of Function Inversion. IACR Cryptol. ePrint Arch. 2020: 687 (2020)
2010 – 2019
- 2019
- [c2]Iftach Haitner, Noam Mazor, Rotem Oshman, Omer Reingold, Amir Yehudayoff:
On the Communication Complexity of Key-Agreement Protocols. ITCS 2019: 40:1-40:16 - [c1]Iftach Haitner, Noam Mazor, Ronen Shaltiel, Jad Silbak:
Channels of Small Log-Ratio Leakage and Characterization of Two-Party Differentially Private Computation. TCC (1) 2019: 531-560 - [i3]Iftach Haitner, Noam Mazor, Ronen Shaltiel, Jad Silbak:
Channels of Small Log-Ratio Leakage and Characterization of Two-Party Differentially Private Computation. Electron. Colloquium Comput. Complex. TR19 (2019) - [i2]Iftach Haitner, Noam Mazor, Ronen Shaltiel, Jad Silbak:
Channels of Small Log-Ratio Leakage and Characterization of Two-Party Differentially Private Computation. IACR Cryptol. ePrint Arch. 2019: 616 (2019) - 2018
- [i1]Iftach Haitner, Noam Mazor, Rotem Oshman, Omer Reingold, Amir Yehudayoff:
On the Communication Complexity of Key-Agreement Protocols. Electron. Colloquium Comput. Complex. TR18 (2018)
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 2024-10-15 21:40 CEST 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:
