Author of the publication

Improved pseudorandomness for unordered branching programs through local monotonicity.

, , , and . STOC, page 363-375. ACM, (2018)

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.

 

Other publications of authors with the same name

Non-Malleable Extractors and Codes, with their Many Tampered Extensions., , and . CoRR, (2015)Explicit two-source extractors and resilient functions., and . STOC, page 670-683. ACM, (2016)Non-malleable extractors and codes, with their many tampered extensions., , and . STOC, page 285-298. ACM, (2016)Non-malleable Codes, Extractors and Secret Sharing for Interleaved Tampering and Composition of Tampering., and . TCC (3), volume 12552 of Lecture Notes in Computer Science, page 584-613. Springer, (2020)Optimal Error Pseudodistributions for Read-Once Branching Programs., and . CCC, volume 169 of LIPIcs, page 25:1-25:27. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)New Extractors for Interleaved Sources., and . CCC, volume 50 of LIPIcs, page 7:1-7:28. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Non-malleability Against Polynomial Tampering., , , , and . CRYPTO (3), volume 12172 of Lecture Notes in Computer Science, page 97-126. Springer, (2020)Privacy Amplification from Non-malleable Codes., , , and . INDOCRYPT, volume 11898 of Lecture Notes in Computer Science, page 318-337. Springer, (2019)XOR lemmas for resilient functions against polynomials., , , , and . STOC, page 234-246. ACM, (2020)Explicit Non-malleable Extractors, Multi-source Extractors, and Almost Optimal Privacy Amplification Protocols., and . FOCS, page 158-167. IEEE Computer Society, (2016)