1. How to go beyond the black-box simulation barrier;Barak,2001
2. B. Barak, Constant-round coin-tossing with a man in the middle or realizing the shared random string model, in: 43th IEEE Symposium on Foundations of Computer Science, FOCS’02, 2002, pp. 345–355
3. Collision-free accumulators and fail-stop signature schemes without trees;Barić,1997
4. B. Barak, S.J. Ong, S. Vadhan, Derandomization in criptography, in: Crypto’03, 2003
5. Round-optimal zero-knowledge arguments based on any one-way function;Bellare,1997