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

On the Round Complexity of Zero-Knowledge Proofs Based on One-Way Permutations., , , and . LATINCRYPT, volume 6212 of Lecture Notes in Computer Science, page 189-204. Springer, (2010)(Nearly) Round-Optimal Black-Box Constructions of Commitments Secure against Selective Opening Attacks.. TCC, volume 6597 of Lecture Notes in Computer Science, page 541-558. Springer, (2011)Languages with Efficient Zero-Knowledge PCPs are in SZK., and . TCC, volume 7785 of Lecture Notes in Computer Science, page 297-314. Springer, (2013)New lower bounds for privacy in communication protocols., , and . Electron. Colloquium Comput. Complex., (2013)Sample Complexity Bounds on Differentially Private Learning via Communication Complexity., and . SIAM J. Comput., 44 (6): 1740-1764 (2015)Path-quality monitoring in the presence of adversaries., , , , and . SIGMETRICS, page 193-204. ACM, (2008)On the Power of Randomized Reductions and the Checkability of SAT., and . CCC, page 64-75. IEEE Computer Society, (2010)Improved Bounds for the Randomized Decision Tree Complexity of Recursive Majority., , , and . ICALP (1), volume 6755 of Lecture Notes in Computer Science, page 317-329. Springer, (2011)Derandomizing the Ahlswede-Winter matrix-valued Chernoff bound using pessimistic estimators, and applications., and . Theory of Computing, 4 (1): 53-76 (2008)Sample Complexity Bounds on Differentially Private Learning via Communication Complexity., and . COLT, volume 35 of JMLR Workshop and Conference Proceedings, page 1000-1019. JMLR.org, (2014)