| Private circuits: Securing hardware against probing attacks Y Ishai, A Sahai, D Wagner Annual International Cryptology Conference, 463-481, 2003 | 771 | 2003 |
| Extending oblivious transfers efficiently Y Ishai, J Kilian, K Nissim, E Petrank Annual International Cryptology Conference, 145-161, 2003 | 621 | 2003 |
| Protecting data privacy in private information retrieval schemes Y Gertner, Y Ishai, E Kushilevitz, T Malkin Journal of Computer and System Sciences 60 (3), 592-629, 2000 | 545 | 2000 |
| Priced oblivious transfer: How to sell digital goods B Aiello, Y Ishai, O Reingold International Conference on the Theory and Applications of Cryptographic …, 2001 | 466 | 2001 |
| Founding cryptography on oblivious transfer–efficiently Y Ishai, M Prabhakaran, A Sahai Annual international cryptology conference, 572-591, 2008 | 422 | 2008 |
| Keyword search and oblivious pseudorandom functions MJ Freedman, Y Ishai, B Pinkas, O Reingold Theory of Cryptography Conference, 303-324, 2005 | 366 | 2005 |
| Zero-knowledge proofs from secure multiparty computation Y Ishai, E Kushilevitz, R Ostrovsky, A Sahai SIAM Journal on Computing 39 (3), 1121-1152, 2009 | 293* | 2009 |
| Cryptography in B Applebaum, Y Ishai, E Kushilevitz SIAM Journal on Computing 36 (4), 845-888, 2006 | 290 | 2006 |
| Breaking the O (n/sup 1/(2k-1)/) barrier for information-theoretic private information retrieval A Beimel, Y Ishai, E Kushilevitz, JF Raymond The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002 …, 2002 | 287 | 2002 |
| Randomizing polynomials: A new representation with applications to round-efficient secure computation Y Ishai, E Kushilevitz Proceedings 41st Annual Symposium on Foundations of Computer Science, 294-304, 2000 | 256 | 2000 |
| Succinct non-interactive arguments via linear interactive proofs N Bitansky, A Chiesa, Y Ishai, O Paneth, R Ostrovsky Theory of Cryptography Conference, 315-333, 2013 | 249 | 2013 |
| Secure multiparty computation of approximations J Feigenbaum, Y Ishai, T Malkin, K Nissim, MJ Strauss, RN Wright ACM transactions on Algorithms (TALG) 2 (3), 435-472, 2006 | 236* | 2006 |
| Evaluating branching programs on encrypted data Y Ishai, A Paskin Theory of Cryptography Conference, 575-594, 2007 | 215 | 2007 |
| Share conversion, pseudorandom secret-sharing and applications to secure computation R Cramer, I Damgård, Y Ishai Theory of Cryptography Conference, 342-362, 2005 | 215 | 2005 |
| From secrecy to soundness: Efficient verification via secure computation B Applebaum, Y Ishai, E Kushilevitz International Colloquium on Automata, Languages, and Programming, 152-163, 2010 | 209 | 2010 |
| Non-interactive and non-malleable commitment G Di Crescenzo, Y Ishai, R Ostrovsky Proceedings of the thirtieth annual ACM symposium on Theory of computing …, 1998 | 201 | 1998 |
| Batch codes and their applications Y Ishai, E Kushilevitz, R Ostrovsky, A Sahai Proceedings of the thirty-sixth annual ACM symposium on Theory of computing …, 2004 | 198 | 2004 |
| Founding cryptography on tamper-proof hardware tokens V Goyal, Y Ishai, A Sahai, R Venkatesan, A Wadia Theory of Cryptography Conference, 308-326, 2010 | 193 | 2010 |
| Constant-round multiparty computation using a black-box pseudorandom generator I Damgård, Y Ishai Annual International Cryptology Conference, 378-394, 2005 | 179 | 2005 |
| Private circuits II: Keeping secrets in tamperable circuits Y Ishai, M Prabhakaran, A Sahai, D Wagner Annual International Conference on the Theory and Applications of …, 2006 | 178 | 2006 |
