Author of the publication

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.

 

Other publications of authors with the same name

Witness Sets for Families of Binary Vectors., , , and . J. Comb. Theory, Ser. A, 73 (2): 376-380 (1996)A Communication-Privacy Tradeoff for Modular Addition., and . Inf. Process. Lett., 45 (4): 205-210 (1993)An Omega(D log (N/D)) Lower Bound for Broadcast in Radio Networks., and . SIAM J. Comput., 27 (3): 702-712 (1998)Information-Theoretically Secure Protocols and Security Under Composition., , and . IACR Cryptology ePrint Archive, (2009)Information-theoretically secure protocols and security under composition., , and . STOC, page 109-118. ACM, (2006)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)Privacy and Communication Complexity.. SIAM J. Discret. Math., 5 (2): 273-284 (1992)