( en | de | ru )

 

Disambiguation of "Kushilevitz, Eyal"

Author of the publication

copydeleteadd this publication to your clipboard
Secret Sharing Over Infinite Domains (Extended Abstract).

, and . CRYPTO, volume 435 of Lecture Notes in Computer Science, page 299-306. Springer, (1989)

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.

Eyal Haik

Eyal Arnon

 

Other publications of authors with the same name

How Many Oblivious Transfers Are Needed for Secure Multiparty Computation?, , and . CRYPTO, volume 4622 of Lecture Notes in Computer Science, page 284-302. Springer, (2007)Learning Automata., , , , and . Encyclopedia of Algorithms, Springer, (2008)On the Limitations of Universally Composable Two-Party Computation without Set-up Assumptions., , and . EUROCRYPT, volume 2656 of Lecture Notes in Computer Science, page 68-86. Springer, (2003)OT-Combiners via Secure Computation., , , and . TCC, volume 4948 of Lecture Notes in Computer Science, page 393-411. Springer, (2008)Choosing, Agreeing, and Eliminating in Communication Complexity., , , and . ICALP (1), volume 6198 of Lecture Notes in Computer Science, page 451-462. Springer, (2010)On Pseudorandom Generators with Linear Stretch in NC0., , and . Comput. Complex., 17 (1): 38-69 (2008)Communication Complexity: From Two-Party to Multiparty.. SIROCCO, volume 6058 of Lecture Notes in Computer Science, page 1. Springer, (2010)Guest Editorial: In-Network Computation: Exploring the Fundamental Limits., , , , , and . IEEE J. Sel. Areas Commun., 31 (4): 617-619 (2013)A Perfect Zero-Knowledge Proof System for a Problem Equivalent to the Discrete Logarithm., and . J. Cryptol., 6 (2): 97-116 (1993)Computationally Private Randomizing Polynomials and Their Applications., , and . CCC, page 260-274. IEEE Computer Society, (2005)