Author of the publication

Topology-Hiding Communication from Minimal Assumptions.

, , , , , , and . TCC (2), volume 12551 of Lecture Notes in Computer Science, page 473-501. Springer, (2020)

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

Communication Complexity with Defective Randomness., , and . Electron. Colloquium Comput. Complex., (2020)Gage MPC: Bypassing Residual Function Leakage for Non-Interactive MPC., , , , , , , , and . IACR Cryptol. ePrint Arch., (2021)Randomness Extraction from Somewhat Dependent Sources., , and . ITCS, volume 215 of LIPIcs, page 12:1-12:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Communication Complexity with Defective Randomness., , and . CCC, volume 200 of LIPIcs, page 14:1-14:10. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Lower Bounds for Oblivious Near-Neighbor Search., , , and . SODA, page 1116-1134. SIAM, (2020)Two Party Distribution Testing: Communication and Security., , and . ICALP, volume 132 of LIPIcs, page 15:1-15:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Lower Bounds for Oblivious Near-Neighbor Search., , , and . CoRR, (2019)Topology-Hiding Communication from Minimal Assumptions., , , , , , and . J. Cryptol., 36 (4): 39 (October 2023)Randomness Extraction from Somewhat Dependent Sources., , and . Electron. Colloquium Comput. Complex., (2019)Is Information-Theoretic Topology-Hiding Computation Possible?, , , , and . TCC (1), volume 11891 of Lecture Notes in Computer Science, page 502-530. Springer, (2019)