( en | de | ru )

 

Disambiguation of "Hazay, Carmit"

Author of the publication

copydeleteadd this publication to your clipboard
Best of Both Worlds - Revisiting the Spymasters Double Agent Problem.

, , , and . CRYPTO (1), volume 14081 of Lecture Notes in Computer Science, page 328-359. Springer, (2023)

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.

Miklós Hazay

 

Other publications of authors with the same name

Secure Two-Party Computation with Low Communication., , and . IACR Cryptology ePrint Archive, (2011)Fast Actively Secure Five-Party Computation with Security Beyond Abort., , , and . ACM Conference on Computer and Communications Security, page 1573-1590. ACM, (2019)Gradual GRAM and Secure Computation for RAM Programs., and . SCN, volume 12238 of Lecture Notes in Computer Science, page 233-252. Springer, (2020)On the Power of Secure Two-Party Computation., and . J. Cryptol., 33 (1): 271-318 (2020)Efficient Set Operations in the Presence of Malicious Adversaries., and . J. Cryptol., 25 (3): 383-433 (2012)ZK-PCPs from Leakage-Resilient Secret Sharing., , and . ITC, volume 199 of LIPIcs, page 6:1-6:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Beyond MPC-in-the-Head: Black-Box Constructions of Short Zero-Knowledge Proofs., , and . TCC (1), volume 14369 of Lecture Notes in Computer Science, page 3-33. Springer, (2023)Financially Backed Covert Security., , , and . Public Key Cryptography (2), volume 13178 of Lecture Notes in Computer Science, page 99-129. Springer, (2022)Best of Both Worlds - Revisiting the Spymasters Double Agent Problem., , , and . CRYPTO (1), volume 14081 of Lecture Notes in Computer Science, page 328-359. Springer, (2023)Is the Classical GMW Paradigm Practical? The Case of Non-Interactive Actively Secure 2PC., , , , and . CCS, page 1591-1605. ACM, (2020)