( en | de | ru )

 

Disambiguation of "Chattopadhyay, Eshan"

Author of the publication

copydeleteadd this publication to your clipboard
A reduction from efficient non-malleable extractors to low-error two-source extractors with arbitrary constant rate.

, , , , and . Electron. Colloquium Comput. Complex., (2017)

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.

Anupam Chattopadhyay

Dhrupadi Chattopadhyay

Renate Chattopadhyay

Shamita Chattopadhyay

Sibylle Chattopadhyay

 

Other publications of authors with the same name

Non-Malleable Codes and Extractors for Small-Depth Circuits, and Affine Functions., and . Electron. Colloquium Comput. Complex., (2016)Pseudorandom generators from the second Fourier level and applications to AC0 with parity gates., , , and . Electron. Colloquium Comput. Complex., (2018)Hardness against Linear Branching Programs and More., and . Electron. Colloquium Comput. Complex., (2022)On the Existence of Seedless Condensers: Exploring the Terrain., , and . CoRR, (2023)XOR lemmas for resilient functions against polynomials., , , , and . STOC, page 234-246. ACM, (2020)Privacy Amplification from Non-malleable Codes., , , and . INDOCRYPT, volume 11898 of Lecture Notes in Computer Science, page 318-337. Springer, (2019)Explicit Non-malleable Extractors, Multi-source Extractors, and Almost Optimal Privacy Amplification Protocols., and . FOCS, page 158-167. IEEE Computer Society, (2016)Improved Pseudorandomness for Unordered Branching Programs through Local Monotonicity., , , and . Electron. Colloquium Comput. Complex., (2017)Extractors for Polynomial Sources over $F_2$., , and . Electron. Colloquium Comput. Complex., (2023)Explicit Two-Source Extractors and Resilient Functions., and . Electron. Colloquium Comput. Complex., (2015)