( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
How Many Oblivious Transfers Are Needed for Secure Multiparty Computation?

, , и . CRYPTO, том 4622 из Lecture Notes in Computer Science, стр. 284-302. Springer, (2007)

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.

Yuval Hen

Ishai Dror

Yuval Marton

Yuval Sanders

Yuval Shavitt

 

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

Special Section on the Forty-Fifth Annual ACM Symposium on the Theory of Computing (STOC 2013)., , и . SIAM J. Comput., 45 (2): 459-460 (2016)On the Power of Nonlinear Secret-Sharing., и . IACR Cryptology ePrint Archive, (2001)Perfect MPC over Layered Graphs., , , , , , , и . CRYPTO (1), том 14081 из Lecture Notes in Computer Science, стр. 360-392. Springer, (2023)Computationally Private Randomizing Polynomials and Their Applications., , и . CCC, стр. 260-274. IEEE Computer Society, (2005)Trapdoor Hash Functions and Their Applications., , , , , и . CRYPTO (3), том 11694 из Lecture Notes in Computer Science, стр. 3-32. Springer, (2019)Is the Classical GMW Paradigm Practical? The Case of Non-Interactive Actively Secure 2PC., , , , и . CCS, стр. 1591-1605. ACM, (2020)Information-Theoretic Private Information Retrieval: A Unified Construction., и . ICALP, том 2076 из Lecture Notes in Computer Science, стр. 912-926. Springer, (2001)Correlation Extractors and Their Applications - (Invited Talk).. ICITS, том 6673 из Lecture Notes in Computer Science, стр. 1-5. Springer, (2011)Bounded Indistinguishability and the Complexity of Recovering Secrets., , , и . CRYPTO (3), том 9816 из Lecture Notes in Computer Science, стр. 593-618. Springer, (2016)How Many Oblivious Transfers Are Needed for Secure Multiparty Computation?, , и . CRYPTO, том 4622 из Lecture Notes in Computer Science, стр. 284-302. Springer, (2007)