(for Harvard related mails, please use
for reference letter or manuscript review requests respectively.
(emails to these addresses are forwarded to my main inbox, but are also tagged appropriately so I don't lose track of them.)
Administrator: Kevin Doyle, 617-496-6257, Maxwell Dworkin 111A ,
B. Barak, and A. Wigderson.
Public Key Cryptography
from Different Assumptions .
In Proc. of STOC, 2010.
Preliminary version as cryptology eprint report 2008/335 by Barak and
B. Barak, M. Braverman,
and A. Rao.
How to compress
interactive communication .
SIAM Journal on Computing 42.3: 1327-1363 ,2913. Preliminary version in STOC 2010.
B. Barak, A. Rao, R. Shaltiel, and A. Wigderson.
2-source dispersers for no
(1) entropy, and Ramsey graphs beating the Frankl-Wilson
Annals of Mathematics, 176(3):1483-1543, 2012.
Prelimninary version in STOC '06.
B. Barak and A. Sahai.
How to Play Almost Any
Mental Game Over the Net - Concurrent Composition Using
In Proc. 46th FOCS. IEEE, 2005.
Hierarchy Theorem for ``Slightly Non-Uniform''
In Proc. of 6th Workshop on Randomization and Approximation
Techniques in Computer Science (RANDOM), 2002.
Coin-Tossing With a Man in the Middle or Realizing the Shared Random
In Proc. 43rd FOCS. IEEE, 2002.
How to go beyond the
black-box simulation barrier .
In Proc. 42nd FOCS, pages 106-115. IEEE, 2001.