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.

 

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

Combining Private Set-Intersection with Secure Two-Party Computation., и . SCN, том 11035 из Lecture Notes in Computer Science, стр. 464-482. Springer, (2018)Round Optimal Secure Multiparty Computation from Minimal Assumptions., , , , и . TCC (2), том 12551 из Lecture Notes in Computer Science, стр. 291-319. Springer, (2020)Improved OR-Composition of Sigma-Protocols., , , , и . TCC (A2), том 9563 из Lecture Notes in Computer Science, стр. 112-141. Springer, (2016)Broadcast-Optimal Four-Round MPC in the Plain Model., , , , , и . TCC (2), том 14370 из Lecture Notes in Computer Science, стр. 3-32. Springer, (2023)Round-Optimal Black-Box Multiparty Computation from Polynomial-Time Assumptions., , , и . EUROCRYPT (5), том 15605 из Lecture Notes in Computer Science, стр. 331-359. Springer, (2025)Oblivious Transfer from Trapdoor Permutations in Minimal Rounds., , , , и . TCC (2), том 13043 из Lecture Notes in Computer Science, стр. 518-549. Springer, (2021)Collusion-Preserving Computation without a Mediator., , и . CSF, стр. 211-226. IEEE, (2022)Threshold Garbled Circuits and Ad Hoc Secure Computation., , и . EUROCRYPT (3), том 12698 из Lecture Notes in Computer Science, стр. 64-93. Springer, (2021)Round-Optimal and Communication-Efficient Multiparty Computation., , , и . EUROCRYPT (1), том 13275 из Lecture Notes in Computer Science, стр. 65-95. Springer, (2022)Secure Quantum Two-Party Computation: Impossibility and Constructions., , , и . IACR Cryptol. ePrint Arch., (2020)