( en | de | ru )

 

Disambiguation of "Kushilevitz, Eyal"

Author of the publication

copydeleteadd this publication to your clipboard
A Lower Bound for Distribution-Free Monotonicity Testing.

, and . APPROX-RANDOM, volume 3624 of Lecture Notes in Computer Science, page 330-341. Springer, (2005)

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

A Perfect Zero-Knowledge Proof System for a Problem Equivalent to the Discrete Logarithm., and . J. Cryptol., 6 (2): 97-116 (1993)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)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)Information-theoretically secure protocols and security under composition., , and . STOC, page 109-118. ACM, (2006)Choosing, Agreeing, and Eliminating in Communication Complexity., , , and . ICALP (1), volume 6198 of Lecture Notes in Computer Science, page 451-462. Springer, (2010)OT-Combiners via Secure Computation., , , and . TCC, volume 4948 of Lecture Notes in Computer Science, page 393-411. Springer, (2008)Distribution Design., , , and . ITCS, page 81-92. ACM, (2016)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)