Author of the publication

Bounded Indistinguishability and the Complexity of Recovering Secrets.

, , , and . CRYPTO (3), volume 9816 of Lecture Notes in Computer Science, page 593-618. Springer, (2016)

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

The communication complexity of interleaved group products., and . STOC, page 351-360. ACM, (2015)The Sum of D Small-Bias Generators Fools Polynomials of Degree D.. Comput. Complex., 18 (2): 209-217 (2009)Local Reductions., , and . ICALP (1), volume 9134 of Lecture Notes in Computer Science, page 749-760. Springer, (2015)On beating the hybrid argument., , , and . ITCS, page 468-483. ACM, (2012)The Sum of d Small-Bias Generators Fools Polynomials of Degree d.. CCC, page 124-127. IEEE Computer Society, (2008)Randomness Buys Depth for Approximate Counting.. FOCS, page 230-239. IEEE Computer Society, (2011)On the Complexity of Information Spreading in Dynamic Networks., , , , and . SODA, page 717-736. SIAM, (2013)On Probabilistic Time versus Alternating Time. Electron. Colloquium Comput. Complex., (2005)In Brute-Force Search of Correlation Bounds for Polynomials., , and . Electron. Colloquium Comput. Complex., (2011)Some limitations of the sum of small-bias distributions., and . Electron. Colloquium Comput. Complex., (2015)