( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Randomness versus Fault-Tolerance.

, , , и . J. Cryptol., 13 (1): 107-142 (2000)

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.

Eyal Haik

Eyal Arnon

 

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

An Omega(D log (N/D)) Lower Bound for Broadcast in Radio Networks., и . SIAM J. Comput., 27 (3): 702-712 (1998)A Communication-Privacy Tradeoff for Modular Addition., и . Inf. Process. Lett., 45 (4): 205-210 (1993)Information-theoretically secure protocols and security under composition., , и . STOC, стр. 109-118. ACM, (2006)Information-Theoretically Secure Protocols and Security Under Composition., , и . IACR Cryptology ePrint Archive, (2009)Choosing, Agreeing, and Eliminating in Communication Complexity., , , и . ICALP (1), том 6198 из Lecture Notes in Computer Science, стр. 451-462. Springer, (2010)On the Limitations of Universally Composable Two-Party Computation without Set-up Assumptions., , и . EUROCRYPT, том 2656 из Lecture Notes in Computer Science, стр. 68-86. Springer, (2003)How Many Oblivious Transfers Are Needed for Secure Multiparty Computation?, , и . CRYPTO, том 4622 из Lecture Notes in Computer Science, стр. 284-302. Springer, (2007)OT-Combiners via Secure Computation., , , и . TCC, том 4948 из Lecture Notes in Computer Science, стр. 393-411. Springer, (2008)On the Limitations of Universally Composable Two-Party Computation Without Set-Up Assumptions., , и . J. Cryptol., 19 (2): 135-167 (2006)A Perfect Zero-Knowledge Proof System for a Problem Equivalent to the Discrete Logarithm., и . J. Cryptol., 6 (2): 97-116 (1993)