1 

Petrank Erez 
1995 
PhD 

Knowledge Complexity versus Computational Complexity and the Hardness of Approximations 
2 

Kahan Ariel 
1993 
MSc 

Zero Knowledge Proofs with Constant Number of Iterations 
3 

Canetti Ran 
1992 
MSc 

A Tradeoff Between Randomness and Commonication Complexity 
4 

Petrank Erez 
1992 
MSc 

The Knowledge Complexity of Interactive Proofs 
5 

Sneh Dror 
1992 
MSc 

The Complexity of Global Computation in the Presence of 
6 

Even Guy 
1991 
MSc 

Construction of Small Probability Spaces 
7 

Herzberg Amir 
1991 
PhD 

Communication Networks in the Presence of Faults 
8 

Krawczxk Hugo 
1990 
PhD 

Pseudorandomness and Compuiati Onal Difficulty 
9 

Koren Tziporet 
1989 
MSc 

On the Construction of Pseudo Random Block Ciphers 
10 

Kushilevitz Eyal 
1989 
MSc 

Perfect ZeroKnowledge Proofs 