( en | de | ru )

 

Disambiguation of "Mazor, Noam"

Author of the publication

copydeleteadd this publication to your clipboard
Incompressiblity and Next-Block Pseudoentropy.

, , and . IACR Cryptol. ePrint Arch., (2022)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Noam Pilpel

 

Other publications of authors with the same name

On the Communication Complexity of Key-Agreement Protocols., , , , and . Electron. Colloquium Comput. Complex., (2018)Simple Constructions from (Almost) Regular One-Way Functions., and . TCC (2), volume 13043 of Lecture Notes in Computer Science, page 457-485. Springer, (2021)Search-to-Decision Reductions for Kolmogorov Complexity., and . Electron. Colloquium Comput. Complex., (2024)Channels of Small Log-Ratio Leakage and Characterization of Two-Party Differentially Private Computation., , , and . Electron. Colloquium Comput. Complex., (2019)The Non-Uniform Perebor Conjecture for Time-Bounded Kolmogorov Complexity is False., and . IACR Cryptol. ePrint Arch., (2023)Non-adaptive Universal One-Way Hash Functions from Arbitrary One-Way Functions., , and . EUROCRYPT (4), volume 14007 of Lecture Notes in Computer Science, page 502-531. Springer, (2023)On the complexity of two-party differential privacy., , , and . STOC, page 1392-1405. ACM, (2022)On the Communication Complexity of Key-Agreement Protocols., , , , and . ITCS, volume 124 of LIPIcs, page 40:1-40:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Non-Adaptive Universal One-Way Hash Functions from Arbitrary One-Way Functions., , and . IACR Cryptol. ePrint Arch., (2022)Incompressiblity and Next-Block Pseudoentropy., , and . ITCS, volume 251 of LIPIcs, page 66:1-66:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)