From post

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.

 

Другие публикации лиц с тем же именем

A Tight Parallel-Repetition Theorem for Random-Terminating Interactive Arguments., , и . Electron. Colloquium Comput. Complex., (2019)An Almost-Optimally Fair Three-Party Coin-Flipping Protocol., и . CoRR, (2021)On Cryptographic Hardness, Differential Privacy, and the Interconnection Between Them. Tel Aviv University, Israel, (2022)Tel Aviv University Library.Length preserving compression: marrying encryption with compression., , , , и . SYSTOR, стр. 15:1-15:12. ACM, (2021)Data Reconstruction: When You See It and When You Don't., , , , , , и . CoRR, (2024)Highly Efficient OT-Based Multiplication Protocols., , , и . EUROCRYPT (1), том 13275 из Lecture Notes in Computer Science, стр. 180-209. Springer, (2022)Private Learning of Halfspaces: Simplifying the Construction and Reducing the Sample Complexity., , , и . NeurIPS, (2020)FriendlyCore: Practical Differentially Private Aggregation., , , , и . ICML, том 162 из Proceedings of Machine Learning Research, стр. 21828-21863. PMLR, (2022)An almost-optimally fair three-party coin-flipping protocol., и . STOC, стр. 408-416. ACM, (2014)A Tight Parallel Repetition Theorem for Partially Simulatable Interactive Arguments via Smooth KL-Divergence., , и . CRYPTO (3), том 12172 из Lecture Notes in Computer Science, стр. 544-573. Springer, (2020)