PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Barak, Boaz"

Author of the publication

copydeleteadd this publication to your clipboard
Rounding Parallel Repetitions of Unique Games.

, , , , , and . FOCS, page 374-383. IEEE Computer Society, (2008)

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.

Wael Barakat University of Stuttgart

 

Other publications of authors with the same name

Lower bounds for non-black-box zero knowledge., , and . J. Comput. Syst. Sci., 72 (2): 321-391 (2006)Small-Set Expansion in Shortcode Graph and the 2-to-2 Conjecture., , and . ITCS, volume 124 of LIPIcs, page 9:1-9:12. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2019)On the (Im)possibility of Obfuscating Programs., , , , , , and . CRYPTO, volume 2139 of Lecture Notes in Computer Science, page 1-18. Springer, (2001)Strong Parallel Repetition Theorem for Free Projection Games., , , , and . APPROX-RANDOM, volume 5687 of Lecture Notes in Computer Science, page 352-365. Springer, (2009)The Proactive Security Toolkit and Applications., , , and . ACM Conference on Computer and Communications Security, page 18-27. ACM, (1999)A breakthrough in software obfuscation: technical perspective.. Commun. ACM, 59 (5): 112 (2016)Lower Bounds for Non-Black-Box Zero Knowledge., , and . IACR Cryptology ePrint Archive, (2004)How to Go Beyond the Black-Box Simulation Barrier.. FOCS, page 106-115. IEEE Computer Society, (2001)Constant-Round Coin-Tossing with a Man in the Middle or Realizing the Shared Random String Model.. FOCS, page 345-355. IEEE Computer Society, (2002)Lower Bounds on Signatures From Symmetric Primitives., and . FOCS, page 680-688. IEEE Computer Society, (2007)